A superconvergent LDG-hybridizable Galerkin method for second-order elliptic problems
By Bernardo Cockburn, Bo Dong, and Johnny Guzmán
Abstract
We identify and study an LDG-hybridizable Galerkin method, which is not an LDG method, for second-order elliptic problems in several space dimensions with remarkable convergence properties. Unlike all other known discontinuous Galerkin methods using polynomials of degree $k\ge 0$ for both the potential as well as the flux, the order of convergence in $L^2$ of both unknowns is $k+1$. Moreover, both the approximate potential as well as its numerical trace superconverge in $L^2$-like norms, to suitably chosen projections of the potential, with order $k+2$. This allows the application of element-by-element postprocessing of the approximate solution which provides an approximation of the potential converging with order $k+2$ in $L^2$. The method can be thought to be in between the hybridized version of the Raviart-Thomas and that of the Brezzi-Douglas-Marini mixed methods.
1. Introduction
In this paper, we consider the LDG-hybridizable (LDG-H) Galerkin methods recently introduced in Reference 11 and show how to define their numerical traces in order to achieve the optimal order of convergence for the approximation to the flux, and to obtain superconvergence properties similar to those of the hybridized mixed methods of Raviart-Thomas (RT) Reference 16 and the Brezzi-Douglas-Marini (BDM) Reference 4 methods; see also Reference 10.
For the sake of simplicity of the exposition, we carry this out in the setting of the model second-order elliptic problem
where $\Omega \subset \mathbb{R}^d$ is a polyhedral domain ($d\ge 2$),$f \in L^2(\Omega )$, and $\boldsymbol{c}=\boldsymbol{c}(\boldsymbol{x})$ is a symmetric $d\times d$ matrix function that is uniformly positive definite on $\Omega$ with components in $L^\infty (\Omega )$. As usual, we assume that the $(d-1)$-Lebesgue measure of ${\partial \Omega _D}$ is not zero, that $\partial \Omega = \overline{{\partial \Omega _D}}\cup \overline{{\partial \Omega _N}}$ and that ${\partial \Omega _D}\cap {\partial \Omega _N}=\emptyset$.
To describe our results, we need to introduce what we will call hybridized Galerkin methods; they are one of the methods studied in Reference 11. To do that, let us introduce some notation. We denote by ${\Omega _h}=\lbrace K \rbrace$ a triangulation of the domain $\Omega$ of shape-regular simplexes $K$ and set ${\partial \Omega _h}:=\{{\partial K}: K\in {\Omega _h}\}$. We associate to this triangulation the set of interior faces $\mathscr{E}^i_h$ and the set of boundary faces $\mathscr{E}^\partial _h$. We say that $e\in \mathscr{E}^i_h$ if there are two simplexes $K^+$ and $K^-$ in ${\Omega _h}$ such that $e={\partial K}^+\cap {\partial K}^-$, and we say that $e\in \mathscr{E}^\partial _h$ if there is a simplex in ${\Omega _h}$ such that $e={\partial K}\cap {\partial \Omega }$. We set $\mathscr{E}_h:=\mathscr{E}^i_h\cup \mathscr{E}^\partial _h$.
The hybridized Galerkin methods Reference 11 are dual-mixed hybrid methods (see the definition in Reference 8 and an early example in Reference 15) which seek an approximation to the exact solution $(\boldsymbol{q}|_\Omega ,u|_\Omega ,u|_{\mathscr{E}_h\setminus {\partial \Omega _N}})$,$(\boldsymbol{q}_h,u_h,\lambda _h)$, in a finite-dimensional space $\boldsymbol{V}_h\times W_h\times M_h$ of the form
and determines it by requiring that
for all $(\boldsymbol{v},\omega ,\mu )\in \boldsymbol{V}_{h} \times W_{h}\times M_h$. Here, we have used the notation
for any functions $\boldsymbol{\sigma }, \boldsymbol{v}$ in $\boldsymbol{H}^1({\Omega _h}):=[H^1({\Omega _h})]^d$ and $\zeta , \omega$ in the space $H^1({\Omega _h})=\{v\in L^2(\Omega ):v|_{K}\in H^1(K)\quad \forall K\in {\Omega _h}\}$. The outward normal unit vector to ${\partial K}$ is denoted by $\boldsymbol{n}$.
To complete the description of the hybridized Galerkin methods, the definition of numerical traces $(\widehat{\boldsymbol{q}}_h,\widehat{u}_h)$ on the faces of the triangulation $\mathscr{E}_h$ has to be provided. The choice which is relevant here is
where $\mathsf{P}_{\partial }$ denotes an $L^2$-projection defined as follows. Given any function $\zeta \in L^2(\mathscr{E}_h)$ and an arbitrary face $e\in \mathscr{E}_h$, the restriction of $\mathsf{P}_{\partial }\zeta$ to $e$ is defined as the element of $\mathscr{P}^k(e)$ that satisfies
Note that by suitably choosing the local spaces$\boldsymbol{V}(K)$,$W(K)$, and $M(e)$, and the values of the local stabilization parameters$\tau$, we can obtain the hybridized RT$_k$, the hybridized BDM$_k$ and the LDG-H$_k$ methods; see Tables 1 and 2. In Table 1 and in the remainder of this paper, we denote the space of polynomials of degree at most $k\ge 0$ defined on $D$ by $\mathscr{P}^k(D)$, and set $\boldsymbol{\mathscr{P}}^k(D):=[\mathscr{P}^k(D)]^d$. Since all these methods can be implemented in the same way and can be used in different elements while being automatically coupled, what is relevant, as argued in Reference 11, is to find out which method should be used in what element in order to optimize the computational effort. It is thus important from this perspective to develop DG methods as accurate and efficient as mixed methods so that they can be used in situations in which mixed method cannot. The LDG-H methods we uncover in this paper are the first example of those methods.
It is well known that the RT$_k$ and BDM$_k$ methods provide an approximation $\boldsymbol{q}_h$ to the flux which converges in $L^2$ with order $k+1$, that $u_h$ and $\lambda _h$ superconverge in $L^2$-like norms to suitably chosen projections of the potential $u$ with order $k+2$, and that, as a consequence, it is possible to postprocess the approximate solution to obtain another approximation $u_h^*$ converging in $L^2$ with order $k+2$; see Reference 1 and Reference 4, and also Reference 10. In this paper, we use an extension of the postprocessing proposed in Reference 17Reference 18 and Reference 14. Given the similarities between these two mixed methods and the LDG-H$_k$ method, it is natural to ask if it is possible to choose the local penalization parameters $\tau$ as to obtain similar convergence and superconvergence results. The main contribution of this paper is to show that this is actually possible.
Indeed, we show that this happens if we take, on each simplex $K\in {\Omega _h}$,
where $e_{K}^{\tau }$ is an arbitrary but fixed face of $K$ and $\tau _K$ is a strictly positive real number. Since the local penalization parameter $\tau$ is nonzero only on a single face of each simplex, we call this LDG-H method the single-face hybridizable DG method; for simplicity, we are going to refer to the method under consideration by the $\text{SF-H}_k$ method. It is interesting to note two of the minimal dissipation DG methods considered in Reference 6, in the framework of a study of superconvergence properties of DG methods for one-dimensional steady-state convection-diffusion problems, happen to be an SF-H method. The first is called the md-DG method (see Table 1 in Reference 6) and is obtained, in our notation, by taking on each interior node $x_i$,
where $h_i$ is the size of the interval to the left of the node $x_i$. The second is called the md-LDG method, and is obtained by taking the above choice of parameters $\tau$ formally letting $\tau (x_i^-)$ go to infinity. The authors are not aware of any other instance of SF-H methods. In particular, let us emphasize that SF-H methods are not LDG methods whenever the stabilization parameters $\tau$ are finite; see the discussion about LDG-H methods in Reference 11.
In Table 3, we compare the orders of convergence for the flux of this method and the above-mentioned mixed methods. We have also included the order of convergence for the general LDG-H methods; it can be deduced from their characterization Reference 11 and the study of DG methods carried out in Reference 5. Finally, in Table 4, we display the orders of convergence of the postprocessed approximation $u_h^*$ to the potential.
We also uncover new relations between these three methods. One of the main features of the hybridizable Galerkin methods proposed in Reference 11 is that the only degrees of freedom that turn out to be globally coupled are those of the so-called Lagrange multiplier $\lambda _h$. This implies, in particular, that the LDG-H methods can be more efficiently implemented than the LDG methods introduced in Reference 12. In fact, see the discussion in Reference 11, they can be implemented as efficiently as the hybridized RT$_k$; see Reference 7 for the case $k=0$ in two dimensions, and BDM$_k$ mixed methods, see Reference 10 for the case $k\ge 0$ in multi-dimensions for both of these methods. Here we show that the stiffness matrix of the Lagrange multiplier for the RT$_k$,BDM$_k$ and $\text{SF-H}_k$ methods is actually identical and that, when $f|_K\in \mathscr{P}^{k-1}(K)$ for all $K\in {\Omega _h}$, these methods provide the same approximation $(\boldsymbol{q}_h,\lambda _h)$.
Next, let us briefly comment on the approach taken to carry out the a priori error analysis of the $\text{SF-H}_k$ methods. We did not take the approach used in Reference 5 to analyze DG and LDG methods, or that used in the unified analysis of DG methods Reference 2. Instead, we exploited the unifying framework introduced in Reference 11 to render the analysis of the $\text{SF-H}_k$ methods as close as possible to those of the hybridized RT$_k$ and BDM$_k$ methods. Since a key ingredient in those analyzes is the existence of a projection $(\boldsymbol{\Pi },\mathbb{P})$ satisfying the so-called commutativity property
for all $\boldsymbol{\sigma }\in \boldsymbol{H}(div,\Omega )$, the crucial step in the analysis was to find a similar projection. Unlike the above-mentioned mixed methods, the space of fluxes $\boldsymbol{V}_h$ of the $\mathop{\text{SF-H}}_k$ methods is not included in $\boldsymbol{H}(div,\Omega )$ and, as a consequence, the above commutativity property can only be satisfied in a weak sense. We found a new projection satisfying the following weak version of the commutativity property:
for all $(\boldsymbol{\sigma },\zeta )\in \boldsymbol{H}^1({\Omega _h})\times H^1({\Omega _h})$ such that $\zeta |_{{\partial \Omega }}=0$. Just as the local spaces of the $\mathop{\text{SF-H}}_k$ methods are, roughly speaking, “in between” the local spaces of the RT$_k$ and BDM$_k$ methods, this projection can also be considered to be “in between” the corresponding projections of those mixed methods. The construction of this projection, which is intimately linked to the definition of the numerical traces of the method $\widehat{u}_h$ and $\widehat{\boldsymbol{q}}_h$ and to the choice of the local spaces, is certainly the most interesting aspect of the analysis of the $\mathop{\text{SF-H}}_k$ methods. The first component of the projection, $\boldsymbol{\Pi }$, was used in the error analysis of the minimal dissipation LDG method in Reference 9.
The paper is organized as follows. In Section 2, we state and discuss our main results and then prove them in Section 3. In Section 4, we display numerical experiments validating the theoretical results. Finally, in Section 5, we end with some concluding remarks.
2. The main results
2.1. The projection $(\boldsymbol{\Pi },\mathbb{P})$
Given a function $\boldsymbol{\sigma }\in \boldsymbol{H}^1({\Omega _h})$ and an arbitrary simplex $K\in {\Omega _h}$, the restriction of $\boldsymbol{\Pi }\boldsymbol{\sigma }$ to $K$ is defined as the element of $\boldsymbol{\mathscr{P}}^k(K)$ that satisfies
Similarly, given a function $\zeta \in H^1({\Omega _h})$ and an arbitrary simplex $K\in {\Omega _h}$, the restriction of $\mathbb{P}\zeta$ to $K$ is defined as the element of $\mathscr{P}^k(K)$ that satisfies
We gather the main properties of this projection in the following result. To state it, we need to recall the definition of some classical projections. Given a function $\boldsymbol{\sigma }\in \boldsymbol{H}^1({\Omega _h})$ and an arbitrary simplex $K\in {\Omega _h}$, the restriction of $\boldsymbol{\Pi }^{{\scriptscriptstyle {\mathrm{RT}}}}\boldsymbol{\sigma }$ to $K$ is defined as the element of $\boldsymbol{\mathscr{P}}^k(K)\oplus \boldsymbol{x}\,\mathscr{P}(K)^k$ that satisfies
Given a function $\zeta \in H^1({\Omega _h})$ and an arbitrary simplex $K\in {\Omega _h}$, the restriction of $\mathsf{P}^\ell \zeta$ to $K$ is defined as the element of $\mathscr{P}^\ell (K)$ that satisfies
To simplify the notation, we are going to write $\mathsf{P}$ instead of $\mathsf{P}^k$. Note that $(\boldsymbol{\Pi }^{{\scriptscriptstyle {\mathrm{RT}}}},\mathsf{P})$ is nothing but the projection for the RT$_k$ method. We are now ready to state our result.
We are going to show that the three orthogonality properties imply all the others; they are thus the crucial properties for the analysis. Note also that, by simply adding the identity (iv) over all $K\in {\Omega _h}$, we obtain the weak commutativity property discussed in the introduction.
2.2. Characterization of the approximate solution
Next we give a characterization of the approximate solution provided by the $\mathop{\text{SF-H}}_k$ method. We begin by characterizing the difference between the numerical traces and the traces of the approximate solutions on each simplex.
We see that the jump $(\widehat{\boldsymbol{q}}_h-\boldsymbol{q}_h)\cdot \boldsymbol{n}$ is independent of the value of $\tau$ whereas the jump $\widehat{u}_h-u_h$ is inversely proportional to $\tau$. Moreover, by the estimate ($v$) of Proposition 2.1, we have that,
for any $r\in [0,k]$, and we see that the size of jump under consideration depends solely on the smoothness of $f|_K$. For example, if $\mathsf{P}f|_K$ is a polynomial of degree $k-1$, then $(\widehat{\boldsymbol{q}}_h-\boldsymbol{q}_h)\cdot \boldsymbol{n}=0$ on $e_{K}^{\tau }$. This implies that $(\widehat{\boldsymbol{q}}_h-\boldsymbol{q}_h)\cdot \boldsymbol{n}=0$ on ${\partial K}$ for every $K\in {\Omega _h}$ and, as a consequence, that $\boldsymbol{q}_h\in \boldsymbol{H}(div,\Omega )$. Now, if $f\in H^r(K)$, for some $r\in [0,k]$, then we have that
by well-known approximation properties of the projection $\mathsf{P}$.
Next, we give a characterization of the approximate solution which follows from a similar result for more general methods obtained in Reference 11. To state it, we need to introduce the local solvers associated with the method. The first local solver is defined on the simplex $K\in {\Omega _h}$ as the mapping $\mathsf{m}\in L^2({\partial K})\rightarrow (\boldsymbol{\mathcal{Q}}{\mathsf{m}}, \,\mathcal{U}{\mathsf{m}}) \in \boldsymbol{\mathscr{P}}^k(K)\times \mathscr{P}^k(K)$ where
The other local solver is defined on the simplex $K\in {\Omega _h}$ as the mapping $f\in L^2(K)\rightarrow (\boldsymbol{\mathcal{Q}}{f}, \,\mathcal{U}{f}) \in \boldsymbol{\mathscr{P}}^k(K)\times \mathscr{P}^k(K)$ where
We can now state our characterization result.
This result allows us to shed light on the effect of local stabilization parameters $\tau$ on the approximate solution. It will also allow us to compare the RT$_k$, the BDM$_k$ and the $\text{SF-H}_k$ methods, see Reference 10 for a comparison of the hybridized version of the RT$_k$ and the BDM$_k$ methods. These results are gathered in the following theorem. To state it, we use the projection $\mathsf{P}^{k-1}$ which is defined by Equation 2.4 for $k\ge 1$ and which we take to be identically zero when $k=0$. We keep this convention in the remainder of the paper.
2.3. A priori error estimates
In this subsection, we obtain a priori error estimates for the error of the approximation $(\boldsymbol{q}_h,u_h,\lambda _h)\in \boldsymbol{V}_h\times W_h\times M_h$ given by the $\mathop{\text{SF-H}}_k$ and the numerical trace $\widehat{u}_h$ defined by Equation 1.4a. To state them, we need to introduce new notation.
For any real-valued function $\zeta$ in $H^{l}({\Omega _h})$, we set
We begin by measuring the error in the approximation of the flux $\boldsymbol{q}$ in the norm $\|\,\boldsymbol{\sigma }\,\|_{L^2({\Omega _h};\boldsymbol{c})}=(\boldsymbol{c}\,\boldsymbol{\sigma },\boldsymbol{\sigma })_{{\Omega _h}}^{1/2}$.
Note that the upper bound of the error is independent of the local stabilization parameters $\tau$, in complete agreement with the characterization of the approximate solution given by Theorem 2.3. It is interesting to realize that the first estimate also holds for the RT$_k$ and BDM$_k$ methods when the projection $\boldsymbol{\Pi }$ is suitably chosen; see Reference 13 and Reference 4. Such an estimate is obtained by using the commutativity property and the fact that the image of their projections is in $\boldsymbol{H}(div,\Omega )$. Since our projection $(\boldsymbol{\Pi },\boldsymbol{p})$ only satisfies a weak version of the commutativity property, a much more delicate analysis has to be carried out to obtain it.
In Reference 5, it was shown that for general LDG methods with penalization parameters of order $1/h$, the order of convergence of the approximations for flux $\boldsymbol{q}$ using polynomials of degree $k$ is only $k$; this order is sharp because it is actually attained for some LDG methods. It was also shown that, for DG methods with both penalization parameters of order one, the order of convergence of the approximations for the flux using polynomials of degree $k$ is $(k+1/2)$. Here, we obtain an order of convergence of $(k+1)$.No other DG method has this property.
Next, we present several estimates for the error in the approximation of the potential $u$. The first is a superconvergence result. To state it, we need to introduce the adjoint equations
We also need to assume that the following elliptic regularity result holds
for $s\in [0,k]$. Note that, since we are working with domains that can be triangulated by using straight-faced simplexes, the above result only holds if such a domain is convex and $s=0$. However, we want to write this assumption in such a generality since the method will be extended to domains with smooth curved boundaries in a forthcoming paper.
It is interesting to note that the above superconvergence result holds for any choice of local stabilization parameters $\tau _K$ such that $\kappa$ is uniformly bounded, that is, such that $1/(h_K\,\tau _K)$ is uniformly bounded with respect to $h$. This shows that $\tau _K$ cannot be too small for superconvergence to take place.
A straightforward consequence of this theorem is the following result.
Note that the above result shows that if $1/\tau _K$ is uniformly bounded for quasi-uniform triangulations, the convergence of $u_h$ is still optimal, provided $\boldsymbol{q}$ is smoother than required, that is, provided $\boldsymbol{q}\in \boldsymbol{H}^{r+1}({\Omega _h})$ instead of just $\boldsymbol{q}\in \boldsymbol{H}^{r}({\Omega _h})$. Of course, in this case, the superconvergence of $u_h$ to $\mathbb{P}u$ is lost.
The next result is a superconvergence result for the Lagrange multiplier $\lambda _h$. To state it, we use the following norm:
There are no results of this type for any other DG method. However, the RT$_k$ and the BDM$_k$ methods have both similar results. Here we exploited the similarity of the $\text{SF-H}_k$ methods with the RT$_k$ and BDM$_k$ methods to obtain these superconvergence results.
2.4. Postprocessing
We end this section by showing how to exploit the superconvergence results to postprocess $u_h$,$\boldsymbol{q}_h$ and $\hat{u}_h$ to get a better approximation to $u$ defined as follows.
On the simplex $K$, we define the new approximation of $u$,${u}^\star _h$, as the function of $\mathscr{P}^{k+1}(K)$ given by
Here $\boldsymbol{a}=\boldsymbol{c}^{-1}$ and $\mathscr{P}_0^{k+1}(K)$ is the collection of functions in $\mathscr{P}^{k+1}(K)$ with mean zero. The postprocessing technique just introduced is a slight modification of a postprocessing proposed in Reference 17Reference 18 and Reference 14; it consists of using the numerical trace $\widehat{\boldsymbol{q}}_h$ instead of $\boldsymbol{q}_h$.
It is easy to see that this postprocessing is associated to a locally conservative method. Indeed, the scheme satisfied by $u^\star _h$ on each simplex $K\in {\Omega _h}$ is
which is nothing but the property of local conservativity.
Note that $\tilde{u}_h$ is well defined. Indeed, if we take $w=1$ in equation Equation 2.9c, the right-hand side is also equal to zero thanks to equation Equation 1.3b. The fact that it provides a better approximation to the potential $u$ than $u_h$ is contained in the following result.
Note that when $\mathsf{P}f|_K\in \mathscr{P}^{k-1}(K)$ for all $K\in {\Omega _h}$, by Theorem 2.4 we have that the function $(\widehat{\boldsymbol{q}}_h\cdot \boldsymbol{n}, \mathsf{P}^{k-1} u_h, \lambda _h)$ is the same for the RT$_k$,BDM$_k$($k \ge 1$) and $\text{SF-H}_k$ methods. As a consequence, the postprocessed approximation $u^\star _h$ is also the same for all these methods.
Note also that in Reference 3, a general postprocessing which is solely based on approximation results was obtained. When applied to the $\text{SF-H}_k$ method for $k\ge 1$, it gives rise to an approximation of $u$ which converges with the same orders as ours. However, unlike such postprocessing, our postprocessed solution $u_h^\star$ is associated to a locally conservative scheme; it is also easier to compute.
Let us end this section by noting that all the error estimates for $k\ge 1$ hold if in the equation Equation 1.3b, we replace $f$ by any function $\mathcal{I}_h f$ such that $\mathcal{I}_h f|_K\in \mathscr{P}^{k-1}(K)$ for all $K\in {\Omega _h}$ and such that
Moreover, by statement (ii) of Theorem 2.4, the function $(\boldsymbol{q}_h,\mathsf{P}^{k-1}u_h,\lambda _h)$ provided by the RT$_k$, the BDM$_k$ and the $\text{SF-H}_k$ method is the same; in particular, we have that $\boldsymbol{q}_h\in \boldsymbol{H}(div,\Omega )$. The postprocessed approximation $u^\star _h$ is also the same for those three methods.
3. Proofs
In this section, we present detailed proofs of all our results.
3.1. Proof of Proposition 2.1: The properties of $(\boldsymbol{\Pi }, \mathbb{P})$
3.1.1. Two key auxiliary results about polynomials
To prove Proposition 2.1, we begin by stating and proving two lemmas whose use is crucial in our analysis.
We are only going to give a detailed proof of Lemma 3.2 since the proof of Lemma 3.1 is similar and simpler.
3.1.2. Proof of the orthogonality properties
It is not difficult to see that the fact that $(\boldsymbol{\Pi },\mathbb{P})$ is well defined is a direct corollary of Lemmas 3.1 and 3.2.
Now, let us prove the orthogonality properties. The property (i) follows from the property Equation 2.2a defining $\mathbb{P}$ and the orthogonality property (ii) follows from the property Equation 2.1a defining $\boldsymbol{\Pi }$. The orthogonality property (iii) follows from the properties Equation 2.2b and Equation 2.1b defining $\mathbb{P}$ and $\boldsymbol{\Pi }$, and from the definition of the projection $\mathsf{P}_{\partial }$,Equation 1.5. In fact, it follows from the fact that on each face $e$ of any simplex $K$, we have that either $\mathbb{P}\zeta =\mathsf{P}_{\partial }\zeta$ or $\boldsymbol{\Pi }\boldsymbol{\sigma }\cdot \boldsymbol{n}=\mathsf{P}_{\partial }\boldsymbol{\sigma }\cdot \boldsymbol{n}$.
3.1.3. Proof of the weak commutativity property
The weak commutativity property (iv) is a direct consequence of the three orthogonality properties we just proved. Indeed, we have that
by the definition of the projection $\mathsf{P}_{\partial }$,Equation 1.5. This completes the proof of (iv).
3.1.4. Proof of the estimates (v) and (vi)
Note that, by the definition of the projections $\boldsymbol{\Pi }$,Equation 2.1, and $\boldsymbol{\Pi }^{{\scriptscriptstyle {\mathrm{RT}}}}$,Equation 2.3, we have that
for all $\boldsymbol{v}\in \boldsymbol{\mathscr{P}}^{k-1}(K)$, if $k>1$, and for all $\omega \in \mathscr{P}^{k}(e)$ and all faces $e$ of $K$. By a well-known scaling argument, we immediately obtain that
by the definition of the projections $\boldsymbol{\Pi }$,Equation 2.1. Taking $\omega =Z$, where $Z$ is given by Lemma 3.1 with $z:=\boldsymbol{\Pi }\boldsymbol{\sigma }\cdot \boldsymbol{n}-\mathsf{P}_{\partial }\boldsymbol{\sigma }\cdot \boldsymbol{n}$, we get that, for any $p$ in $\mathscr{P}^{k-1}(K)$,
for all $\mathsf{w}\in \mathscr{P}^{k-1}(K)$, if $k\ge 1$, and for all $\omega \in \mathscr{P}^{k}(e_{K}^{\tau })$. This implies that Lemma 3.1 holds with $z:=\mathsf{P}_{\partial }\zeta -\mathsf{P}\zeta$ and $Z=\mathbb{P}\zeta -\mathsf{P}\zeta$. As a consequence,
by the definition of the projection $\mathsf{P}$,Equation 2.4 and that of the projection $\mathsf{P}_{\partial }$,Equation 1.5. A well-known scaling argument states that given any function $z$ such that its restriction to each face $e$ of $k$ belongs to $\mathscr{P}^k(e)$, there is a function $\boldsymbol{Z}$ in $\boldsymbol{\mathscr{P}}^k(K)\oplus \boldsymbol{x}\,\mathscr{P}^k(K)$ such that
where $h_K$ is the diameter of the simplex $K$ and $C$ depends solely on the shape-regularity constants of the simplex $K$. Taking $\boldsymbol{v}:=\boldsymbol{Z}$ with $z=\mathsf{P}\zeta -\mathsf{P}_{\partial }\zeta$ in equation Equation 3.1, we obtain that
To prove the results of the characterization of the approximate solution of the SF-H method, we begin by proving two auxiliary results concerning key properties of the local solvers.
3.2.1. Two auxiliary results about the local solvers
To state the first auxiliary result, we need to introduce the following decomposition of our local spaces:
by the definition of the projection $\boldsymbol{\Pi }$,Equation 2.1b, and that of the projection $\mathsf{P}_{\partial }$,Equation 1.5. So, we only have to prove that
The statement (i) of Theorem 2.4 follows directly from Theorem 2.3 and from Lemma 3.3.
To prove the remaining statements, we are going to use the fact that the RT$_k$,BDM$_k$ and $\text{SF-H}_k$ methods have exactly the same structure and satisfy the characterization Theorem 2.3; see Reference 11. The only difference between these methods is the choice of local spaces (see Table 1) and the choice of the local stabilization parameters $\tau$; see Table 2. Thus, to prove statement (ii) we only have to show that the functions $(\boldsymbol{\mathcal{Q}}{\mathsf{m}},\mathsf{P}^{k-1}\,\mathcal{U}{\mathsf{m}})$ and $(\boldsymbol{\mathcal{Q}}{f},\mathsf{P}^{k-1}\,\mathcal{U}{f})$ are the same for all these methods whenever $f|_K\in \mathscr{P}^{k-1}(K)$ for all $K\in {\Omega _h}$. Similarly, to prove statement (iii), we only have to show that $\boldsymbol{\mathcal{Q}}{\mathsf{m}}$ is the same for all these methods.
To do that, we begin by noting that we have, by Lemma 3.3, that the function $(\boldsymbol{\mathcal{Q}}{\mathsf{m}},\mathsf{P}^{k-1}\,\mathcal{U}{\mathsf{m}})\in \boldsymbol{\mathcal{V}}(K)\times \mathcal{W}(K)$ is determined by
and that the function $(\boldsymbol{\mathcal{Q}}{f},\mathsf{P}^{k-1}\,\mathcal{U}{f})\in \boldsymbol{\mathcal{V}}^\perp (K)\times \mathcal{W}(K)$ is determined by the equations
where $\,\mathcal{U}{f}|_{e_{K}^{\tau }}=0$, by ($\alpha$) of Lemma 3.3, if $f|_K\in \mathscr{P}^{k-1}(K)$. Since the four equations above also hold (the third whenever $f|_K\in \mathscr{P}^{k-1}(K)$) for the BDM$_k$ method, we conclude that the statements (ii) and (iii) hold if we exclude the RT$_k$ method.
To show that these statements also hold if we include it, we note that the above equations hold for the RT$_k$ method if we modify the definition of the spaces $\boldsymbol{\mathcal{V}}(K)$ and $\boldsymbol{\mathcal{V}}(K)$ by
and from the fact that, if $\boldsymbol{\mathcal{Q}}{f}\in \boldsymbol{\mathcal{V}}_{\mathrm{{RT}}}^\perp (K)$ and $\nabla \cdot \boldsymbol{\mathcal{Q}}{f}=\mathsf{P}f\in \mathscr{P}^{k-1}(K)$, then $\boldsymbol{\mathcal{Q}}{f}$ belongs to the space $\{\boldsymbol{v}\in \boldsymbol{\mathscr{P}}^{k}(K):\; (\boldsymbol{c}\;\boldsymbol{v},\boldsymbol{\sigma })_K=0\;\;\forall \;\boldsymbol{\sigma }\in \boldsymbol{\mathcal{V}}(K)\}=\boldsymbol{\mathcal{V}}^\perp (K)$. This completes the proof of Theorem 2.4.
3.3. Proof of the error estimates
The proof of the error estimates is based on the error equations and the properties of the projection $(\boldsymbol{\Pi },\mathbb{P})$ gathered in Proposition 2.1. The error equations are
for all $(\boldsymbol{v},\omega )\in \boldsymbol{V}_h\times W_h$.
A direct consequence of the weak commutativity identity (iv) of Proposition 2.1 that we find convenient to use in our analysis is contained in the following result.
3.3.1. Proof of Theorem 2.5: The error in the flux
Theorem 2.5 follows immediately from the following auxiliary result.
we need to estimate the number $(\mathbb{P}u-u_h,\theta )_{\Omega }$. It is expressed in a suitable way in the following auxiliary result. Let us recall that $\mathsf{P}^{k-1}$ is defined by Equation 2.4 for $k\ge 1$, and is $\mathsf{P}^{k-1}\equiv 0$ for $k=0$.
Assume that $k\ge 1$. Then, applying the Cauchy-Schwarz inequality and using the estimate of $\boldsymbol{q}-\boldsymbol{q}_h$ in Theorem 2.5, and the approximation properties of the projections $\mathsf{P}^{k-1}$ and $\mathbb{P}$,($v$) in Proposition 2.1 and ($\beta$) in Corollary 3.6, we readily obtain
where $r,s\in [0,k-1]$. Since $\kappa :=\max _{K\in {\Omega _h}} \frac{1}{h_K\,\tau _K}$ and using the elliptic regularity assumption Equation 2.8, we get
Finally, let us consider the case $k=0$ and $f=0$. By the identity (v) of Proposition 2.1 we have that $\boldsymbol{\Pi }\boldsymbol{\sigma }\cdot \boldsymbol{n}=\mathsf{P}_{\partial }\boldsymbol{\sigma }\cdot \boldsymbol{n}$, and by the identity (vi) of Proposition 2.1 we have that $\boldsymbol{\Pi }\boldsymbol{q}=\boldsymbol{\Pi }^{{\scriptscriptstyle {\mathrm{RT}}}}\boldsymbol{q}$. This implies that
3.3.3. Proof of Theorem 2.8: Superconvergence of $\widehat{u}_h$
To prove this theorem, let us begin by estimating $\|\,\mathsf{P}_{\partial }u-\widehat{u}_h\,\|^2_{L^2(e)}$ for each face $e$ of each simplex $K$. For the face $e_{K}^{\tau }$, we have that, by definition of the projection $\mathbb{P}$,Equation 2.2,
Now we consider the error in the faces $e$ of $K$ which are different from the face $e_{K}^{\tau }$. By the error equation Equation 3.2a, we have that, for all $\boldsymbol{v}\in \boldsymbol{\mathscr{P}}^k(K)$,
where $\kappa :=\max _{K\in {\Omega _h}}1/(\tau _K\,h_K)$. The result now follows from Theorems 2.6, 2.5 and 2.4 (i). This completes the proof of Theorem 2.8.
3.3.4. Proof of Theorem 2.9: The error estimate for ${u}^\star _h$
By the definition of ${u}^\star _h$,Equation 2.9a, we have that
By using the definition of the Raviart-Thomas projection $\boldsymbol{\Pi }^{{\scriptscriptstyle {\mathrm{RT}}}}$,Equation 2.3, and by using its commutativity property, we get that, for any $r\in [0,k]$,
by Theorem 2.5 and the well-known approximation properties of $\mathsf{P}^{k+1}$.
Let us now estimate the error $\overline{u}-\overline{u}_h$. We begin by considering the case $k\ge 1$. In this case, since $\overline{u}-\overline{u}_h=\overline{\mathbb{P}(u-u_h)}$, we get
by Theorem 2.6. Note that by Theorem 2.4, $\mathsf{P}^{k-1}u_h$ is independent of the value of the local stabilization parameters $\tau$. This implies that the same is true for $\overline{u}_h$ and so, we get that
In this section, we carry out numerical experiments to validate the theoretical convergence properties of the $\text{SF-H}_k$ method.
To do that, we use uniform meshes obtained by discretizing $\Omega =(-{\frac{1}{2}},{\frac{1}{2}})\times (-{\frac{1}{2}},{\frac{1}{2}})$ with squares of side $2^{-l}$ which are then divided into two triangles as indicated in Figure 1; the resulting mesh is denoted by “mesh=$l$”.
The test problem is obtained by taking ${\partial \Omega _N}=\emptyset , \boldsymbol{c}=\boldsymbol{I}$ and choosing $g$ and $f$ so that the exact solution is $u(x,y)=\cos (\pi x) \cos (\pi y)$ on the domain $\Omega$. The history of convergence of the SF-H method with
on the “mesh=$l$”, is displayed in Table 5 for polynomials of degree $k=0$,$k=1$ and $k=2$. We observe optimal convergence rates of the quantities $\|u-u_h\|_{L^2(\Omega )}$ and $\|q-q_h\|_{L^2(\Omega )}$ for $k=0,1,2$ as predicted by Theorems 2.5 and 2.7. We also see that $\|P_{\partial } u-\lambda _h\|_{L^2(\mathcal{E}_h;h)}$ and $\|u-u_h^*\|_{L^2(\Omega )}$ superconverges with rate $O(h^{k+2})$ for $k=1,2$ just as predicted by Theorems 2.8 and 2.9. These results do not guarantee that these quantities are superconvergent if $k=0$ and $f \not \equiv 0$. Since we do not observe superconvergence, we can conclude that the theoretical results for such a case are actually sharp.
Next we explore the effect of the size of $\tau _K$ on the quality of the approximation. In Table 6, we see that as $\tau$ diminishes the quality of the approximation to $u$ deteriorates. However, the effect of taking $\tau =1/h^2$ or $\tau =1/h$ is almost negligible especially when the grids are not coarse. We also see that the order of convergence is $k+1$ for $\tau =1/h^2, \tau =1/h$ and $\tau =1$, but it is only $k$ for $\tau =h$. This is in perfect agreement with Corollary 2.7.
We end with an example where the exact solution is harmonic, that is, $\boldsymbol{c}=\boldsymbol{I}, f \equiv 0$, and display the convergence rates for $k=0$ in Table 7. We take ${\partial \Omega _N}=\emptyset$ and choose $g$ and so that $u(x,y)= e^x \sin (y)$ is the solution. We see that the quantities $\|P_{\partial } u-\lambda _h\|_{L^2(\mathcal{E}_h;h)}$ and $\|u-u_h^*\|_{L^2(\Omega )}$ superconverge with the rate $O(h^{2})$ as our theoretical results predict.
5. Concluding remarks
The error analysis carried out here for the $\text{SF-H}_k$ method also holds for the hybridized versions of the RT$_K$ and the BDM$_k$ methods. We simply have to replace the local space $\boldsymbol{\mathscr{P}}^{k}(K)\times \mathscr{P}^k(K)$ by the local space $\boldsymbol{V}(K)\times W(K)$ given by Table 1, use the definition of the local stabilization parameter $\tau$ given in Table 2, and suitably define the projection $(\boldsymbol{\Pi },\mathbb{P})$. Indeed, with such changes, the first four properties of Proposition 2.1, on which the whole analysis is based, hold. For this reason, we can consider this analysis to be a unifying analysis of these three methods.
A study of the optimal way to choose the local stabilization parameter $\tau$ falls beyond the scope of this paper and will be carried out elsewhere. Extensions of these results to more general second-order elliptic equations and other boundary conditions are straightforward. The extension of these results to the case of hanging nodes, variable-degree approximations and curved domains constitute the subject of ongoing work.
D. N. Arnold and F. Brezzi, Mixed and nonconforming finite element methods: implementation, postprocessing and error estimates, RAIRO Modél. Math. Anal. Numér. 19 (1985), 7–32. MR 813687 (87g:65126)
Reference [2]
D. N. Arnold, F. Brezzi, B. Cockburn, and L. D. Marini, Unified analysis of discontinuous Galerkin methods for elliptic problems, SIAM J. Numer. Anal. 39 (2002), 1749–1779. MR 1885715 (2002k:65183)
Reference [3]
J. H. Bramble and J. Xu, A local post-processing technique for improving the accuracy in mixed finite-element approximations, SIAM J. Numer. Anal. 26 (1989), no. 6, 1267–1275. MR 1025087 (90m:65193)
Reference [4]
F. Brezzi, J. Douglas, Jr., and L. D. Marini, Two families of mixed finite elements for second order elliptic problems, Numer. Math. 47 (1985), 217–235. MR 799685 (87g:65133)
Reference [5]
P. Castillo, B. Cockburn, I. Perugia, and D. Schötzau, An a priori error analysis of the local discontinuous Galerkin method for elliptic problems, SIAM J. Numer. Anal. 38 (2000), 1676–1706. MR 1813251 (2002k:65175)
Reference [6]
F. Celiker and B. Cockburn, Superconvergence of the numerical traces of discontinuous Galerkin and hybridized mixed methods for convection-diffusion problems in one space dimension, Math. Comp. 76 (2007), 67–96. MR 2261012
Reference [7]
Z. Chen, Equivalence between and multigrid algorithms for nonconforming and mixed methods for second-order elliptic problems, East-West J. Numer. Math. 4 (1996), 1–33. MR 1393063 (98c:65184)
Reference [8]
P. Ciarlet, The finite element method for elliptic problems, North-Holland, Armsterdam, 1978. MR 0520174 (58:25001)
Reference [9]
B. Cockburn and B. Dong, An analysis of the minimal dissipation local discontinuous Galerkin method for convection-diffusion problems, J. Sci. Comput. 32 (2007), 233–262. MR 2320571
Reference [10]
B. Cockburn and J. Gopalakrishnan, A characterization of hybridized mixed methods for second order elliptic problems, SIAM J. Numer. Anal. 42 (2004), 283–301. MR 2051067 (2005e:65183)
Reference [11]
B. Cockburn, J. Gopalakrishnan, and R. Lazarov, Unified hybridization of discontinuous Galerkin, mixed and continuous Galerkin methods for second order elliptic problems, Submitted.
Reference [12]
B. Cockburn and C.-W. Shu, The local discontinuous Galerkin method for time-dependent convection-diffusion systems, SIAM J. Numer. Anal. 35 (1998), 2440–2463. MR 1655854 (99j:65163)
Reference [13]
J. Douglas, Jr. and J. E. Roberts, Global estimates for mixed methods for second order elliptic equations, Math. Comp. 44 (1985), 39–52. MR 771029 (86b:65122)
Reference [14]
L. Gastaldi and R. H. Nochetto, Sharp maximum norm error estimates for general mixed finite element approximations to second order elliptic equations, RAIRO Modél. Math. Anal. Numér. 23 (1989), 103–128. MR 1015921 (91b:65125)
Reference [15]
J. T. Oden and J. K. Lee, Dual-mixed hybrid finite element method for second-order elliptic problems, Mathematical aspects of finite element methods (Proc. Conf., Consiglio Naz. delle Ricerche (C.N.R.), Rome, 1975), Springer, Berlin, 1977, pp. 275–291. Lecture Notes in Math., Vol. 606. MR 0520341 (58:25010)
Reference [16]
P. A. Raviart and J. M. Thomas, A mixed finite element method for second order elliptic problems, Mathematical Aspects of Finite Element Method (I. Galligani and E. Magenes, eds.), Lecture Notes in Math. 606, Springer-Verlag, New York, 1977, pp. 292–315. MR 0483555 (58:3547)
Reference [17]
Rolf Stenberg, A family of mixed finite elements for the elasticity problem, Numer. Math 53 (1988), 513–538. MR 954768 (89h:65192)
Reference [18]
Rolf Stenberg, Postprocessing schemes for some mixed finite elements, RAIRO Modél. Math. Anal. Numér. 25 (1991), 151–167. MR 1086845 (92a:65303)
The first author was supported in part by the National Science Foundation (Grant DMS-0411254) and by the University of Minnesota Supercomputing Institute.
The third author was supported by an NSF Mathematical Science Postdoctoral Research Fellowship (DMS-0503050).
Journal Information
Mathematics of Computation, Volume 77, Issue 264, ISSN 1088-6842, published by the American Mathematical Society, Providence, Rhode Island.
Publication History
This article was received on , revised on , and published on .
Copyright Information
Copyright 2008 American Mathematical Society; reverts to public domain 28 years from publication
Note. To explore an equation, focus it (e.g., by clicking on it) and use the arrow keys to navigate its structure. Screenreader users should be advised that enabling speech synthesis will lead to duplicate aural rendering.