Abstract
Discontinuous Galerkin (DG) methods are extensions of the usual Galerkin finite element methods. Although there are vast amount of studies on DG methods, most of them have assumed shape-regularity conditions on meshes for both theoretical error analysis and practical computations. In this paper, we present a new symmetric interior penalty DG scheme with a modified penalty term. We show that, without imposing the shape-regularity condition on the meshes, the new DG scheme inherits all of the good properties of standard DG methods, and is thus robust on anisotropic meshes. Numerical experiments confirm the theoretical error estimates obtained.
Similar content being viewed by others
Avoid common mistakes on your manuscript.
1 Introduction
Discontinuous Galerkin (DG) methods are extensions of the usual (continuous) Galerkin finite element methods. The idea of introducing penalty terms in finite element methods originated from Nitsche [16] and Babuška [3], while the idea of using discontinuous elements with an interior penalty was introduced by Wheeler [19]. Later, this approach was extended to the cases of nonlinear elliptic and parabolic problems by Arnold [1]. Since then, the DG methods have developed in many directions. For an account of the history of DG methods for elliptic problems, readers are referred to [2, Section 2]. Overall, the mathematical theory of DG methods is well established [4,5,6,7, 17]. In this paper, we consider the symmetric interior penalty (SIP) DG method, which is one of the most basic and well-known DG schemes.
The above mentioned papers and textbooks confirm that a shape-regularity condition has always been imposed on meshes for theoretical error analysis of DG methods. The shape-regularity condition requires that elements in the meshes must be neither very “flat” nor “degenerated” (see Definition 1). If a mesh contains very flat elements, it is said to be anisotropic. The simple numerical experiment described in Sect. 3.3 shows that the standard SIP-DG method is not robust on anisotropic meshes, and that the shape-regularity condition is crucial for practical computations.
The purpose of this paper is to introduce a new SIP-DG scheme that is robust on anisotropic meshes. To this end, we use the general trace inequality to define a new penalty term for the proposed SIP-DG scheme in Sect. 4. In Sect. 5, we show that the new scheme inherits all of the good properties of standard SIP-DG methods. That is, if the penalty parameter is sufficiently large, the new SIP-DG scheme is consistent, coercive, stable, and bounded on arbitrary (proper) meshes (Lemma \(3^{new}\) and Lemma 8). Those properties immediately yield error estimations of the new SIP-DG scheme without imposing the shape-regularity condition (see Corollary 11). An immediate consequence is the error estimate of order \({\mathcal {O}}(h^k)\) under the maximum angle condition on meshes (see Corollary 12). In Sect. 6, we present the results of numerical experiments to confirm the theoretical results obtained. From the results, we conclude that the newly presented SIP-DG scheme is robust on anisotropic meshes.
2 Preliminaries
2.1 The model problem
Let \(\varOmega \subset {\mathbb {R}}^d\), (\(d = 2, 3\)) be a bounded polyhedral domain. Let \(L^2(\varOmega )\), \(H^1(\varOmega )\), and \(H_0^1(\varOmega )\) be the usual Lebesgue and Sobolev spaces (see Sect. 2.3 for notation of their (semi)norms and inner products). We consider the following Poisson problem: find \(u \in H^1(\varOmega )\) such that
where \(\phi \in L^2(\varOmega )\) is a given function. The weak form of the model problem is as follows:
The model problem (2.1) is said to satisfy elliptic regularity if there exists a positive constant \(C_{ell}\) such that the following a priori estimate holds for the exact solution u:
It is well known that if \(\varOmega\) is convex, then the model problem (2.1) satisfies elliptic regularity [8].
2.2 Meshes of \(\varOmega\)
Although DG methods allow elements with a variety of geometries, we consider only simplicial elements in this paper. Thus, we suppose that the domain \(\varOmega\) is divided into a finite number of triangles (\(d=2\)) or tetrahedrons (\(d=3\)), which are assumed to be closed sets. A mesh (or triangulation) of \(\varOmega\) is denoted by \(\mathcal {T}_h\). That is, \(\mathcal {T}_h\) is a finite set of triangles or tetrahedrons that has the following properties:
where \({\text {int}} T_i\) is the interior of \(T_i\). For \(T \in \mathcal {T}_h\), let \({\mathbf {n}}_T\) be the unit outer normal vector on \(\partial T\).
In this paper, we assume that meshes are proper (or face-to-face). This means that, for \(T_1, T_2 \in \mathcal {T}_h\), \(T_1 \ne T_2\),
For a d-simplex T and its facet f, their Lebesgue and Hausdorff measures are denoted by \(|T|\) and \(|f|\), respectively.
For T, we define \(h_T := {{\text {diam}} T}\). If \(d=2\), \(R_T\) is the circumradius of T. Note that \(R_T = l_1l_2h_T/(4|T|)\), where \(l_1 \le l_2 \le h_T\) are the lengths of the edges of T. If \(d=3\), \(R_T\) is defined by
where \(l_1 \le l_2 \le \cdots \le h_T\) are the lengths of the edges of T. As has been seen in [10,11,12,13,14,15], \(R_T\) is an important parameter in measuring interpolation errors on d-simplices. For example, the errors of Lagrange interpolation on T are bounded in terms of \(R_T\), as presented by (5.10) and (5.11).
Remark
The best definition of \(R_T\) for tetrahedrons remains an open problem. A simple example immediately rejects the idea that \(R_T\) for a tetrahedron might be the radius of its circumsphere [14, p. 3]. The definition (2.5) is given in [10]. In [10], another parameter, denoted by \(H_T\), is introduced, and it is shown that \(R_T\) and \(H_T\) are equivalent (see also [15]). In [14], the projected circumradius of T is defined for a tetrahedrons. It is conjectured that \(R_T\) and the projected circumradius are equivalent.
Let \(\mathcal {F}_h := \{f \mid f \text { is a facet of } T \in \mathcal {T}_h\}\). That is, \(\mathcal {F}_h\) is the set of all edges (\(d=2\)) or faces (\(d=3\)) in \(\mathcal {T}_h\). Then, let \(\mathcal {F}_h^\partial := \{f \in \mathcal {F}_h \mid f \subset \partial \varOmega \}\) and \(\mathcal {F}_h^o := \mathcal {F}_h \backslash \mathcal {F}_h^\partial\).
Suppose that we consider a (possibly infinite) family of meshes \(\{\mathcal {T}_h\}_{h > 0}\) with \(h \rightarrow 0\).
Definition 1
(1) The family of meshes \(\{\mathcal {T}_h\}_{h > 0}\) is said to satisfy the shape-regularity condition with respect to \(\sigma\) if there exists a positive constant \(\sigma\) such that
where \(\rho _T\) is the diameter of the inscribed ball of T. We call \(\sigma\) the shape-regular constant in this paper.
(2) The family of meshes \(\{\mathcal {T}_h\}_{h > 0}\) is said to satisfy the maximum angle condition with respect to a constant \(C_{max}\) \((\pi /3< C_{max} < \pi )\) if the following hold for all \(T \in \mathcal {T}_h\) and for all \(\mathcal {T}_h\):
-
An arbitrary inner angle \(\theta\) of T is \(\theta \le C_{max}\) (\(d=2\)), or
-
An arbitrary inner angle \(\theta\) of any facet of T is \(\theta \le C_{max}\), and an arbitrary dihedral angle \(\eta\) of T is \(\eta \le C_{max}\) (\(d=3\)).
(3) The family of meshes \(\{\mathcal {T}_h\}_{h > 0}\) is said to satisfy the circumradius condition if the family satisfies
In this paper, we always assume that the family \(\{\mathcal {T}_h\}_{h > 0}\) of meshes satisfies the circumradius condition.
Remark
If we deal with only a finite family of meshes \(\{\mathcal {T}_h\}\) and we take a sufficiently large \(\sigma > 0\), then the family satisfies the shape-regularity condition because \(\{\mathcal {T}_h\}\) contains only a finite number of d-simplices. However, if \(\sigma\) is too large (say, \(\sigma \ge 10\)), we commonly say that \(\{\mathcal {T}_h\}\) is not shape-regular. In such a case, as mentioned in Sect. 1, \(\{\mathcal {T}_h\}\) is said to be anisotropic.
2.3 Function spaces
Let \(k \ge 1\) be a positive integer. We use the notation \(L^2(\varOmega )\), \(L^2(f)\) \((f \in \mathcal {F}_h)\), \(H^k(\varOmega )\), \(H_0^1(\varOmega )\) for the usual Lebesgue and Sobolev spaces. We denote their norms and semi-norms by, for example, \(\Vert \cdot \Vert _{0,f}\), \(|\cdot |_{1,\varOmega }\), and their inner products by \((\cdot ,\cdot )_f\), \((\cdot ,\cdot )_\varOmega\). Let \(\mathcal {P}_k(K)\) be the set of all polynomials defined on the closed set K with degree less than or equal to a positive integer k.
As usual, we introduce the broken Sobolev and polynomial spaces by
Finally, define \(V := H_0^1(\varOmega )\), \(V_* := H_0^1(\varOmega ) \cap H^2(\varOmega )\), \(V_h := \mathcal {P}_k(\mathcal {T}_h)\), and \(V_{*h} := V_* + V_h\).
2.4 Jump and mean of functions on \(f \in \mathcal {F}_h\)
For each interior facet \(f \in \mathcal {F}_h^o\), there are two simplices that share f. We number those simplices as \(T_{f}^{i} \in \mathcal {T}_h\) \((i=1,2)\) and fix the numbering once the mesh is obtained. Then, we have \(f = T_{f}^{1} \cap T_{f}^{2}\). Recalling that \({\mathbf {n}}_T\) is the unit outer nomal vector on \(\partial T\), define \({\mathbf {n}}_f := {\mathbf {n}}_{T_{f}^{1}}\). For \(v \in H^2(\mathcal {T}_h)\), we set \(v_1 := v|_{T_{f}^{1}}\) and \(v_2 := v|_{T_{f}^{2}}\). We denote the trace operator on \(T_f^i\) to f by \(\gamma _f^i\) (\(i=1,2\)). Define
The jump \([\nabla v]_f\) and average \(\{\nabla v\}_f\) are defined in a similar way.
If \(g \in \mathcal {F}_h^\partial\), then \(g \subset \partial \varOmega\). Let \(g \subset \partial T_g\) with \(T_g \in \mathcal {T}_h\). Then, define
3 Standard SIP-DG scheme
3.1 Definition of SIP-DG scheme
In the SIP-DG scheme, the bilinear form a(u, v) in (2.2) is discretized as
for \(v \in V_{*h}\) and \(w_h \in V_h\), where \(h_f := {{\text{diam}}\, f}\). Here, \(\eta\) is a penalty parameter that is taken to be sufficiently large. To make the notation concise, we set
The terms \(J_h(v,w_h)\) and \(P_h^{std}(v,w_h)\) are called the jump term and penalty term, respectively. The discretized bilinear form \(a_h^{std}(v,w_h)\) is written as
Definition 2
The SIP-DG scheme for the model problem is defined as follows: find \(u_h \in V_h\) such that
3.2 Properties of SIP-DG scheme and error analysis
In the following, we summarize the properties of the SIP-DG method. For their proofs, readers are referred to the standard textbooks [4, 6, 7, 17]. In this section, we mainly refer to [6].
Lemma 3
(Consistency) [6, Lemma 4.8] The exact solution \(u \in V_*\) of the model problem (2.1) is consistent:
Therefore, the solution \(u_h \in V_h\) of the SIP-DG method (3.2) satisfies the Galerkin orthogonality:
We define the norms associated with the bilinear form \(a_h^{std}\) as:
Lemma 4
Suppose that the mesh \(\mathcal {T}_h\) is shape-regular with respect to a constant \(\sigma > 0\) and the penalty parameter \(\eta\) is sufficiently large. Then,
- (1):
-
\((\mathbf {Discrete\; coercivity})\) [6, Lemma 4.12] The bilinear form \(a_h^{std}\) is coercive in \(V_h\) with respect to the norm \(\Vert \cdot \Vert _{\mathcal {DG}}\):
$$\begin{aligned} a_h^{std}(w_h,w_h) \ge \frac{1}{2} \Vert w_h\Vert _{\mathcal {DG}}^2, \quad \forall w_h \in V_h. \end{aligned}$$ - (2):
-
\((\mathbf {Discrete\; stability})\) The following inequality holds:
$$\begin{aligned} \frac{1}{2}\Vert v_h\Vert _{\mathcal {DG}} \le \sup _{w_h \in V_h} \frac{a_h^{std}(v_h,w_h)}{\Vert w_h\Vert _{\mathcal {DG}}}, \quad \forall v_h \in V_h. \end{aligned}$$ - (3):
-
\((\mathbf {Boundedness})\) [6, Lemma 4.16] The following inequality holds:
$$\begin{aligned} a_h^{std}(v,w_h) \le C \Vert v\Vert _{\mathcal {DG}*}\Vert w_h\Vert _{\mathcal {DG}}, \quad \forall (v,w_h) \in V_{*h}\times V_h, \end{aligned}$$where the constant \(C := C(\eta ,\sigma )\) is independent of h.
Theorem 5
[6, Theorem 4.17] Suppose that the mesh \(\mathcal {T}_h\) is shape-regular with respect to a constant \(\sigma > 0\) and the penalty parameter \(\eta\) is sufficiently large. Then, there exists a unique SIP-DG solution \(u_h \in V_h\) of (3.2), and the following error estimate holds:
where the constant C depends only on the penalty parameter \(\eta\) and \(\sigma\).
Corollary 6
[6, Corollary 4.18] Suppose that the assumptions of Theorem 5hold and that the exact solution u of the model problem (2.1) belongs to \(H^2(\varOmega )\). Then, we have the following error estimate:
where the constant C depends on \(\eta\) and \(\sigma\), but is independent of h.
3.3 Numerical experiments (part 1)
We consider a numerical experiment to examine how the shape-regular constant \(\sigma\) affects the practical computations involved in the standard SIP-DG scheme.
Set \(\varOmega :=(0,1)\times (0,1)\) and \(\phi (x,y):= \pi ^2\sin (\pi x)\sin (\pi y)\) in the model problem (2.1). Then, the exact solution is \(u(x,y)=\sin (\pi x)\sin (\pi y)/2\). Let n and m be positive integers. We divide the horizontal and vertical sides of \(\varOmega\) into n and m equal segments, respectively. We then draw diagonal lines in each small rectangle to define the mesh, as depicted in Fig. 1.
We fix \(n=40\) and the penalty parameter \(\eta = 10\). We apply the standard SIP-DG method to the model problem with various m. The conjugate gradient method with the incomplete Cholesky decomposition preconditioner (ICCG) is used for the linear solver. The successive over-relaxation (SOR) method is also used occasionally to check whether the obtained \(u_h\) is reasonable. The results are summarized in Table 1.
Here, for \(T \in \mathcal {T}_h\), \(h={{\text {diam}}{T}}\), R is the circumradius of T, the “\(L^2\)-error” is \(|u - u_h|_{L^2(\varOmega )}\), the “\(H^1(\mathcal {T}_h)\)-error” is \(a_h^{(0)}(u - u_h,u-u_h)^{1/2}\), the “\(P_h^{std}\)-error” is \(P_h^{std}(u-u_h,u-u_h)^{1/2}\), and the “DG-error” is \(\Vert u-u_h\Vert _{\mathcal {DG}}\). We employ the 4-point Gauss quadrature of degree 3 on triangles to compute those errors. We see that the errors given by the SIP-DG method decrease as m increases until \(m = 100\), which is consistent with the theoretical error estimates. However, the errors increase as m increases from \(m=120\). The ICCG iterations do not converge for \(m = 200\), while the SOR iterations give almost the same results until \(m=160\). For \(m=180, 200\), the SOR iterations converge quickly but the obtained \(u_h\) are not reasonable.
We also examined the case \(m=400\). In this case, we required \(\eta =30\) to obtain reasonable \(u_h\).
4 New penalty term and SIP-DG scheme
From the numerical experiments described in the previous section, we can conclude that the shape-regularity condition is crucial for the standard SIP-DG method with a fixed penalty parameter \(\eta\). It is natural to wonder why this is the case.
The most important term in the SIP-DG scheme is the penalty term \(P_h^{std}(v,w_h)\) defined by (3.1). The penalty term originates from the trace inequalities
where f is an arbitrary facet of \(T \in \mathcal {T}_h\). Note that the constants \(C_i^{tr}\) (\(i=1,2\)) strongly depend on the shape-regular constant \(\sigma\).
To avoid imposing the shape-regularity condition, we adopt the general trace inequalities
which are valid on an arbitrary d-simplex T. Warburton and Hesthaven [18] presented explicit forms of the constants \(C_i^{tr}\) (\(i=3,4\)) that are independent of the geometry of T. Note that (4.1) is a “simplified” version of (4.2) under the shape-regularity condition. We introduce a quantity on each \(f \in \mathcal {F}_h\) below.
Let \(f \in \mathcal {F}_h^o\). Then, there exist \(T_f^{1}\), \(T_f^{2} \in \mathcal {T}_h\) such that \(f = T_f^{1} \cap T_f^{2}\). Let \(\widetilde{T}_{f}^{i}\) be the d-simplex whose vertices are those of f and the barycenter of \(T_{f}^{i}\) (\(i=1,2\)). Then, define
If \(g \in \mathcal {F}_h^\partial\), then \(g \subset \partial \varOmega\). Let \(g \subset \partial T_g\) with \(T_g \in \mathcal {T}_h\) and \(\widetilde{T}_g\) be the d-simplex whose vertices are those of g and the barycenter of \(T_g\). Define
Note that
See Fig. 2. We remark that the only information we need for the simplex \(\widetilde{T}_f^i\) is its measure \(|\widetilde{T}_f^i| = |T_f^i|/(d+1)\).
With the quantity \(\left\{ \frac{|f|}{|\widetilde{T}_f|}\right\}\) defined for \(f \in \mathcal {F}_h\), we (re)define the penalty term and SIP-DG bilinear form \(a_h^{std}\) as
Note that, if a mesh satisfies the shape-regularity condition, \(\left\{ \frac{|f|}{|\widetilde{T}_f|}\right\} \approx \frac{1}{h_f}\) for any facet \(f \in \mathcal {F}_h\), and \(P_h^{new}\) becomes equivalent to the standard penalty term \(P_h^{std}\).
Definition 7
The SIP-DG scheme for the model problem is redefined as follows: find \(u_h \in V_h\) such that
Remark
To see the meaning of the new penalty terms (4.4), let us consider a small part of the mesh of Fig. 1, as shown in Fig. 3.
The mesh consists of congruent right triangles. Let T be one of the right triangles, and \(f_1\), \(f_2\) be its edges as depicted in Fig. 3. Set \(h = |f_1|\). Then, \(|f_2| = \alpha h\), where \(0< \alpha < 1\). Elementary geometry tells us that \(\left\{ \frac{f_2}{|\widetilde{T}_{f_2}|}\right\} = 12/h\),
Note that if T is becoming degenerated, the coefficient \(12\eta /\alpha\) will increase. This means that we can interpret the coefficient \(\eta \left\{ \frac{|f|}{|\widetilde{T}_f|}\right\}\) as an “improved” version of the standard penalty term coefficient \(\frac{\eta }{h_f}\) with the “adaptive” parameter \(\alpha\).
5 Properties of the new bilinear form \(a_{h}^{new}\) and error estimates
In this section, we show that, without imposing the shape-regularity condition, the new SIP-DG scheme inherits all of the good properties from the standard SIP-DG scheme.
From the definitions, it is clear that Lemma 3 still holds for the new \(a_{h}^{new}\):
Lemma 3\(^{new}\) (Consistency) The exact solution \(u \in V_*\) of the model problem (2.1) is consistent:
Therefore, the solution \(u_h \in V_h\) of SIP-DG method (3.2) satisfies the Galerkin orthogonality:
We redefine the norms associated with the SIP-DG scheme:
The following lemma holds. Its proof is quite similar to the standard proofs. Here, we loosely follow the proofs given by Di Pietro and Ern [6].
Lemma 8
Suppose that the penalty parameter \(\eta\) is sufficiently large. Then,
- (1):
-
\((\mathbf {Discrete\; coercivity})\) The bilinear form \(a_{h}^{new}\) is coercive in \(V_h\) with respect to the norm \(\Vert \cdot \Vert _{\mathcal {DG}}^{new}\):
$$\begin{aligned} a_{h}^{new}(w_h,w_h) \ge \frac{1}{2} \left( \Vert w_h\Vert _{\mathcal {DG}}^{new}\right) ^2, \quad \forall w_h \in V_h. \end{aligned}$$ - (2):
-
\((\mathbf {Discrete\; stability})\) The following inequality holds:
$$\begin{aligned} \frac{1}{2}\Vert v_h\Vert _{\mathcal {DG}}^{new} \le \sup _{w_h \in V_h} \frac{a_{h}^{new}(v_h,w_h)}{\Vert w_h\Vert _{\mathcal {DG}}^{new}}, \quad \forall v_h \in V_h. \end{aligned}$$ - (3):
-
\((\mathbf {Boundedness})\) The following inequalities hold:
$$\begin{aligned} a_{h}^{new}(v,w_h)&\le C \Vert v\Vert _{\mathcal {DG}*}^{new}\Vert w_h\Vert _{\mathcal {DG}}^{new}, \quad \forall (v,w_h) \in V_{*h}\times V_h, \end{aligned}$$(5.3)$$\begin{aligned} a_{h}^{new}(v,w)&\le \Vert v\Vert _{\mathcal {DG}*}^{new}\Vert w\Vert _{\mathcal {DG}*}^{new}, \quad \forall (v,w) \in V_{*h}\times V_{*h}, \end{aligned}$$(5.4)where the constant \(C := C(\eta , C_4^{tr})\) is independent of h and the geometry of elements in \(\mathcal {T}_h\).
Proof
(1) Let \(w_h \in V_h\). For \(f \in \mathcal {F}_h^o\), there exist \(T_f^{i} \in \mathcal {F}_h\) (\(i=1,2\)) with \(f = T_f^{1} \cap T_f^{2}\). It follows from the trace inequality (4.2) that
Hence, we have
We also obtain a similar inequality for the case \(f \in \mathcal {F}_h^{\partial }\).
Because of \(J_h(w_h,w_h) = 2\sum _{f \in \mathcal {F}_h} (\{\nabla w_h \} \cdot {\mathbf {n}}_f, [w_h])_f\) and (4.3), we have that
Thus, it follows from the arithmetic-geometric mean that
for some constant \(\delta > 0\). Set \(\delta := 1/2\), and let \(\eta\) be sufficiently large so that \(\eta \ge (C_4^{tr})^2\). Then, the following coercivity holds:
(2) For arbitrary \(v_h \in V_h\), we have
because of the coercivity.
(3) By the Cauchy–Schwarz inequality, we see that
Furthermore, we have that
It follows from (5.5) and (4.3) that
Therefore, we obtain
For \((v,w) \in V_{*h} \times V_{*h}\), we immediately obtain
Gathering these inequalities together, we conclude that (5.3) and (5.4) hold. \(\square\)
Theorem 9
For the exact solution \(u \in V_{*h}\) of the model problem (2.1) and its SIP-DG solution \(u_h \in V_h\) of (4.6), the following error estimate holds:
where the constant \(C=C(\eta ,C_4^{tr})\) is independent of h and the geometry of elements in \(\mathcal {T}_h\).
Proof
By the consistency of \(a_{h}^{new}\), we have
Thus, the discrete coercivity and boundedness yield
for an arbitrary \(y_h \in V_h\). Therefore, we obtain
Taking the infimum for \(y_h \in V_h\) and rewriting C, we conclude that (5.7) holds. \(\square\)
To derive a more practical error estimation, we prepare another general trace inequality. Let T be a d-simplex and f be a facet of T. The following inequality holds [17, p.24]:
Now, let \(\mathcal {I}_h^ku \in \mathcal {P}_k(\mathcal {T}_h)\) be an interpolation of u that satisfies
Note that the usual Lagrange interpolation satisfies (5.9). Insert \(\mathcal {I}_h^k u\) into \(y_h\) in (5.7), and set \(U := u - \mathcal {I}_h^k u\). Then, \([U]_f = 0\) on any \(f \in \mathcal {F}_h\), and \(P_h^{new}(U,U) = 0\). Therefore, we see that
For a facet \(f \in \mathcal {F}_h^o\), let \(f = T_f^{1} \cap T_f^{2}\), \(T_f^{i} \in \mathcal {T}_h\), and \(U_i := U|_{T_f^{i}}\). The trace inequality (5.8) yields
and thus
That is, the following theorem has been proved.
Theorem 10
Let \(u \in V_{*h}\) be the exact solution of the model problem (2.1), and \(u_h \in V_h\) be its SIP-DG solution (4.6). Then, we have the following error estimation:
where \(\mathcal {I}_h^k u\) is an interpolation that satisfies (5.9), and the constant \(C = C(C_4^{tr}, C_5^{tr}, \eta )\) is independent of h and the geometry of elements in \(\mathcal {T}_h\).
Let \(\mathcal {I}_h^1 u\) be the usual Lagrange interpolation of u and let \(R_T\) be the quantity defined in Sect. 2.2. Suppose that \(k = 1\), \(d = 2\) and \(u \in H^2(\varOmega )\). Then, \(|u - \mathcal {I}_h^1 u|_{2,T} = |u|_{2,T}\), and, from the results in [11, 13],
where the constant \(C_{L1}\) is independent of the geometry of T. Thus, we find that
where \(R := \max _{T \in \mathcal {T}_h} R_T\) and \(h := \max _{T \in \mathcal {T}_h} h_T\).
Suppose that \(k \ge 2\), \(d=2,3\), and \(u \in H^{k+1}(\varOmega )\). Then, from [10, 13, 14],
and
where the constant \(C_{Lk}\) is independent of the geometry of T. Therefore, we have obtained the following corollary.
Corollary 11
Let \(u \in V_{*h}\) be the exact solution of the model problem (2.1), and \(u_h \in V_h\) be its SIP-DG solution (4.6). Suppose that \(u \in H^{k+1}(\varOmega )\). Then, we have the following error estimations:
where the constant \(C = C(C_4^{tr}, C_5^{tr}, C_{Lk}, \eta )\) is independent of h, R, and the geometry of elements in \(\mathcal {T}_h\).
Let \(d=2\). In this case, elementary geometry (the law of sines) tells us that a mesh \(\mathcal {T}_h\) satisfies the maximum angle condition if and only if there exists a constant \(\sigma _2\) such that
Recently, it is reported that the same situation holds for tetrahedrons. That is, a tetrahedron satisfies the maximum angle condition if and only if (5.12) holds [9]. See also [15]. Hence, we have the following corollary.
Corollary 12
Suppose that \(k \ge 1\) if \(d = 2\), and \(k \ge 2\) if \(d = 3\). Let \(u \in V_{*h}\) be the exact solution of the model problem (2.1), and \(u_h \in V_h\) be its SIP-DG solution (4.6). Suppose that \(u \in H^{k+1}(\varOmega )\) and \(\mathcal {T}_h\) satisfies the maximum angle condition. Then, we have the following error estimation:
where the constant C depends only on \(C_4^{tr}\), \(C_5^{tr}\), \(C_{Lk}\), \(\eta\), and \(\sigma _2\).
For an \(L^2\) error estimate, we have the following theorem, which is quite similar to the Aubin–Nitsche lemma.
Theorem 13
Let \(d=2\). Let \(u \in V_{*h}\) be the exact solution of the model problem (2.1), and \(u_h \in V_h\) be its SIP-DG solution (4.6). Suppose that the model problem satisfies the elliptic regularity (2.3). Then, we have the following error estimation:
where \(C = C(C_4^{tr}, C_5^{tr}, \eta , C_{ell}, C_{L1})\).
Proof
Setting \(\phi := u - u_h\) in (2.2), we consider an auxiliary problem: find \(\zeta \in H_0^1(\varOmega )\) such that
Because of the elliptic regularity (2.3), we have \(\Vert \zeta \Vert _{2,\varOmega } \le C_{ell} \Vert u-u_h\Vert _{0,\varOmega }\). Because \(\zeta \in H^2(\varOmega )\), we have \([\nabla \zeta ]\cdot {\mathbf {n}}_f = {\mathbf {0}}\) on any \(f \in \mathcal {F}_h^o\), and \([\zeta ] = 0\) on any \(f \in \mathcal {F}_h\). Hence, the definition of \(a_{h}^{new}\) implies that
Let \(\mathcal {I}_h^{1}\zeta\) be the piecewise linear Lagrange interpolation of \(\zeta\) on \(\mathcal {T}_h\). Because of the Galerkin orthogonality in Lemma \(3^{new}\), we infer that
Therefore, it follows from (5.4) and (5.10) that
This completes the proof. \(\square\)
Corollary 14
Let \(d = 2\). Let \(u \in V_{*h}\) be the exact solution of the model problem (2.1), and \(u_h \in V_h\) be its SIP-DG solution (4.6). Suppose that elliptic regularity holds, and \(u \in H^{k+1}(\varOmega )\). Then, we have the following error estimation:
where the constant \(C = C(C_4^{tr}, C_5^{tr}, \eta , C_{ell}, C_{L1})\) is independent of h, R, and the geometry of elements in \(\mathcal {T}_h\).
Remark
It is conjectured that Theorem 13 and Corollary 14 hold for \(d = 3\). To show this conjecture, we need to use a different interpolation, such as the Crouzeix–Raviart interpolation, and analyze its error in terms of the \(\Vert \cdot \Vert _{DG*}^{new}\) norm.
6 Numerical experiments for the new SIP-DG scheme
In this section, we report the results of numerical experiments to confirm the theoretical results obtained in the previous section. First, we consider the same numerical experiment as in Sect. 3.3 (the same domain \(\varOmega\), same function \(\phi\), and same meshes \(\mathcal {T}_h\)) with the new SIP-DG scheme. We fix \(n=40\) and the penalty parameter \(\eta = 0.8\).Footnote 1 Then, the new SIP-DG method is applied to the model problem (2.1) with various m. The results are summarized in Table 2.
Note that the discretized solution \(u_h\) is stable for all cases, and the errors decrease as m increases, which is consistent with the error estimations.
To see how \(\eta\) affects the performance of the proposed SIP-DG scheme, we vary \(\eta\) as 0.6, 0.5, 0.4, 0.3, 0.2, 0.1 in the cases \(m=40\) and \(m=120\). The proposed SIP-DG scheme is stable if \(\eta \ge 0.4\). The scheme becomes unstable (more CPU time and less accuracy) if \(\eta \le 0.3\). The ICCG method does not converge if \(\eta = 0.1\).
For the next experiment, we set \(\varOmega := (-1,1)\times (-1,1)\) and \(f(x,y) := \pi ^2 \sin (\pi x) \sin (\pi y)\) in (2.1). In this case, the exact solution is again \(u(x,y) = \sin (\pi x) \sin (\pi y)/2\). We introduce the following Schwarz–Peano-type meshes for \(\varOmega\).
For a given positive integer N and \(\alpha > 1\), we consider the isosceles triangle with base length \(h:=2/N\) and height \(2/\lfloor 2/h^\alpha \rfloor \approx h^\alpha\) (then, \(R_T \approx h^\alpha /2 + h^{2-\alpha }/8\)), as depicted in Fig. 4. We triangulate \(\varOmega\) with this triangle as shown in Fig. 5. Note that if \(h \rightarrow 0\), these meshes satisfy neither the shape-regularity condition nor the maximum angle condition. Furthermore, if \(\alpha \ge 2.0\) and \(h \rightarrow 0\), the meshes do not satisfy the circumradius condition. See Kobayashi–Tsuchiya [12].
We compute the SIP-DG solutions on this mesh with \(\alpha = 1.2\), 1.5, 1.8, 2.0, 2.1 and various N, and measure the errors. Figures 6 and 7 list the numerical results. Tables 3 and 4 contain concrete values of the numerical results for \(\alpha =1.5\) and \(\alpha =2.0\), respectively.
It seems that both errors behave similarly as \(\alpha\) varies. Observing Figs. 6 and 7, we can infer that \(a_h^{(0)}(u-u_h,u-u_h)^{1/2}\) and \(P_h^{(0)}(u-u_h,u-u_h)^{1/2}\) are \({\mathcal {O}}(R)\), that is, the errors are governed by the parameter R, not h. For example, when \(\alpha = 2.1\), the errors \(a_h^{(0)}(u-u_h,u-u_h)^{1/2}\) and \(P_h^{(0)}(u-u_h,u-u_h)^{1/2}\) increase as h decreases. However, the ratio \(a_h^{(0)}(u-u_h,u-u_h)^{1/2}/R\) and \(P_h^{(0)}(u-u_h,u-u_h)^{1/2}/R\) seem to be bounded by a constant.
7 Conclusion
Using the general trace inequality (4.2), we have presented a new penalty term (4.4) and a new SIP-DG scheme (4.5). We have established its error estimates without imposing the shape-regularity condition. From numerical experiments, we have confirmed that the new SIP-DG scheme is robust on anisotropic meshes.
The main idea in this paper is to use \(\left\{ \frac{|f|}{|\widetilde{T}_f|}\right\}\) instead of the standard term \(\frac{1}{h_f}\) in the penalty term. Because this idea is very simple, we expect that it can be extended in many directions and will be used in many DG schemes. In the following, we mention some directions that are immediately apparent.
-
Application to many variants of DG methods.
-
Application of the new SIP-DG scheme to non-proper meshes, and the establishment of error estimations for these cases.
-
Investigation of the possibility of applying the proposed approach to hybridized DG methods.
Notes
If we set \(\alpha =1\) in (4.7), we have \(\left\{ \frac{|f|}{|\widetilde{T}_f|}\right\} = 12/h\). Therefore, setting \(\eta = 0.8\) in the proposed SIP-DG scheme approximately corresponds to setting \(\eta = 10\) in the standard SIP-DG scheme in this case.
References
Arnold, D.N.: An interior penalty finite element method with discontinuous elements. SIAM J. Numer. Anal. 19, 742–760 (1982)
Arnold, D.N., Brezzi, F., Cockburn, B., Marini, L.D.: Unified analysis of discontinuous Galerkin methods for elliptic problems. SIAM J. Numer. Anal. 39, 1749–1779 (2002)
Babuška, I.: The finite element method with penalty. Math. Comput. 27, 221–228 (1973)
Brenner, S.C., Scott, L.R.: The Mathematical Theory of Finite Element Methods, 3rd edn. Springer, Berlin (2008)
Cangiani, A., Dong, Z., Georgoulis, E.H., Houston, P.: \(hp\)-Version Discontinuous Galerkin Methods on Polygonal and Polyhedral Meshes. Springer, Berlin (2017)
Di Pietro, D.A., Ern, A.: Mathematical Aspects of Discontinuous Galerkin Methods. Springer, Berlin (2012)
Ern, A., Guermond, J.-L.: Theory and Practice of Finite Elements. Springer, Berlin (2004)
Grisvard, P.: Elliptic problem in nonsmooth domains, Pitman (1985), reprinted by SIAM (2011)
Ishizaka, H., Kobayashi, K., Suzuki, R., Tsuchiya, T.: A new geometric condition equivalent to the maximum angle condition for tetrahedrons (submitted). arXiv:2102.04767
Ishizaka, H., Kobayashi, K., Tsuchiya, T.: General theory of interpolation error estimates on anisotropic meshes. Jpn. J. Ind. Appl. Math. 38, 163–191 (2021)
Kobayashi, K., Tsuchiya, T.: A Babuška–Aziz type proof of the circumradius condition. Jpn. J. Ind. Appl. Math. 31, 193–210 (2014)
Kobayashi, K., Tsuchiya, T.: On the circumradius condition for piecewise linear triangular elements. Jpn. J. Indust. Appl. Math. 32, 65–76 (2015)
Kobayashi, K., Tsuchiya, T.: A priori error estimates for Lagrange interpolation on triangles. Appl. Math. 60, 485–499 (2015)
Kobayashi, K., Tsuchiya, T.: Error analysis of Lagrange interpolation on tetrahedrons. J. Approx. Theory 249, 105302 (2020)
Kobayashi, K., Tsuchiya, T.: Lectures on error analysis of interpolation on simplicial triangulations with the shape regularity assumption, part 2, Lagrange interpolation on tetrahedrons. arXiv:2103.08101
Nitsche, J.: Über ein Variationsprinzip zur Lösung von Dirichlet-Problemen bei Verwendung von Teilräumen, die keinen Randbedingungen unterworfen sind. Abh. Math. Sem. Univ. Hamburg 36, 9–15 (1971)
Rivière, B.: Discontinuous Galerkin Methods for Solving Elliptic and Parabolic Equations. SIAM, Philadelphia (2008)
Warburton, T., Hesthaven, J.S.: On the constants in \(hp\)-finite element trace inverse inequalities. Comput. Methods Appl. Mech. Eng. 192, 2765–2773 (2003)
Wheeler, M.F.: An elliptic collocation-finite element method with interior penalties. SIAM J. Numer. Anal. 15, 152–161 (1978)
Acknowledgements
The authors were supported by JSPS KAKENHI Grant Numbers 17K14230, 20K14357, 16H03950, and 20H01820. The authors would like to thank the anonymous referee for the valuable comments.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
This article is published under an open access license. Please check the 'Copyright Information' section either on this page or in the PDF for details of this license and what re-use is permitted. If your intended use exceeds what is permitted by the license or if you are unable to locate the licence and re-use information, please contact the Rights and Permissions team.
About this article
Cite this article
Kashiwabara, T., Tsuchiya, T. A robust discontinuous Galerkin scheme on anisotropic meshes. Japan J. Indust. Appl. Math. 38, 1001–1022 (2021). https://doi.org/10.1007/s13160-021-00474-y
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s13160-021-00474-y