Abstract
We show that two widely used Galerkin formulations for second-order elliptic problems provide approximations which are actually superclose, that is, their difference converges faster than the corresponding errors. In the framework of linear elasticity, the two formulations correspond to using either the stiffness tensor or its inverse the compliance tensor. We find sufficient conditions, for a wide class of methods (including mixed and discontinuous Galerkin methods), which guarantee a supercloseness result. For example, for the HDG\(_{k}\) method using polynomial approximations of degree \({k>0}\), we find that the difference of approximate fluxes superconverges with order \({k+2}\) and that the difference of the scalar approximations superconverges with order \({k+3}\). We provide numerical results verifying our theoretical results.
Similar content being viewed by others
Avoid common mistakes on your manuscript.
1 Introduction
We show that approximate solutions given by two Galerkin formulations for the model second-order elliptic problem
where \(\mathrm {a}= \mathrm {a}(x)\) is a bounded, symmetric and uniformly positive-definite \(d\times d\) matrix-valued function in \({\Omega }\), with inverse \(\mathrm {c}(x)\), \(f\in L^{2}(\Omega )\), \(u_{D}\in H^{1/2}(\partial \Omega _{D})\) and \(\textsf {q}_{N}\in H^{1/2}(\partial \Omega _{N})\), can be superclose, that is, the difference converges faster than the corresponding errors.
These Galerkin formulations differ only in the use of the tensor \(\mathrm {a}\) or its inverse \(\mathrm {c}\) in their formulations. Indeed, the formulations are based on the following equivalent rewritings of our model problem:
Thus, they differ only in the way the second equation is discretized. We observe that, when the tensors \(\mathrm {a}\) and \(\mathrm {c}\) are constant on the mesh, there is no difference between the corresponding Galerkin approximations. In the general case, we find sufficient conditions on the definition of the Galerkin methods which guarantee that their approximations are superclose.
The first formulation seems to be natural when mixed-like methods are defined. In contrast, in most cases, the tensor \(\mathrm {a}\) is the natural data of the model which might be difficult or computationally expensive to actually invert. This is not only true for the simple model problem we are considering here but for more involved elliptic problems like the equations of linear elasticity where \(\mathrm {a}\) corresponds to the stiffness tensor and \(\mathrm {c}\) to the so-called compliance tensor. For the second-order elliptic problem under consideration, Galerkin formulations using the first set of equations have been used to define mixed methods [4] and have also been used for the original introduction of the hybridizable discontinuous Galerkin (HDG) methods [11]; see also the HDG methods for linear elasticity in [15]. On the other hand, there are many methods whose formulation is based on the second set of equations. For instance, in [1] the authors develop a so-called expandedmixed finite element method and give a finite difference interpretation. The HDG methods based on this set of equations are fully discussed in [7], where it is noted that they come directly from the the HDG methods for linear elasticity proposed in [21]. We also highlight that, as pointed out above, in the nonlinear case or when the tensor \(\mathrm {a}\) can not be easily inverted, the second formulation becomes more relevant, see for example the HDG methods for the p-Laplacian equations [14] and the HDG methods for the equations of nonlinear elasticity [20]. Let us end by pointing out that the so-called Hybrid High-Order method, for diffusion [17, 18] and for elasticity, [16], uses a primal formulation which does use the tensor a. And yet, it can be re-interpreted as an HDG method using the first formulation, see [8]. Roughly speaking, this happens because the space of fluxes depends on the tensor a in a suitable manner.
In this paper, we want to address the question of how different are the numerical approximations based on the forms (\(\hbox {A}_1\)) and (\(\hbox {A}_2\)). To do that, we first prove estimates for the difference of the approximations to the negative gradient variable \(\varvec{g}\) and the flux variable \(\varvec{q}\) by a classical energy argument. Then we prove an estimate for the difference of the approximations to the the scalar variable u by using a standard duality argument and by using a non-standard approximation result. In particular, for the HDG method using polynomial approximations of degree \(k>0\) for all the variables, we obtain that the difference of the approximations of the negative gradient and the flux variable converge with an order of \(k+2\), and the scalar variable with an order of \(k+3\), where k is the polynomial degree associated to the local finite element space. This is, in general, 1 and 2 degrees extra than the convergence of each numerical approximation. A practical consequence of these results is that using one or the other formulation is essentially immaterial.
The remainder of the paper is structured as follows. In Sect. 2, we introduce, the general properties satisfied by the finite element approximations based on the Eqs. (\(\hbox {A}_1\)) and (\(\hbox {A}_2\)). We then state and discuss our supercloseness result, Theorem 1; we prove it in Sect. 3. In Sect. 4, we present numerical experiments validating our theoretical findings. We end in Sect. 5 with some concluding remarks.
2 The Finite Element Approximations and Their Supercloseness Properties
In this section, we state and discuss our main results. We begin by introducing the Galerkin methods we consider. We then state our main results, that is, the supercloseness properties between their approximations.
2.1 The Numerical Schemes
Notation
In order to define the discrete primal-dual formulations we first introduce some notation. Let \(\mathcal {T}_h= \{K\}\) be a conforming partition of \(\overline{\Omega }\) into elements K, and let \(\mathcal {F}_h= \{F \in \partial K: K\in \mathcal {T}_h\}\) be the set of all the faces (d \({=}\,\)3) or edges (d \({=}\,\)2) F of the partition. We assume that \(\mathcal {T}_h\) satisfies standard finite element assumptions, see [5] and [6]. The numerical methods that we will introduce next seek for a finite element approximation to the vector fields \(\varvec{g}\) and \(\varvec{q}\), and the scalar field u. These numerical approximations will be defined on the following discontinuous piecewise polynomial spaces:
where \(\varvec{V}(K)\) and W(K) are local spaces, each one contained in a polynomial space.
In addition, we are using the following standard notation:
The Formulations Next, we define the different formulations satisfied by the finite element approximations we are considering. Note that although the methods are assumed to satisfy the equations of each formulation, they are not necessarily defined by them.
The first formulation is based on the Eq. (\(\hbox {A}_1\)): The approximation \((\varvec{g}_{h}^{1},\varvec{q}_{h}^{1},u_{h}^{1})\in \varvec{V}_h\times \varvec{V}_h\times {W_{h}}\) satisfies
The second formulation is based on the equations (\(\hbox {A}_2\)): The approximation \((\varvec{g}_{h}^{2},\varvec{q}_{h}^{2},u_{h}^{2})\in \varvec{V}_h\times \varvec{V}_h\times W_{h}\) satisfies
Note that to complete the definition of the numerical methods, additional information about the local spaces and the numerical traces \(\widehat{u}_{h}^{i}\) and \(\widehat{\varvec{q}}_{h}^{i}\cdot \varvec{n}\) is required, for \(i=1,2\). To obtain our results, only very general conditions need to be imposed which we gather in the assumptions we display next. We first introduce an auxiliary dual problem and its Galerkin approximation by form (\(\hbox {A}_1\)) needed for the estimates by the scalar approximations.
The Auxiliary Dual Problem To prove the estimates for the scalar variable of Theorem 1, we use a duality argument. So, we need to introduce the following dual problem
and the approximation \((\varvec{\psi }_{h},\varphi _{h})\in \varvec{V}_h\times {W_{h}}\) of (4) satisfying Eq. (2), that is,
Assumption
We make the following assumptions on
-
(A)
the local space \(\varvec{V}(K)\), \(K\in \mathcal {T}_h\):
-
(i)
\( \bar{\mathrm {a}}|_{K} (\varvec{g}_{h}^{1}-\varvec{g}_{h}^{2})|_{K} \in \varvec{V}(K)\), where \(\bar{\mathrm {a}}|_{K}\) is the average of tensor \(\mathrm {a}\) on K.
-
(ii)
\( \bar{\mathrm {c}}|_{K} (\varvec{q}_{h}^{1}-\varvec{q}_{h}^{2})|_{K} \in \varvec{V}(K)\), where \(\bar{\mathrm {c}}|_{K}\) is the average of tensor \(\mathrm {c}\) on K.
-
(iii)
\( \bar{\mathrm {a}}|_{K} \varvec{v}|_{K}, \bar{\mathrm {c}}|_{K} \varvec{v}|_{K}\in \varvec{V}(K)\quad \mathrm{for\, all} \quad \varvec{v}\in \varvec{V}(K).\)
-
(i)
-
(B)
the numerical traces
-
(i)
Single-valuedness: \(\widehat{u}_{h}\) and \(\widehat{\varvec{q}}_{h}\cdot \varvec{n}\) are single valued on \(\mathcal {F}_{h}\).
-
(ii)
Non-negativity: \( \langle \widehat{u}_{h}-u_{h}, (\varvec{q}_{h}-\widehat{\varvec{q}}_{h})\cdot \varvec{n}\rangle _{\partial \mathcal {T}_h}\ge 0.\)
-
(iii)
Cancellation: \(\langle u_{h}-\widehat{u}_{h}, (\widehat{\varvec{\psi }}_h-\varvec{\psi }_h)\cdot \varvec{n}\rangle _{\partial \mathcal {T}_h} + \langle \varphi _{h}-\widehat{\varphi }_{h}, (\varvec{q}_{h}-\widehat{\varvec{q}}_{h})\cdot \varvec{n}\rangle _{\partial \mathcal {T}_h} = 0.\)
-
(i)
-
(C)
the approximation properties the flux:
-
(i)
\(\varvec{V}(K) \supset [\mathcal {P}^{0}(K)]^d\),
-
(ii)
\(\Vert \varvec{q}-\varvec{q}^{1}_{h}\Vert _{L^2{{(\mathcal {T}_h)}}}\le {C_{a}} h^\alpha \Vert u\Vert _{H^2(\mathcal {T}_h)}\quad \mathrm{for\, some }\alpha \in (0,1].\)
-
(i)
-
(D)
the elliptic regularity of the dual problem:
$$\begin{aligned} \Vert \varphi \Vert _{H^{2}(\Omega )} + \Vert \varvec{\psi }\Vert _{H^{1}(\Omega ;\mathrm {c})} \le C \Vert \theta \Vert _{L^{2}(\Omega )}, \end{aligned}$$where the norm \(\Vert \cdot \Vert _{H^{1}(\Omega ;\mathrm {c})}\) is the \(H^{1}\)-norm weighted with \(\mathrm {c}^{1/2}\). See Sect. 2.2. This inequality is satisfied, for example, if the domain \(\Omega \) is convex and either \(\partial \Omega _{D}\) or \(\partial \Omega _{N}\) vanishes.
Example
The main examples of methods satisfying the above weak formulations are the hybridized version of the Raviart–Thomas (RT) [19] and Brezzi–Douglas–Marini (BDM) [3] mixed methods, the Discontinuous Galerkin (DG) methods and the so-called hybridizable Discontinuous Galerkin (HDG) [9] methods. In Table 1, we display the choices of the local spaces \(\varvec{V}(K)\), W(K). For the hybridized version of the mixed methods and for the HDG methods, \(\widehat{u}_{h}\) is an additional unknown. This is why we also describe the space M(F) to which the restriction of \(\widehat{u}_{h}\) to the face F belongs. Next, we briefly discuss the satisfaction of the assumptions (A), (B) and (C) by these methods.
2.1.1 The Local Vector Spaces: Assumption (A)
For the DG and HDG\(_{k}\) methods, we see that assumption (Aiii), and hence assumptions (Ai) and (Aii), are satisfied. Assumption (Aiii) is satisfied by the BDM\(_{k}\) method for simplexes, but not for squares (or cubes). The RT\(_{k}\) method does not satisfy condition (Aiii) neither; it does not satisfy condition (Aii) though. See Table 2.
2.1.2 The Numerical Traces: Assumption (B)
For the DG methods, the numerical traces \(\widehat{u}_{h}\) and \(\widehat{\varvec{q}}_{h}\) are explicitly defined in terms of the original unknowns of the problem, \({u_{h}}\) and \(\varvec{q}_{h}\). To describe them, let us recall the standard DG notation for the averages and jumps on the interior faces
The numerical traces are then defined on each \(F\in \mathcal {F}_h\backslash \partial \Omega \) by:
for \(i=1,2\), where the auxiliary parameters \(C_{11}\), \(\varvec{C}_{12}\) and \(C_{22}\) might depend on x. On the boundary faces we imposed the boundary conditions of the problems by
and
for \(i=1,2\). In this way, the DG methods always satisfy assumptions (Bi) and (Biii). They satisfy (Bii) when \(C_{11}\) and \(C_{22}\) are nonnegative.
For the particular case
we have
on all interior faces, and it turns out that we can write
We thus obtain an HDG method, see [7, 11]. For general HDG methods and the hybridized version of the mixed methods, the scalar numerical trace is a single-valued, new unknown on \(\mathcal {F}_h\backslash \partial \Omega _{D}\); on \(\widehat{u}_h=u_D\) on \(\partial \Omega _D\) though. The numerical trace of the flux is defined as a linear combination of the other unknowns with a stabilization function \(\tau \); for the mixed methods, \(\tau =0\). Specifically, we have
for \(i=1,2\). To ensure the satisfaction of assumption (Bi), the methods impose the condition
where \(M_{h} := \{m: m|_{F}\in M(F), \forall F\in \mathcal {F}_h\}\). Finally, when the stabilization function \(\tau (\cdot )\) is just a multiplication operator, that is, \(\tau (\mu ):=\tau {\cdot } \mu \), the assumption (Biii) is satisfied and the assumption (Bii) are satisfied if \(\tau \ge 0\). See Table 2.
2.1.3 The Approximation of the Flux: Assumption (C)
In Table 3, we display several cases in which assumptions (C) are satisfied.
We only consider the cases for which condition (Aii) is also satisfied.
2.2 Supercloseness of the Approximations
To state our results, we use the following notation.
We define the Sobolev space \(X(\mathcal {T}_h) = \prod _{K\in \mathcal {T}_h} X(K)\), for any Sobolev space X, and its norm
Finally, for \(\varvec{v}\in [L^2(\mathcal {T}_h)]^{d}\) we define the norm weighted with a tensor \(\mathrm {c}\) by
We let u be the solution of problem (1) and set \(\varvec{g}:=-\nabla u\) and \(\varvec{q}:=\mathrm {a}\varvec{g}\). We also let \((\varvec{g}_{h}^{1},\varvec{q}_{h}^{1},u_{h}^1)\) and \((\varvec{g}_{h}^{2},\varvec{q}_{h}^{2},u_{h}^{2})\) be numerical approximations satisfying (2) and (3), respectively. for some estimates, we are going to use the following elliptic regularity inequality: Now we are ready to state the supercloseness properties of the approximations satisfying (2) and (3). Its proof is provided in the next section.
Theorem 1
Suppose that the assumption (B) on the numerical traces hold. Then
Suppose now that assumptions (B) and (C) on the approximation of the flux of the first method hold. Then, if the elliptic regularity inequality of assumption (D) holds,
Moreover, if assumption (Aiii) holds and if \([\mathcal {P}^1(K)]^{d}\subseteq \varvec{V}(K)\),
The constants \({C_{1}}\) and \({C_{2}}\) are independent of h and the solution. The constant \({C_{1}}\) depends on \(\Vert \mathrm {c}\Vert _{W^{1,\infty }(\mathcal {T}_h)}\) whereas the constant \({C_{2}}\) depends on \(\Vert \mathrm {c}\Vert _{W^{2,\infty }(\mathcal {T}_h)}\).
Theorem 2
Assume that, for some positive constant \(\kappa \), we have
and set
Then, the estimates of Theorem 1 become
We summarize the application of this result to the numerical methods described in our examples in Table 4. There, we assume that the extra assumption of Theorem 2 holds.
A few remarks are in order. First, note that, when using simplexes, it is known that the first formulation of the HDG\(_k\) method with \(\tau \) of order one, converges with order \(k+1\) in all the approximations; see [12]. Theorem 1 states the the second formulation and the first one are superclose in the sense that the order of convergence of the difference of their approximations converge with order \(k+2\), for the vector-valued approximations, and with order \(k+3\), for the scalar approximation when \(\mathrm {c}\in W^{2,\infty }(\mathcal {T}_h)\).
Note also that, regardless of the actual shape of the elements, when the values of the stabilization function \(\tau ^{\pm 1}\), respectively, \((h\tau )^{\pm 1}\), are of order one, respectively, the order of convergence of the difference of their approximations converge with an additional half an order, respectively, a full order, for the vector-valued approximations, and with three half orders, respectively two full orders, for the scalar approximation whenever \(\mathrm {c}\in W^{2,\infty }(\mathcal {T}_h)\). This also applies to the DG\(_k\) methods.
Concerning the mixed methods, similar results are obtained for the BDM\(_k\) method. Interestingly enough, although the convergence of the method is of order k for the scalar approximations, their difference is of order \(k+3\). On the other hand, since the assumption (Ai) is not satisfied for the RT\(_k\) method, we see that the approximate fluxes, but not the approximate gradients, are superclose. Moreover, the scalar approximations are superclose with an extra power in h, but not two, like to the DG methods or three for the BDM\(_{k}\) method.
The numerical results presented in Sect. 4 confirm that all the results in the above table are sharp.
To end this section, we note that, besides the supercloseness result, Theorem 1 implies that the approximation properties of one scheme can be deduced for those of the other. In particular, if either approximate solution converges, then the other approximate solution converges too, and converges with the same rate.
3 Proofs
Here, we provide detailed proofs of our main result, Theorem 1.
3.1 The Error Equations
We begin by obtaining the error equations. Let \((\varvec{g}_{h}^{1},\varvec{q}_{h}^{1},u_{h}^{1})\) and \((\varvec{g}_{h}^{2},\varvec{q}_{h}^{2},u_{h}^{2})\) be functions satisfying (2) and (3), respectively. Then, if we set
we have, subtracting Eq. (3) from Eq. (2), that
3.2 Proof of Estimates of the Difference for the Vector Unknowns
Here, we prove the estimates for the difference of the approximations to the gradient and to the flux of Theorem 1. To do that, we proceed by using a variation on the classic energy argument.
Step 1: The energy argument Taking \(\varvec{v}:= \varvec{e}_{\varvec{q}}\in \varvec{V}_h\) in the first error Eq. (7a), \(w:=e_u\in W_h\) in the third error Eq. (7c), and adding the resulting equations, we get
After integrating by parts, and after adding and subtracting the term \(\langle e_{\widehat{u}}, \varvec{e}_{\widehat{\varvec{q}}}\cdot \varvec{n}\rangle _{\partial \mathcal {T}_h}\), we get
where we have used the fact that \(\langle e_{\widehat{u}}, \varvec{e}_{\widehat{\varvec{q}}}\cdot \varvec{n}\rangle _{\partial \mathcal {T}_h}=0\) since the numerical traces are single-valued by (Bi), \(e_{\widehat{u}}=0\) on \(\partial \Omega _D\) and \(e_{\widehat{\varvec{q}}}\cdot \varvec{n}=0\) on \(\partial \Omega _N\). Then, by the positivity property (Bii), we obtain
Step 2: The estimate of the difference in the gradient By the second of the equations in (7b),
and, by the last inequality of Step 1,
since \(( \mathrm {c}\varvec{q}_{h}^{1} - \varvec{g}_{h}^{1}, \bar{\mathrm {a}} \varvec{e}_{\varvec{g}})_{\mathcal {T}_h} = 0\). This holds because, by assumption (Ai), \(\bar{\mathrm {a}} \varvec{e}_{\varvec{g}}\in \varvec{V}_h\), and so we can use the first of the equations in (7b) with \(\varvec{v}:= \bar{\mathrm {a}} \varvec{e}_{\varvec{g}}\). Thus,
and we get our estimate
Step 3: The estimate of the difference in the flux By the first of the Eq. (7b) with \(\varvec{v}:=\varvec{e}_{\varvec{q}}\),
and by the last inequality of Step 1, we get
since \(( \varvec{q}_{h}^{2} - \mathrm {a}\varvec{g}_{h}^{2}, \bar{\mathrm {c}} \varvec{e}_{\varvec{q}})_{\mathcal {T}_h} = 0\). Indeed, by assumption (Aii), \(\bar{\mathrm {c}} \varvec{e}_{\varvec{q}}\in \varvec{V}_h\), and we can take \(\varvec{v}:=\bar{\mathrm {c}} \varvec{e}_{\varvec{q}}\) in the second of the equations in (7b). Thus,
and we obtain our first estimate
This completes the proof of the estimates of the difference in the vector unknowns.
3.3 Proof of the Estimates of the Difference for the Scalar Variable
Step 1: An identity for the difference Taking \(w := e_{u}\in W_h\) in the second equation of the approximation to the dual solution, (5b), we get
by the error Eq. (7a) with \(\varvec{v}:=\varvec{\psi }_{h}\in \varvec{V}_{h}\). Since \(\langle \widehat{\varvec{\psi }}_{h}\cdot \varvec{n}, e_{\widehat{u}}\rangle _{\partial \mathcal {T}_h}=0\) because of the single-valuedness of the numerical traces, assumption (Bi) and the fact that \(e_{\widehat{u}}=0\) on \(\partial \Omega _{D}\) and \(\widehat{\varvec{\psi }}_{h}\cdot \varvec{n}=0\) on \(\partial \Omega _{N}\), we obtain
by the first of the Eq. (7b) with \(\varvec{v}:=\varvec{\psi }_h\in \varvec{V}_h\). Finally,
because the term \(\Theta _h:=( \mathrm {c}\varvec{e}_{\varvec{q}}, \varvec{\psi }_h)_{\mathcal {T}_h}+ \langle e_{u}-e_{\widehat{u}}, (\widehat{\varvec{\psi }}_h-\varvec{\psi }_h)\cdot \varvec{n}\rangle _{\partial \mathcal {T}_h}\) is equal to zero.
Let us prove this claim. We have
by the Eq. (5a) with \(\varvec{v}:=\varvec{e}_{\varvec{q}}\). Integrating by parts, we get
by Eq. (7c) with \(w:=\varphi _h\). Finally,
by the cancellation property of the traces, assumption (Biii).
Step 2: The first estimate To obtain our first estimate, we first note that
by the second of the equations in (7b) with \(\varvec{v}:=P_{\varvec{V}_h}(\mathrm {c}\varvec{\psi })\), where \(P_{\varvec{V}_h}\) is the \(L^2\)-projection into \(\varvec{V}_h\). Then we easily get that
by assumption (Cii) and the approximation properties of \(P_{\varvec{V}_{h}}\) in combination with assumption (Ci). The result now follows from the estimates of the errors in the vector unknowns and the elliptic regularity inequality.
Step 3: An auxiliary non-standard, approximation result The improved estimate of the error in the scalar unkown is more delicate to prove. To prove it, we are going to use the following simple but non-standard auxiliary result.
Lemma 3.1
Assume that \(\mathcal {P}^{1}(K)\subseteq \varvec{V}(K)\). Then, the following estimate holds
Proof
Since \(\mathcal {P}^{1}(K)\subseteq \varvec{V}(K)\), we have that \((I-{P}_{\varvec{V}_h})\mathcal {P}^{1}(K)=\{\varvec{0}\}\), and so
To estimate the right-hand side, we need a variation of Taylor’s expansion which would not use second-order derivatives of \(\varvec{\psi }\) (otherwise we would not be able to use the elliptic regularity inequality), but only those of \(\mathrm {c}\). In the one-dimensional case, such variation is the following identity:
Using this identity (with \(f:=(\mathrm {c}-\bar{\mathrm {c}})_{ij}\) and \(g:=\varvec{\psi }_{j}\), \(i,j=1,...,d\)) and bounding each of the resulting terms using approximations in \(\mathcal {P}^{1}(K)\), we easily get the following estimate for star-shaped, uniformly regular elements:
This completes the proof. \(\square \)
Step 4: The improved estimate We are now ready to prove the last estimate. Since assumption (Aiii) holds, we have that \(\bar{\mathrm {c}}\varvec{\psi }_{h}\in \varvec{V}_{h}\), and we can take \(\varvec{v}:=\bar{\mathrm {c}}\varvec{\psi }_{h}\) in the second of the Eq. (7b) to get that
by the second of the Eq. (7b) with \(\varvec{v}:=P_{\varvec{V}_h}\left( (\mathrm {c}-\bar{\mathrm {c}})\varvec{\psi }\right) \). Then,
by Lemma 3.1 and by assumption (Cii). The improved estimate now follows by using the elliptic regularity inequality.
It remains to show the last statement of Theorem 1.
3.4 Proof of Theorem 2
Using the triangle inequality in the estimate of the error in the flux, we get
But by Step 2 of the estimates of the vector unknowns, we can obtain that
without having to use Asssumption (Ai). As a consequence, we readily get that
where \(C:= 2/(1-\Vert \mathrm {a}^{\frac{1}{2}}(\mathrm {c}-\bar{\mathrm {c}})\mathrm {a}^{\frac{1}{2}}\Vert _{L^{\infty }(\mathcal {T}_h)}\le 2/(1-\kappa )\) by our assumption. We can then write that
The other estimates follow in a similar manner.
This completes the Proof of Theorem 2.
4 Numerical Experiments
We present numerical experiments devised to corroborate our theoretical results on supercloseness. To do that, we take \(\Omega := (0,1)^{2}\), \(\partial \Omega _{D} = \partial \Omega \), and set f and \({u_{D}}\) such that the exact solution of our model problem with
is \(u=\sin (2\pi x_1)\sin (2\pi x_2)\). We consider an initial unstructured triangulation (see Fig. 1) and we estimate the orders of convergence as we refine uniformly, indexing the meshes with a mesh parameter \(h_{l}\), for \(l=1,2,3,4,5\). We do this piecewise polynomial approximations of degree \(k =1 2, 3, 4\); we also take \(k=0\) for the RT\(_k\), DG\(_k\) and HDG\(_{k}\)methods).
The results for the RT\(_{k}\), BDM\(_{k}\), DG\(_{k}\) (with parameters \(C_{11} = 1.0\), \(C_{22} =1.0\) and \(\varvec{C}_{12} = [1.0,1.0]^{t}\)) and HDG\(_{k}\) method (with \(\tau =1.0\)) are displayed on the Tables 5, 6, 7 and 8, respectively. In all cases, we observe the supercloseness orders predicted by Theorem 1 and displayed in Table 4. It is interesting to see that for the RT\(_k\) method, the difference of the approximations of the flux shows one order of convergence more than the for difference of the approximations of the gradient, which reflects the fact that for the RT\(_k\) method assumption (Bii) is satisfied but assumption (Bi) is not satisfied. This difference in the convergence properties of the approximate fluxes and gradients does not appear in the BDM\(_{k}\) method as this method satisfies both assumptions.
For uniform meshes of squares of size h, we estimate the orders of convergence as we refine the mesh by taking \(h=2^{-l}\), for \(l=1,2,3,4,5\). The results for the HDG\(_{k}\) method, with \(\tau =1.0\), are displayed in the bottom of Table 8. Again, we do observe the same orders of supercloseness as the ones predicted by Theorem 1 and displayed in Table 4.
5 Extensions and Concluding Remarks
We have proved the supercloseness property of two Galerkin formulations for second-order elliptic problems. Our analysis holds for a wide class of mixed finite element methods, as for instance the Raviart–Thomas [19] and Brezzi–Douglas–Marini [3] elements, discontinuous Galerkin methods, and hybridizable discontinuous Galerkin methods [11].
Although we have not treated the interior penalty (IP) method [2], it is easy to get even stronger results by using slight modifications to our approach. Indeed, even though our theory does not apply directly, since the definition of the numerical traces does not necessarily satisfy assumptions B (ii) and B (iii), it is not difficult to show, for the first two formulations of the IP method, that difference of the approximations converge with order \(k+3\), \(k+3\) and \(k+2\) for the scalar, the gradient and the flux approximations, respectively. Even more, it is a simple exercise to see that, if the tensor \(\mathrm {a}\) is piecewise linear then the IP schemes give the same approximation for the scalar and gradient variables.
We believe that it is reasonable to expect that similar results hold for the corresponding formulations and numerical methods for linear elasticity.
References
Arbogast, T., Wheeler, M.F., Yotov, I.: Mixed finite elements for elliptic problems with tensor coefficients as cell-centered finite differences. SIAM J. Numer. Anal. 34(2), 828–852 (1997)
Arnold, N.D.: An interior penalty finite element method with discontinuous elements. SIAM J. Numer. Anal. 19(4), 742–760 (1982)
Brezzi, F., Douglas Jr., J., Marini, L.D.: Two families of mixed finite elements for second order elliptic problems. Numer. Math. 47(2), 217–235 (1985)
Brezzi, F., Fortin, M.: Mixed and Hybrid Finite Element Methods. Springer Series in Computational Mathematics, vol. 15. Springer, New York (1991)
Castillo, P., Cockburn, B., Perugia, I., Schötzau, D.: An a priori error analysis of the local discontinuous Galerkin method for elliptic problems. SIAM J. Numer. Anal. 38(5), 1676–1706 (2000)
Ciarlet, P.G.: The finite element method for elliptic problems, volume 40 of Classics in Applied Mathematics. Society for Industrial and Applied Mathematics (SIAM), Philadelphia. Reprint of the 1978 original [North-Holland, Amsterdam; MR0520174 (58 #25001)] (2002)
Cockburn, B.: Static condensation, hybridization, and the devising of the HDG methods. In: Barrenechea, G.R., Brezzi, F., Cagniani, A., Georgoulis, E.H. (eds) Building Bridges: Connections and Challenges in Modern Approaches to Numerical Partial Differential Equations, volume 114 of Lecture Notes of Computer Science Engineering, pp. 129–177. Springer, Berlin, 2016. LMS Durham Symposia funded by the London Mathematical Society. Durham, 8–16 July (2014)
Cockburn, B., Di-Pietro, D.A., Ern, A.: Bridging the hybrid high-order and hybridizable discontinuous Galerkin methods. ESAIM Math. Model. Numer. Anal. 50(3), 635–650 (2016)
Cockburn, B., Dong, B., Guzmán, J.: A superconvergent LDG-hybridizable Galerkin method for second-order elliptic problems. Math. Comput. 77(264), 1887–1916 (2008)
Cockburn, B., Dong, B., Guzmán, J.: A superconvergent LDG-hybridizable Galerkin method for second-order elliptic problems. Math. Comput. 77, 1887–1916 (2008)
Cockburn, B., Gopalakrishnan, J., Lazarov, R.: Unified hybridization of discontinuous Galerkin, mixed, and continuous Galerkin methods for second order elliptic problems. SIAM J. Numer. Anal. 47(2), 1319–1365 (2009)
Cockburn, B., Gopalakrishnan, J., Sayas, F.-J.: A projection-based error analysis of HDG methods. Math. Comput. 79, 1351–1367 (2010)
Cockburn, B., Guzmán, J., Wang, H.: Superconvergent discontinuous Galerkin methods for second-order elliptic problems. Math. Comput. 78, 1–24 (2009)
Cockburn, B., Shen, J.: A hybridizable discontinuous Galerkin method for the \(p\)-Laplacian. SIAM J. Sci. Comput. 38(1), A545–A566 (2016)
Cockburn, B., Shi, K.: Superconvergent HDG methods for linear elasticity with weakly symmetric stresses. IMA J. Numer. Anal. 33(3), 747–770 (2013)
Di-Pietro, D.A., Ern, A.: A hybrid high-order locking-free method for linear elasticity on general meshes. Comput. Methods Appl. Mech. Eng. 283, 1–21 (2015)
Di-Pietro, D.A., Ern, A.: Hybrid high-order methods for variable-diffusion problems on general meshes. C. R. Acad. Sci Paris Ser. I 353, 31–34 (2015)
Di-Pietro, D.A., Ern, A., Lemaire, S.: An arbitrary-order and compact-stencil discretization of diffusion on general meshes based on local reconstruction operators. Comput. Methods Appl. Math. 14(4), 461–472 (2014)
Raviart, P.-A., Thomas, J.M.: A mixed finite element method for 2nd order elliptic problems. In: Mathematical Aspects of Finite Element Methods (Proc. Conf., Consiglio Naz. delle Ricerche (C.N.R.), Rome, 1975), Lecture Notes in Mathematics, Vol. 606, pp. 292–315. Springer, Berlin (1977)
Soon, S.-C.: Hybridizable discontinuous Galerkin methods for solid mechanics. Ph.D. thesis, University of Minnesota, Minneapolis (2008)
Soon, S.-C., Cockburn, B., Stolarski, H.K.: A hybridizable discontinuous Galerkin method for linear elasticity. Int. J. Numer. Methods Eng. 80(8), 1058–1092 (2009)
Acknowledgements
We wish to the thank one of the referees for constructive criticism leading to a better presentation of the material, including the discussion about the IP methods which we originally did not consider.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Cockburn, B., Sánchez, M.A. & Xiong, C. Supercloseness of Primal-Dual Galerkin Approximations for Second Order Elliptic Problems. J Sci Comput 75, 376–394 (2018). https://doi.org/10.1007/s10915-017-0538-0
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10915-017-0538-0