MATHEMATICS OF COMPUTATION S 0025-5718(10)02360-4 Article electronically published on April 12, 2010
A NEW ERROR ANALYSIS FOR DISCONTINUOUS FINITE ELEMENT METHODS FOR LINEAR ELLIPTIC PROBLEMS THIRUPATHI GUDI
Abstract. The standard a priori error analysis of discontinuous Galerkin methods requires additional regularity on the solution of the elliptic boundary value problem in order to justify the Galerkin orthogonality and to handle the normal derivative on element interfaces that appear in the discrete energy norm. In this paper, a new error analysis of discontinuous Galerkin methods is developed using only the H k weak formulation of a boundary value problem of order 2k. This is accomplished by replacing the Galerkin orthogonality with estimates borrowed from a posteriori error analysis and by using a discrete energy norm that is well defined for functions in H k .
1. Introduction Let Ω ⊂ Rn , be a bounded polygonal domain and f ∈ L2 (Ω). For simplicity, we assume n = 2. However, our error analysis may be extended to any n ≥ 1. To give the motivation, consider a model problem of finding u ∈ H01 (Ω) such that (1.1) ∇u · ∇v dx = f v dx ∀ v ∈ H01 (Ω). Ω
Ω
Many discontinuous Galerkin (DG) methods [3] have been proposed for (1.1) based on a discrete space Vh ⊆ {v ∈ L2 (Ω) : v|T ∈ Pr (T ) ∀T ∈ Th }, where Th is a triangulation of the computational domain Ω. For these methods, a priori error estimates are derived based on Galerkin orthogonality and Cea’s Lemma assuming that the solution u of (1.1) has the following regularity: u|T ∈ H s (T ), ∀ T ∈ Th , s >
3 . 2
To be more precise, consider the variational form of the symmetric interior penalty method [22, 39, 2] : Find uh ∈ Vh such that ah (uh , vh ) = (1.2) f vh dx ∀ vh ∈ Vh , Ω
Received by the editor January 5, 2009 and, in revised form, June 16, 2009. 2010 Mathematics Subject Classification. Primary 65N30, 65N15. Key words and phrases. Optimal error estimates, elliptic regularity, finite element, discontinuous Galerkin, nonconforming. c 2010 American Mathematical Society Reverts to public domain 28 years from publication
1
2
THIRUPATHI GUDI
where ah (w, v) =
T ∈Th
{{∇w}}[[v]] + {{∇v}}[[w]] ds ∇w · ∇v dx −
T
e
e∈Eh
σ + [[w]][[v]] ds e he
w, v ∈ Vh ,
e∈Eh
the jumps and means are defined as in Section 3 and σ is a sufficiently large positive constant. By writing the solution u of (1.1) as the sum of a regular part and a singular part [27], the following integration by parts formula [15, Lemma 2.1] can be proved under the regularity result that the solution u ∈ H s (Ω) for s > 3/2 [27]: ∇u · ∇v dx = ∇u · vnds + f v dx ∀ T ∈ Th , ∀ v ∈ Vh . T
∂T
T
Hence the solution u of (1.1) satisfies ah (u, vh ) = f vh dx
∀ vh ∈ Vh ,
Ω
which implies the following Galerkin orthogonality: ah (u − uh , vh ) = 0 ∀ vh ∈ Vh .
(1.3)
Then the following a priori error estimate [35, 15, 13, 14, 34] is obtained from (1.3): u − uh 1,h ≤ C inf u − vh 1,h ,
(1.4)
vh ∈Vh
where for w ∈ H (Ω) + Vh , s > 3/2, σ w21,h = ∇w2L2 (T ) + he {{∇w}}2L2 (e) + [[w]]2L2 (e) he s
T ∈Th
e∈Eh
e∈Eh
and he is the length of e. Note that the regularity result u ∈ H s (Ω) for s > 3/2 is needed to handle the term {{∇(u − vh )}}L2 (e) in (1.4). We see from the discussion above that the derivation of (1.3) for discontinuous Galerkin methods requires the nontrivial elliptic regularity theory in polygonal domains. The goal of this paper is to provide a new type of error estimates that does not require such regularity results. This new approach is particularly useful for more complicated problems, such as linear interface, where u has low regularity [31]. We will derive the new error estimates by an analog of the Berger–Scott–Strang lemma [5] that decomposes the error into two parts in which one measures the interpolation error and the other measures the nonconforming error and the consistency error together. Thereby the analysis does not require any regularity other than that the weak solution of a PDE of order 2k belongs to H k (Ω). We obtain the following error estimate for (1.2): u − uh h ≤ C inf u − vh h + Osck (f ) , (1.5) vh ∈Vh
where w2h =
T ∈Th
∇w2L2 (T ) +
σ [[w]]2L2 (e) he
e∈Eh
w ∈ H 1 (Ω) + Vh
A NEW ERROR ANALYSIS FOR DG METHODS
3
and Osck (f ) which measures the oscillations of f is defined in (2.8). Note on the right-hand sides of (1.5) that the first term quantifies the interpolation error and the second term measures the oscillations of f which are of the same order with the first term (assuming that u has enough regularity) if f ∈ L2 (Ω) and higher order if f is sufficiently smooth. Our error analysis is motivated by the recent a posteriori error analysis for discontinuous Galerkin methods [16, 18, 30, 29] and the results of [8]. The key ingredients are the discrete local efficiency arguments [37, 38] for a posteriori error estimators and an enriching map for piecewise smooth functions [6, 7, 8, 9, 10]. The rest of the article is organized as follows. In Section 2, we present the main result in an abstract lemma which enables us to decompose the error. Section 3 and Section 4 are devoted to the applications of the abstract lemma to various nonconforming and discontinuous Galerkin methods for second and fourth order elliptic problems, respectively. Finally, in Section 5, we present conclusions and possible extensions. 2. Abstract result Recall the Sobolev-Hilbert space H k (Ω) which is the set of all L2 (Ω) functions whose distributional derivatives up to order k are in L2 (Ω). Denote by V := H0k (Ω), the set of all functions in H k (Ω) whose traces up to order k − 1 vanishes. Denote the norm on V by · V . The model problem is to find u ∈ V such that (2.1)
a(u, v) = (f, v)
∀ v ∈ V,
where a(·, ·) is the bilinear from for the underlying PDE of order 2k and (·, ·) denotes the L2 inner product. We assume that the bilinear form a is bounded and elliptic so that the model problem (2.1) has a unique solution u ∈ V . Denote by Th a regular (without hanging nodes) simplicial triangulation of Ω. Let hT =diam T and h = max{hT : T ∈ Th }. Let the discontinuous finite element space Vh be a subspace of Vhr = {vh ∈ L2 (Ω) : vh |T ∈ Pr (T ) ∀ T ∈ Th } where Pr (D) is the space of polynomials of degree less than or equal to r restricted to the set D. Let ·h be a mesh dependent norm on V +Vh and Vc a finite element subspace of V associated with Th . The discontinuous finite element method is to find uh ∈ Vh such that ∀ v ∈ Vh , where the bilinear form ah (·, ·) is defined on Vh × Vc + Vh . (2.2)
ah (uh , v) = (f, v)
We make the following abstract assumptions: (N1) There is a positive constant C independent of h such that (2.3)
Cv2h ≤ ah (v, v)
∀ v ∈ Vh .
(N2) There is a positive constant C independent of h such that for all w ∈ Vc , (2.4)
|a(v, w) − ah (vh , w)| ≤ Cv − vh h wV
∀ v ∈ V and ∀ vh ∈ Vh .
(N3) There exists a linear map Eh : Vh → Vc satisfying (2.5)
Eh vV ≤ Cvh
∀ v ∈ Vh ,
for some positive constant C independent of h.
4
THIRUPATHI GUDI
It can be readily seen from (2.3) that there is a unique solution uh ∈ Vh for (2.2). We are now ready to prove an abstract lemma. Lemma 2.1. Let u ∈ V := H0k (Ω) and uh ∈ Vh be the solutions of (2.1) and (2.2), respectively. Assume that the assumptions (N1)–(N3) hold. Then there exists a positive constant C independent of h such that (f, φ − Eh φ) − ah (v, φ − Eh φ) (2.6) u − uh h ≤ C inf u − vh + sup . v∈Vh φh φ∈Vh \{0} In addition, if there exists a positive constant C independent of h such that for any v ∈ Vh , (f, φ − Eh φ) − ah (v, φ − Eh φ) (2.7) sup ≤ C u − vh + Osck (f ) , φh φ∈Vh \{0} where
Osck (f ) =
(2.8)
T ∈Th
then u − uh h ≤ C˜
(2.9)
1/2
h2k T
inf
f¯∈Pr−k (T )
f − f¯2L2 (T )
,
inf u − vh + Osck (f ) .
v∈Vh
Here C˜ is a positive constant independent of h. Proof. Let v ∈ Vh be such that v = uh . Let ψ = uh − v. From (2.3), (2.2) and (2.1), we get Cuh − v2h ≤ ah (uh − v, ψ) = (f, ψ) − ah (v, ψ) = a(u, Eh ψ) − ah (v, Eh ψ) + (f, ψ − Eh ψ) − ah (v, ψ − Eh ψ). We obtain
uh − vh ≤ C
a(u, Eh ψ) − ah (v, Eh ψ) (f, ψ − Eh ψ) − ah (v, ψ − Eh ψ) + uh − vh uh − vh
.
Using (2.4) and (2.5), we find |a(u, Eh ψ) − ah (v, Eh ψ)| ≤ Cu − vh Eh ψV ≤ Cu − vh ψh = Cu − vh uh − vh , which implies that |a(u, Eh ψ) − ah (v, Eh ψ)| ≤ Cu − vh . uh − vh It is obvious that (f, ψ − Eh ψ) − ah (v, ψ − Eh ψ) (f, φ − Eh φ) − ah (v, φ − Eh φ) ≤ sup . ψh φh φ∈Vh \{0} Now a use of the triangle inequality yields the estimate (2.6). Finally, we use (2.7) in (2.6) to complete the proof. We have immediately the following corollary.
A NEW ERROR ANALYSIS FOR DG METHODS
5
Corollary 2.2. Assume that the hypothesis for Lemma 2.1 is true. Furthermore, assume that the oscillation Osck (f ) is zero. Then, the error estimate (2.9) is quasioptimal in the sense that there is a positive constant C independent of h such that u − uh h ≤ C inf u − vh . v∈Vh
3. Second order problems (k = 1) Here we have V = H01 (Ω) and vV = ∇vL2 (Ω) . For given f ∈ L2 (Ω), the model problem is to find u ∈ V such that a(u, v) = (f, v) ∀ v ∈ V,
(3.1) where
(3.2)
∇u · ∇v dx.
a(u, v) = Ω
We now introduce some notation. Denote the set of all interior edges of Th by Ehi , the set of boundary edges by Ehb , and define Eh = Ehi ∪ Ehb . The length of any edge e ∈ Eh will be denoted by he . Define a broken Sobolev space H 1 (Ω, Th ) = {v ∈ L2 (Ω) : vT = v|T ∈ H 1 (T ) ∀ T ∈ Th }. For any e ∈ Ehi , there are two triangles T+ and T− such that e = ∂T+ ∩ ∂T− . Let n− be the unit normal of e pointing from T− to T+ , and n+ = −n− . (cf. Fig. 3.1). For any v ∈ H 1 (Ω, Th ), we define the jump and mean of v on e by 1 [[v]] = v− n− + v+ n+ and {{v}} = (v− + v+ ), respectively, 2 where v± = v T± . Similarly, define for w ∈ H 1 (Ω, Th )2 the jump and mean of w on e ∈ Ehi by
[[w]] = w− · n− + w+ · n+ , and {{w}} =
1 (w− + w+ ), respectively, 2
where w± = w|T± .
P−
@ @ @ T− @ @ @ @ @ A
e
B @ @ @ τe @ . @ T+ @ @ R ne @ @ @ P+
Figure 3.1. Two neighboring triangles T− and T+ that share the edge e = ∂T− ∩ ∂T+ with initial node A and end node B and unit normal ne . The orientation of ne = n− = −n+ equals the outer normal of T− , and hence, points into T+ .
6
THIRUPATHI GUDI
For any edge e ∈ Ehb , there is a triangle T ∈ Th such that e = ∂T ∩ ∂Ω. Let ne be the unit normal of e that points outside T . For any v ∈ H 1 (T ), we set on e ∈ Ehb , [[v]] = vne and {{v}} = v, and for w ∈ H 1 (T )2 , [[w]] = w · ne , and {{w}} = w. We recall the following trace inequality on Vh [11, 19]. Lemma 3.1. There exists a positive C independent of h such that for vh ∈ Vhr , vh L2 (e) ≤ Ch−1/2 vh L2 (T ) ∀ T ∈ Th , e
(3.3)
where e is an edge of T . Throughout this section, Δ denotes the Laplacian. The proof of the following lemma is similar to well-known discrete local efficiency estimates [1, 38, 37, 30] in a posteriori error analysis of second order problems when v = uh is the finite element solution. We state the result here and omit the proof. Lemma 3.2. Let v ∈ Vh . Then there is a positive constant C independent of h such that (3.4) h2T f + Δv2L2 (T ) ≤ C ∇(u − v)2L2 (T ) + Osc1 (f )2 T ∈Th
and (3.5)
T ∈Th
he [[∇v]]2L2 (e) ≤ C
∇(u − v)2L2 (T ) + Osc1 (f )2 ,
T ∈Th
i e∈Eh
where Osc1 (f ) is defined in (2.8). Let Vc = Vh ∩ V be the conforming finite element space. The construction of an enriching map Eh : Vh → Vc can be done by averaging [6, 7, 8]. Let p be any interior node of the Lagrange Pr finite element space associated with the triangulation Th and let Tp be the set of all triangles sharing the node p. For v ∈ Vh , define Eh v ∈ Vc by 1 (3.6) Eh v(p) = v|T (p) |Tp | T ∈Tp
where |Tp | is the cardinality of Tp . For all boundary nodes p, set Eh v(p) = 0. For the rest of the section, we use this Eh . We now present the applications of Lemma 2.1 to a wide range of discontinuous finite element methods. 3.1. Classical nonconforming method. The discrete space is the CrouzeixRaviart [21] nonconforming P1 finite element space defined by (3.7) Vh = {vh ∈ L2 (Ω) : vh |T ∈ P1 (T ) ∀ T ∈ Th , [[v]] ds = 0 ∀ e ∈ Eh }. e
Define the norm · h by (3.8)
v2h =
T ∈Th
|∇v|2 dx. T
A NEW ERROR ANALYSIS FOR DG METHODS
7
The nonconforming approximate solution uh ∈ Vh is obtained by solving ah (uh , v) = (f, v) ∀ v ∈ Vh ,
(3.9) where (3.10)
ah (w, v) =
T ∈Th
∇w · ∇v dx
∀ w, v ∈ Vh .
T
It is easy to check the assumptions (N1) and (N2). The enriching map Eh in (3.6) satisfies [6, 7, 8, 30] 2 2 2 (3.11) h−2 T Eh v − vL2 (T ) + Eh vV ≤ Cvh ∀ v ∈ Vh . T ∈Th
Therefore, the estimate (2.6) is valid for the nonconforming method (3.9). We now verify the estimate (2.7). For this, let v, φ ∈ Vh and denote ψ = φ−Eh φ. Using (3.3), (3.4), (3.5) and (3.11), ∇v · ∇ψ dx = (f, ψ) − [[∇v]]{{ψ}} ds (f, ψ) − ah (v, ψ) = (f, ψ) − ≤C
T ∈Th
T
i e∈Eh
e
f L2 (T ) φ − Eh φL2 (T )
T ∈Th
+C ⎛ ≤C⎝
[[∇v]]L2 (e) {{φ − Eh φ}}L2 (e)
i e∈Eh
h2T f 2L2 (T ) +
T ∈Th
⎞1/2 he [[∇v]]2L2 (e) ⎠
φh
i e∈Eh
≤ C u − vh + Osc1 (f ))φh . Therefore, (f, φ − Eh φ) − ah (v, φ − Eh φ) ≤ C u − vh + Osc1 (f )). φh φ∈Vh \{0} sup
Hence, the estimate (2.9) holds for the nonconforming finite element method. 3.2. Discontinuous Galerkin (DG) methods. In this section, we present the application of Lemma 2.1 to discontinuous Galerkin methods [3] for second order elliptic problems. The DG finite element space is defined by Vh = {vh ∈ L2 (Ω) : vh |T ∈ Pr (T ) ∀ T ∈ Th } for any r ≥ 1. Define the norm · h on Vh by σ 2 |∇v|2 dx + [[v]]2L2 (e) , vh = he T T ∈Th
e∈Eh
where σ > 0 is the stabilizing parameter. The enriching map Eh in (3.6) satisfies [6, 7, 8, 30] 2 2 2 (3.12) h−2 T Eh v − vL2 (T ) + Eh vV ≤ Cvh ∀ v ∈ Vh . T ∈Th
This validates the assumption (N3).
8
THIRUPATHI GUDI
In order to define DG methods, we introduce the following. Let Wh = Vh × Vh . Given e ∈ Eh , define the local lifting operators re : L2 (e)2 → Wh and e : L2 (e) → Wh by re (q) · τh dx = q · {{τh }} ds for all τh ∈ Wh , e Ω e (v) · τh dx = v [[τh ]] ds for all τh ∈ Wh . Ω
e
The global lifting operators r : L2 (Eh )2 → Wh and : L2 (Ehi ) → Wh , re and := e r := i e∈Eh
e∈Eh
satisfy
r(q) · τh dx
=
Ω
e∈Eh
(v) · τh dx
=
Ω
i e∈Eh
q · {{τh }} ds
for all τh ∈ Wh ,
e
v · [[rh ]] ds
for all τh ∈ Wh .
e
The variational form of the DG methods [17] is to find uh ∈ Vh such that ah (uh , v) = (f, v) ∀ v ∈ Vh ,
(3.13)
where for w, v ∈ Vh , {{∇w}}[[v]] + θ{{∇v}}[[w]] ds ∇w · ∇v dx − ah (w, v) = T ∈Th
T
e∈E
e
h + β · [[w]][[∇v]] + [[∇w]]β · [[v]] ds i e∈Eh
e
α r [[w]] + β · [[w]] · r [[v]] + β · [[v]] ds Ω σ + [[w]][[v]] ds e he +
e∈Eh
for θ = ±, α ∈ {0, 1}, β ∈ R2 and σ > 0. Here θ = 1, β = (0, 0) and α = 0 give the symmetric interior penalty method (SIPG) [22, 39, 2], θ = −1, β = (0, 0) and α = 0 give the nonsymmetric interior penalty method (NIPG) [36], and θ = 1, β ∈ R2 and α = 1 give the local discontinuous Galerkin method (LDG) [20, 17]. Under the assumption σ ≥ σ∗ > 0 (σ∗ is sufficiently large for SIPG and σ∗ > 0 for NIPG and LDG), it is known [3] that there is a positive constant C such that Cv2h ≤ ah (v, v) for all v ∈ Vh . This verifies the assumption (N1). For v ∈ V , w ∈ Vc and vh ∈ Vh , note that ∇(v − vh ) · ∇w dx − {{∇w}}[[v − vh ]]ds a(v, w) − ah (vh , w) = T ∈Th
+
T
i e∈Eh
e
e∈Eh
β · [[∇w]][[v − vh ]] ds
e
A NEW ERROR ANALYSIS FOR DG METHODS
9
where we have used the fact that for all e ∈ Eh , [[v]] = 0. A use of the trace inequality (3.3) implies that ∇(v − vh )L2 (T ) ∇wL2 (T ) |a(v, w) − ah (vh , w)| ≤ T ∈Th
+
{{∇w}}L2 (e) [[v − vh ]]L2 (e)
e∈Eh
+
β · [[∇w]]L2 (e) [[v − vh ]]L2 (e)
i e∈Eh
≤
∇(v − vh )L2 (T ) ∇wL2 (T )
T ∈Th
+ Cσ∗ ,β
1/2
∇w2L2 (T )
T ∈Th
σ [[v−vh ]]2L2 (e) he
1/2 .
e∈Eh
Hence, the assumption (N2) holds. We now verify the estimate (2.7). Let v, φ ∈ Vh and denote ψ = φ − Eh φ. Then f + Δv)ψ dx − [[∇v]]{{ψ}} ds (f, ψ) − ah (v, ψ) = T
T ∈Th
+θ
e∈Eh
h
i e∈Eh
−
e
σ {{∇ψ}}[[v]]ds − [[v]][[ψ]] ds e e he
e∈E
−
i e∈Eh
α β · [[v]][[∇ψ]] + [[∇v]]β · [[ψ]] ds e
r [[v]] + β · [[v]] · r [[ψ]] + β · [[ψ]] ds.
Ω
Using the bounds for r and in [3] that 1 r([[v]])2L2 (Ω) ≤ C [[v]]2L2 (e) he e∈Eh 1 [[v]]2L2 (e) (β · [[v]])2L2 (Ω) ≤ C h e I
∀ v ∈ Vh , ∀ v ∈ Vh ,
e∈Eh
the trace inequality (3.3), (3.12) and Lemma 3.2, we obtain (f, φ − Eh φ) − ah (v, φ − Eh φ) ≤ C u − vh + Osc1 (f )) φh φ∈Vh \{0} sup
and hence we conclude the error estimate in (2.9) for the DG methods in (3.13). 3.3. Weakly over-penalized symmetric interior penalty (WOPSIP) method. Here we highlight that the above analysis is also applicable to overpenalized interior penalty methods. We consider the weakly over-penalized symmetric interior penalty method in [15]. For any v ∈ H 1 (Ω, Th ), define on e ∈ Eh , 1 [[v]]ds. πe ([[v]]) = he e
10
THIRUPATHI GUDI
Note that πe ([[u]]) = 0 for all e ∈ Eh . Define Vh = {vh ∈ L2 (Ω) : vh |T ∈ P1 (T ) ∀ T ∈ Th }, and the norm · h on Vh by 1 2 2 vh = |∇v|2 dx + πe [[v]] . h2e T T ∈Th
e∈Eh
The WOPSIP method is to find uh ∈ Vh such that ah (uh , v) = (f, v) ∀ v ∈ Vh , where for w, v ∈ Vh ,
ah (w, v) =
T ∈Th
∇w · ∇v dx + T
1 πe ([[w]])πe ([[v]]). h2e
e∈Eh
Let Eh : Vh → Vc be defined as in (3.6), where Vc is the conforming P1 finite element space. Then it can be seen [6, 7, 8] that 2 2 2 h−2 T Eh v − vL2 (T ) + Eh vV ≤ Cvh ∀ v ∈ Vh . T ∈Th
Note that ah (v, v) = v2h ∀ v ∈ Vh and for v ∈ V , w ∈ Vc and vh ∈ Vh , ∇(v − vh ) · ∇w dx ≤ Cv − vh h wV . |a(v, w) − ah (vh , w)| = T ∈Th
T
We now verify a variant of (2.7). Let v, φ ∈ Vh and ψ = φ − Eh φ. Then using (3.4) and (3.5), we get 1 ∇v · ∇ψ dx − πe ([[v]])πe ([[ψ]]) (f, ψ) − ah (v, ψ) = (f, ψ) − h2 T ∈Th T e∈Eh e = f ψ dx − [[∇v]]{{ψ}} ds T ∈Th
−
T
i e∈Eh
e
e∈EI
e
{{∇v}}πe ([[ψ]]) ds +
1 πe ([[u − v]])πe ([[ψ]]) h2e
e∈Eh
≤ C u − vh +Osc1 (f ) φh +C
1/2 h2T ∇u2L2 (T )
φh .
T ∈Th
Therefore, (f, φ − Eh φ) − ah (v, φ − Eh φ) ≤ C u − vh + Osc1 (f ) φ h φ∈Vh \{0}
1/2 2 2 +C hT ∇uL2 (T ) . sup
T ∈Th
A NEW ERROR ANALYSIS FOR DG METHODS
Hence,
⎡
u − uh h ≤ C ⎣ inf u − vh + Osc1 (f ) + v∈Vh
11
1/2 ⎤ ⎦. h2T ∇u2L2 (T )
T ∈Th
The error estimate in (3.3) is slightly different compared to the other DG methods. However, the estimate is still optimal up to the regularity of u. Remark 3.3. We note that analogous error estimates hold for other DG formulations in [3, Table 3.2] and in [13]. 4. Fourth order problems (k = 2) The model problem is to find u ∈ H02 (Ω) such that (4.1)
∀ v ∈ H02 (Ω),
a(u, v) = (f, v)
where
D2 w : D2 v dx
a(w, v) = D2 w : D2 v =
∀ w, v ∈ H02 (Ω),
Ω 2
∂2w ∂2v . ∂xi ∂xj ∂xi ∂xj i,j=1
Therefore, for this section V = H02 (Ω) and the norm · V = | · |H 2 (Ω) . We define the Sobolev space H s (Ω, Th ) associated with the triangulation Th as follows: H s (Ω, Th ) = {v ∈ L2 (Ω) : vT = v|T ∈ H s (T ) ∀ T ∈ Th }. For this section, we slightly alter the definition of the jumps and means. For any e ∈ Ehi , there are two triangles T+ and T− such that e = ∂T+ ∩ ∂T− . Let ne be the unit normal of e pointing from T− to T+ (cf. Fig. 3.1). For any v ∈ H 2 (Ω, Th ), we define the jump and mean of the normal derivative of v on e by ∂v ∂v ∂v− ∂v− ∂v+ 1 ∂v+ − and + , = = ∂n ∂ne e ∂ne e ∂n 2 ∂ne e ∂ne e where v± = v T . ± Similarly, for any v ∈ H 3 (Ω, Th ), we define the jump and mean of the second order normal derivative across e by 2 2 ∂ v ∂ v ∂ 2 v− ∂ 2 v− ∂ 2 v+ 1 ∂ 2 v+ − and + = = . ∂n2 ∂n2 ∂n2 ∂n2 2 ∂n2 ∂n2 e
e
e
e
e
e
e
e
Ehb ,
For any edge e ∈ there is a triangle T ∈ Th such that e = ∂T ∩ ∂Ω. Let ne be the unit normal of e that points outside T . For any v ∈ H 2 (T ), we set ∂v ∂v =− T, ∂n ∂ne and for any v ∈ H 3 (T ), we set
∂2v ∂n2
=
∂ 2 vT . ∂n2e
Let Vc ⊂ H02 (Ω) be the Hsieh-Clough-Tocher finite element space associated with Th [19, 11]. As in the previous section, the linear map Eh : Vh −→ Vc is constructed
12
THIRUPATHI GUDI
by averaging [12, 16]. Let N be any (global) degree of freedom of Vc , i.e., N is either the evaluation of a shape function or its first order derivatives at an interior node of Th , or the evaluation of the normal derivative of a shape function at a node on an interior edge. For vh ∈ Vh , we define 1 (4.2) N (Eh vh ) = N (vT ), |TN | T ∈TN
where TN is the set of triangles in Th that share the degree of freedom, N and |TN | is the number of elements of TN . We now derive the following discrete local efficiency estimates. Lemma 4.1. Let v ∈ Vh . Then there is a positive constant C independent of h such that (4.3) h4T f − Δ2 v2L2 (T ) ≤ C D2 (u − v)2L2 (T ) + Osc2 (f )2 , T ∈Th
(4.4)
T ∈Th
he [[∂ v/∂n 2
2
]]2L2 (e)
≤C
D2 (u − v)2L2 (T ) + Osc2 (f )2 ,
T ∈Th
i e∈Eh
where Osc2 (f ) is defined in (2.8). Proof. The proof is again based on bubble function techniques [16, 38]. Let v ∈ Vh and f¯ ∈ Pr−2 (T ) for an arbitrary T ∈ Th . Let bT ∈ P6 (T ) ∩ H02 (T ) be the bubble function defined on T such that bT (xT ) = 1, where xT is the barycenter of T . Let φ = bT (f¯ − Δ2 v) on T and extend it to be zero on Ω\T . We have for some mesh independent constants C1 and C2 that C1 f¯ − Δ2 vL (T ) ≤ φL (T ) ≤ C2 f¯ − Δ2 vL (T ) . 2
2
2
It follows from (4.1) and integration by parts that f φ dx − Δ2 v φ dx (f − Δ2 v, φ) = Ω T 2 2 D u : D φ dx − D2 v : D2 φ dx = D2 (u − v) : D2 φ dx. = Ω
T
T
Using a standard inverse estimate [11, 19], we find 2 2 2 ¯ ¯ ¯ C1 f − Δ vL2 (T ) ≤ (f − Δ v)φ dx = (f − f )φ dx + (f − Δ2 v)φ dx T T T 2 2 = (f¯ − f )φ dx + D (u − v) : D φ dx T
T
≤ f − f¯L2 (T ) φL2 (T ) + |u − v|H 2 (T ) |φ|H 2 (T ) ≤ f − f¯L2 (T ) + Ch−2 T |u − v|H 2 (T ) φL2 (T ) 2 ¯ 2 ≤ C f − f¯L2 (T ) + h−2 |u − v| H (T ) f − Δ vL2 (T ) , T which implies
h2T f¯ − Δ2 vL2 (T ) ≤ C |u − v|H 2 (T ) + h2T f − f¯L2 (T ) .
Using the triangle inequality, we obtain h2T f − Δ2 vL2 (T ) ≤ C |u − v|H 2 (T ) + h2T f − f¯L2 (T ) which implies (4.3).
A NEW ERROR ANALYSIS FOR DG METHODS
13
We now prove the second estimate (4.4). Let e ∈ Ehi and T± be two triangles sharing the edge e. Let Te be the set of the two triangles T± and let ne denote the unit normal of e pointing from T− to T+ . (cf. Fig. 3.1). Let β be the jump [[∂ 2 v/∂n2 ]] across e and extend it outside e so that it is constant along the lines perpendicular to e. Let ζ1 ∈ Pr−1 (T+ ∪ T− ) be defined by (4.5)
ζ1 = 0 on the edge e and
∂ζ1 = β. ∂ne
A simple scaling argument shows that 2 2 1/2 ∂ v |ζ1 |H 1 (T± ) ≈ (4.6) he ds , ∂n2 e 2 2 1/2 ∂ v ζ1 L∞ (T± ) ≈ (4.7) he ds . 2 ∂n e Next we define ζ2 ∈ P8 (T+ ∪ T− ) by the following properties: (i) ζ2 vanishes to the first order on (∂T+ ∪ ∂T− ) \ e (i.e., the union of the closed line segments AP + , AP − , BP + and BP − in Fig. 3.1). (ii) ζ2 is positive on the (open) edge e. ζ2 dx = |T+ | + |T− |. (iii) T+ ∪T−
By scaling we have
ζ2 ds ≈ |e|,
(4.8) e
|ζ2 |H 1 (T± ) ≈ 1 ≈ ζ2 L∞ (T± ) .
(4.9)
It follows from (4.1), property (i) in the definition of ζ2 , (4.5), (4.8), and integration by parts that (4.10) 2 2 2 2 ∂ v ∂ v ∂ζ1 ∂ v ∂(ζ1 ζ2 ) 2 C ds ≤ β ζ2 ds = ζ2 ds = ds 2 2 2 ∂ne ∂ne e ∂n e e ∂n e ∂n ∇ · D2 v · ∇(ζ1 ζ2 ) dx D2 v : D2 (ζ1 ζ2 ) dx + =− T
T ∈Te
=−
T ∈Te
T ∈Te
T
D (u − v) : D (ζ1 ζ2 ) dx − 2
2
T ∈Te
D2 u : D2 (ζ1 ζ2 ) dx
T
Δ2 v (ζ1 ζ2 ) dx T
D (u − v) : D (ζ1 ζ2 ) dx − 2
T ∈Te
Δ2 v (ζ1 ζ2 ) dx
T
+ =
D2 v : D2 (ζ1 ζ2 ) dx −
T
T ∈Te
=
T
2
T
T ∈Te
(f − Δ2 v)(ζ1 ζ2 ) dx.
T
In view of the Poincar´e inequality ζ1 ζ2 L2 (T± ) ≤ Ch2T |ζ1 ζ2 |H 2 (T± )
14
THIRUPATHI GUDI
and the inverse inequality −1 |ζ1 ζ2 |H 2 (T± ) ≤ Ch−1 T |ζ1 ζ2 |H 1 (T± ) ≤ Che |ζ1 ζ2 |H 1 (T± ) ,
we deduce from (4.10), (4.11) e
∂2v ∂n2
2 ds ≤ C
|u − v|H 2 (T ) + h2T f − Δ2 vL2 (T ) |ζ1 ζ2 |H 2 (T ) T ∈Te
≤C
|u − v|H 2 (T ) + h2T f − Δ2 vL2 (T ) h−1 e |ζ1 ζ2 |H 1 (T± ) .
T ∈Te
From (4.6), (4.7) and (4.9) we have |ζ1 ζ|H 1 (T± ) ≤ |ζ1 |L∞ (T± ) |ζ2 |H 1 (T± ) + |ζ1 |H 1 (T± ) |ζ2 |L∞ (T± )
2 2 1/2 ∂ v ≤C he ds , ∂n2 e which together with (4.11) implies
2 2 1/2 ∂ v |u − v|H 2 (T ) + h2T f − Δ2 vL2 (T ) . he ds ≤ C (4.12) 2 ∂n e T ∈Te
The estimate (4.4) now follows from (4.3) and (4.12).
We will now present the applications of Lemma 2.1 to a few discontinuous finite element methods for fourth order problems. 4.1. Morley nonconforming method. The discrete space [32] is Vh = {v ∈ L2 (Ω) : v|T ∈ P2 (T ) ∀ T ∈ Th , v is continuous at all the vertices of Th , ∂v/∂n is continuous at the midpoints of the edges of Th , v = 0 at all the vertices on ∂Ω, ∂v/∂n = 0 at all the midpoints of the edges on ∂Ω} . The nonconforming method is to find uh ∈ Vh such that ah (uh , v) = (f, v) ∀ v ∈ Vh , where for w, v ∈ Vh ,
ah (w, v) =
T ∈Th
D2 w : D2 v dx.
T
Note that ah is also well defined on Vc . Define the norm vh by v2h = ah (v, v). To verify (N2), let v ∈ V , w ∈ Vc and vh ∈ Vh . We then note that |D2 (v − vh )| |D2 w| dx ≤ v − vh h wV . |a(v, w) − ah (vh , w)| ≤ T ∈Th
T
A NEW ERROR ANALYSIS FOR DG METHODS
15
The map Eh defined in (4.2) satisfies the estimate [12, 16] −2 2 2 h−4 v − E v + h |v − E v| 1 h h H (T ) L2 (T ) T T T ∈Th (4.13) + Eh v2V ≤ Cv2h ∀ vh ∈ Vh . Let v, φ ∈ Vh and ψ = φ − Eh φ. For any v ∈ Vh and for all vertices p in Th , we have Eh v(p) = v(p).
(4.14) We find that ah (v, φ − Eh φ) =
D2 v : D2 (φ − Eh φ) dx
T
T ∈Th
∂ 2 v ∂(φ − E φ) ∂ 2 v ∂(φ − Eh φ) h + ds 2 ∂n ∂n ∂τ ∂n ∂τ T ∈Th ∂T ∂ 2 v ∂(φ − Eh φ) =− ds. 2 ∂n e ∂n i
=
e∈Eh
Here we have used the following consequence of (4.14): ∂ 2 v ∂(φ − Eh φ) ∂ 2 v ∂(φ − Eh φ) (4.15) ds = ds = 0, ∂τ ∂τ ∂n e ∂τ ∂T ∂τ ∂n T ∈Th
T ∈Th e∈∂T
where ∂/∂τ denotes the tangential derivative along ∂T . Using (4.3) and (4.4), we find that ∂ 2 v ∂ψ (f, ψ) − ah (v, ψ) = (f, ψ) + ds 2 ∂n e ∂n i ⎛ ≤C⎝
e∈Eh
h4T f 2L2 (T ) +
T ∈Th
⎞1/2 he [[∂ 2 v/∂n2 ]]2L2 (e) ⎠
i e∈Eh
≤ C (u − vh + Osc2 (f )) φh . Therefore, (f, φ − Eh φ) − ah (v, φ − Eh φ) ≤ C (u − vh + Osc2 (f )) . φh φ∈Vh \{0} sup
Hence, the estimate (2.9) holds true. 4.2. C 0 interior penalty method. Define the space Vh as Vh = {v ∈ H01 (Ω) : v|T ∈ P2 (T ) ∀ T ∈ Th } and the norm · h on Vh by σ v2h = D2 v : D2 v dx + [[∂v/∂n]]2 ds ∀v ∈ Vh , T e he T ∈Th
where σ > 0 is the stabilizing parameter.
e∈Eh
φh
16
THIRUPATHI GUDI
The C 0 interior penalty method [12, 23] for (4.1) is to find uh ∈ Vh such that ah (uh , v) = (f, v)
∀v ∈ Vh ,
where for wh , vh ∈ Vh , (4.16) ah (wh , vh ) =
2 ∂ wh ∂vh ds ∂n2 ∂n T ∈Th T e∈Eh e 2 σ ∂wh ∂vh ∂ vh ∂wh ds + ds. + ∂n2 ∂n he e ∂n ∂n e
D2 wh : D2 vh dx +
e∈Eh
e∈Eh
Note that ah is well defined on Vc . The method is stable when σ is sufficiently large. More precisely, (4.17)
ah (v, v) ≥ Cv2h
∀ v ∈ Vh
for σ ≥ σ∗ > 0 and σ∗ sufficiently large. The map Eh defined in (4.2) satisfies the estimate [12, 16] −2 2 2 h−4 T v − Eh vL2 (T ) + hT |v − Eh v|H 1 (T ) T ∈Th (4.18) + Eh v2V ≤ Cv2h ∀ vh ∈ Vh . Let v ∈ V , w ∈ Vc and vh ∈ Vh . Then ∂ 2 w ∂vh D2 (v − vh ) : D2 w dx + a(v, w) − ah (vh , w) = ds ∂n2 ∂n T e T ∈Th
e∈Eh
≤ Cσ∗ v − vh h wV . Again, using the fact that for any v ∈ Vh , Eh v(p) = v(p) for all v ∈ Vh and vertices p in Th , we find the following analog of (4.15) for v, φ ∈ Vh and ψ = φ−Eh φ: ∂ 2 v ∂ψ ∂ 2 v ∂ψ 2 2 + D v : D ψ dx = (4.19) ds ∂n2 ∂n ∂τ ∂n ∂τ T ∈Th T T ∈Th ∂T 2 ∂ 2 v ∂ψ ∂ψ ∂ v ds. =− ds − 2 ∂n ∂n ∂n ∂n2 e e i e∈Eh
e∈Eh
Then using (4.18) and Lemma 4.1, we find ∂ 2 v ∂ψ (f, ψ) − ah (v, ψ) = (f, ψ) + ds 2 ∂n e ∂n i e∈Eh 2 σ ∂v ∂ψ ∂ ψ ∂v ds − ds − ∂n2 ∂n he e ∂n ∂n e∈Eh e e∈Eh ≤ Cσ∗ u − vh + Osc2 (f ) φh . Hence, the assumption (2.7) is valid and the estimate (2.9) holds.
A NEW ERROR ANALYSIS FOR DG METHODS
17
4.3. Discontinuous Galerkin methods. The model problem (4.1) is rewritten in the following form. Find u ∈ H02 (Ω) such that a(u, v) = (f, v) ∀ v ∈ H02 (Ω), where ΔwΔv dx ∀ w, v ∈ H02 (Ω),
a(w, v) = Ω
and Δ denotes the Laplacian. Set V = H02 (Ω) and vV = |Δv|L2 (Ω) for all v ∈ V . For this last section, we switch back to the definitions of jump and mean in Section 3. We now prove the following lemma. Lemma 4.2. Let v ∈ Vh . Then there is a positive constant C independent of h such that (4.20)
h4T f − Δ2 v2L2 (T ) ≤ C
T ∈Th
(4.21)
Δ(u − v)2L2 (T ) + Osc2 (f )2 ,
T ∈Th
he [[Δv]]2L2 (e)
≤C
Δ(u − v)2L2 (T ) + Osc2 (f )2 ,
T ∈Th
i e∈Eh
and (4.22)
h3e [[∇Δv]]2L2 (e) ≤ C
Δ(u − v)2L2 (T ) + Osc2 (f )2 ,
T ∈Th
i e∈Eh
where Osc2 (f ) is defined in (2.8). Proof. The proofs of (4.20) and (4.21) are similar to the proofs of (4.3) and (4.4), respectively, and hence we omit the proofs. We will prove (4.22) using the bubble function techniques [38, 16, 26]. Let e ∈ Ehi and T± be the triangles sharing this edge e. Denote by Te the patch of the two triangles T± (cf. Fig. 3.1). Consider [[∇Δv]] on e and extend it to T± by constants along the lines orthogonal to e. Denote the resulting function ζ1 ∈ Pr−3 (Te ). It is then obvious that ζ1 = [[∇Δv]] on e. Construct a piecewise polynomial bubble function ζ2 ∈ H02 (Te ) such that ζ2 (xe ) = 1, where xe is the midpoint of e. Denote φ = ζ1 ζ2 and extend it to be zero on Ω\Te . We have by scaling [37], (4.23)
CφL2 (Te ) ≤
1/2 2
he [[∇Δv]] ds e
,
18
THIRUPATHI GUDI
for some mesh independent constant C. Then, using (4.1), Poincar´e’s inequality and a standard inverse inequality, we have
2 2 ∇Δv · ∇φ + Δ v φ dx [[∇Δv]] ds ≤ C [[∇Δv]]ζ1 ζ2 ds = C e
e
=C
T ∈Te
Δ(u − v) Δφ dx −
T ∈Te
T
T ∈Te
∂T
T ∈Te
T ∈Te
+C
T
=C
T
T ∈Te
2 −Δv Δφ + Δ v φ dx + C
[[Δv]]{{∇φ}} ds
∂T
(f − Δ v)φ dx 2
T
[[Δv]]{{∇φ}} ds
1/2 4 2 2 2 hT f − Δ vL2 (T ) + |Δ(u − v)|L2 (T ) h−2 e φL2 (Te )
≤C
T ∈Te
+C
T ∈Te
1/2 h−2 e φL2 (Te )
2
he [[Δv]] ds
∂T
and then we use (4.20) and (4.21) to complete the proof of (4.22). 4.3.1. Symmetric interior penalty galerkin (SIP G) method. Let Vh = {v ∈ L2 (Ω) : v|T ∈ Pr (T ) ∀ T ∈ Th } and define the norm · h on Vh by 1 1 v2h = |Δv|2 dx + [[∇v]]2 ds + [[v]]2 ds 3 h h e T e e e T ∈Th
e∈Eh
∀v ∈ Vh .
e∈Eh
The symmetric interior penalty method [4, 24, 33] is to find uh ∈ Vh such that ∀v ∈ Vh ,
ah (uh , v) = (f, v)
where for w, v ∈ Vh , ah (w, v) = ΔwΔv dx + {{∇Δw}}[[v]]ds − {{Δw}}[[∇v]]ds T ∈Th
+
e∈Eh
e∈Eh
+
T
{{∇Δv}}[[w]]ds − e
e
e∈Eh
e∈Eh
{{Δv}}[[∇w]]ds
e
σ1 σ2 [[∇w]][[∇v]]ds + [[w]][[v]]ds he e h3e e
e∈Eh
e∈Eh
and σ1 > 0, σ2 > 0 are penalty parameters. For sufficiently large σ1 and σ2 , it holds that ah (v, v) ≥ Cv2h
∀v ∈ Vh ,
e
A NEW ERROR ANALYSIS FOR DG METHODS
19
where C is a mesh independent constant. Note for v ∈ V , w ∈ Vc and vh ∈ Vh that a(v, w) − ah (vh , w) = Δ(v − vh )Δw dx + {{∇Δw}}[[v − vh ]]ds T ∈Th
−
T
e
e∈Eh
{{Δw}}[[∇(v − vh )]]ds
e
e∈Eh
≤ Cv − vh h wV . The map Eh defined in (4.2) satisfies the estimate [12, 16, 26] −2 2 2 h−4 T v − Eh vL2 (T ) + hT |v − Eh v|H 1 (T ) T ∈Th (4.24) + Eh v2V ≤ Cv2h ∀ vh ∈ Vh . Let v, φ ∈ Vh and ψ = φ − Eh φ. Then after two integration by parts and using earlier arguments with (4.20)–(4.22), we find that 2 (f − Δ v)ψ dx + [[∇Δv]]{{ψ}}ds (f, ψ) − ah (v, ψ) = T
T ∈Th
−
e∈Eh
+
e∈Eh
[[Δv]]{{∇ψ}}ds −
e
{{Δψ}}[[∇v]]ds −
e
e∈Eh
e
e∈Eh
e
{{∇Δψ}}[[v]]ds
σ1 [[∇v]][[∇ψ]]ds he e
e∈Eh
σ2 − [[v]][[ψ]]ds h3 e∈Eh e e ≤ C u − vh + Osc2 (f ) φh .
Therefore, the assumption (2.7) is valid and hence the estimate (2.9) holds. 5. Conclusions We have developed a new approach to discontinuous finite element methods and proved that all the well-known classical nonconforming methods and discontinuous Galerkin methods for second and fourth order elliptic problems are quasi-optimal up to higher order data oscillations, using only the weak formulations of the boundary value problems. Since the analysis involves techniques from a priori error analysis and a posteriori error analysis, it may be referred to as a medius error analysis. This approach puts discontinuous finite element methods on an equal footing with conforming finite element methods in the sense that the first stage of the a priori error analysis does not require the elliptic regularity theory. It is particularly useful for more complicated problems (such as interface problems) where the exact solution u has low regularity, i.e., u ∈ H s (Ω), where s ≤ 3/2 for second order problems and s ≤ 7/2 for fourth order problems. To keep the technicalities to a minimum, the results in this paper are presented for simple model problems. With appropriate modifications these results can be extended to second order mixed boundary value problems, interface problems, nonhomogeneous Dirichlet problems and fourth order problems with different boundary conditions.
20
THIRUPATHI GUDI
The application of this new approach to hp error estimates and nonconforming meshes will be investigated in the near future. Acknowledgments The author would like to thank Susanne C. Brenner and Li-yeng Sung for many helpful suggestions. References [1] M. Ainsworth and J. T. Oden. A posteriori error estimation in finite element analysis. Pure and Applied Mathematics (New York). Wiley-Interscience [John Wiley & Sons], New York, 2000. MR1885308 (2003b:65001) [2] D.N. Arnold. An interior penalty finite element method with discontinuous elements. SIAM J. Numer. Anal., 19:742–760, 1982. MR664882 (83f:65173) [3] 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:1749–1779, 2002. MR1885715 (2002k:65183) [4] G.A. Baker. Finite element methods for elliptic equations using nonconforming elements. Math. Comp., 31:45–59, 1977. MR0431742 (55:4737) [5] A. Berger, R. Scott and G. Strang. Approximate boundary conditions in the finite element method. In: Symposia Mathematica, Vol. X (Convegno di Analasi Numerica), London, Academic Press 1972, 295–313, 1972. MR0403258 (53:7070) [6] S.C. Brenner. Two-level additive Schwarz preconditioners for nonconforming finite element methods. Math. Comp., 65:897–921, 1996. MR1348039 (96j:65117) [7] S.C. Brenner. Convergence of nonconforming multigrid methods without full elliptic regularity. Math. Comp., 68:25–53, 1999. MR1620215 (99c:65229) [8] S.C. Brenner. Ponicar´ e-Friedrichs inequalities for piecewise H 1 functions. SIAM J. Numer. Anal, 41:306–324, 2003. MR1974504 (2004d:65140) [9] S.C. Brenner, K. Wang and J. Zhao. Poincar´ e-Friedrichs inequalities for piecewise H 2 functions. Numer. Funct. Anal. Optim., 25: 463-478, 2004. MR2106270 (2005i:65178) [10] S.C. Brenner. Discrete Sobolev and Poincar´ e inequalities for piecewise polynomial functions. Elec. Trans. Numer. Anal., 18: 42–48, 2004. MR2083293 (2005k:65239) [11] S.C. Brenner and L.R. Scott. The Mathematical Theory of Finite Element Methods (Third Edition). Springer-Verlag, New York, 2008. MR2373954 (2008m:65001) [12] S.C. Brenner and L.-Y. Sung. C 0 interior penalty methods for fourth order elliptic boundary value problems on polygonal domains. J. Sci. Comput., 22/23:83–118, 2005. MR2142191 (2005m:65258) [13] S.C. Brenner and L. Owens. A weakly over-penalized non-symmetric interior penalty method. J. Numer. Anal. Indust. Appl. Math., 2: 35-48, 2007. MR2332345 (2008c:65315) [14] S.C. Brenner and L. Owens. A W -cycle algorithm for weakly over-penalized interior penalty method. Comput. Meth. Appl. Mech. engrg., 196: 3823-3832, 2007. MR2340007 (2008i:65286) [15] S.C. Brenner L. Owens and L.-Y. Sung. A weakly over-penalized symmetric interior penalty method. E. Tran. Numer. Anal, 30: 107-127, 2008. MR2480072 (2009k:65236) [16] S.C. Brenner, T. Gudi and L.-Y. Sung. An a posteriori error estimator for a quadratic C 0 interior penalty method for the biharmonic problem. to appear in IMA J. Numer. Anal., doi:10.1093/imanum/drn057. [17] P. Castillo, B. Cockburn, I. Perugia and D. Sch¨ otzau. An a priori error analysis of the local discontinuous Galerkin method for elliptic problems. SIAM J. Numer. Anal. , 38:1676–1706, 2000. MR1813251 (2002k:65175) [18] C. Carstensen, T. Gudi and M. Jensen. A unifying theory of a posteriori error control for discontinuous Galerkin FEMs. Numer. Math., 112:363–379, 2009. MR2501309 [19] P.G. Ciarlet. The Finite Element Method for Elliptic Problems. North-Holland, Amsterdam, 1978. MR0520174 (58:25001) [20] B. Cockburn and C.W. Shu. The local discontinuous Galerkin method for time-dependent convection-diffusion systems. SIAM J. Numer. Anal., 35:2440–2463, 1998. MR1655854 (99j:65163)
A NEW ERROR ANALYSIS FOR DG METHODS
21
[21] M. Crouzeix and P.A. Raviart. Conforming and Nonconforming finite element methods for solving the stationary Stokes equations. RAIRO 7, rev. 3:33-76, 1973. MR0343661 (49:8401) [22] J. Douglas, Jr. and T. Dupont. Interior penalty procedures for elliptic and parabolic Galerkin methods. Lecture Notes in Phys., 58, Springer-Verlag, Berlin, 1976. MR0440955 (55:13823) [23] G. Engel, K. Garikipati, T.J.R. Hughes, M.G. Larson, L. Mazzei, and R.L. Taylor. Continuous/discontinuous finite element approximations of fourth order elliptic problems in structural and continuum mechanics with applications to thin beams and plates, and strain gradient elasticity. Comput. Methods Appl. Mech. Engrg., 191:3669–3750, 2002. MR1915664 (2003d:74086) [24] X. Feng and O.A. Karakashian. Fully discrete dynamic mesh discontinuous Galerkin methods for the Cahn-Hilliard equation in phase seperation. Math. Comp., 76:1093–1117, 2007. MR2299767 (2008a:74048) [25] X. Feng and O.A. Karakashian. Two-level nonoverlapping additive Schwarz methods for a discontinuous Galerkin approximation of the biharmonic problem. J. Sci. Comp., 22:299-324, 2005. MR2142199 (2006b:65156) [26] E. H. Georgoulis P. Houston, and J. Virtanen. An a posteriori error indicator for discontinuous Galerkin approximations of fourth order elliptic problems. Nottingham eprint. [27] P. Grisvard. Elliptic Problems in Nonsmooth Domains. Pitman, Boston, 1985. MR775683 (86m:35044) [28] T. Gudi, N. Nataraj and A. K. Pani. Mixed discontinuous Galerkin methods for the biharmonic equation. J. Sci. Comput., 37:103–232, 2008. MR2453216 (2009j:65319) [29] P. Houston, D. Sch¨ otzau, and T.P. Wihler. Energy norm a posteriori error estimation of hpadaptive discontinuous Galerkin methods for elliptic problems. Math. Models Methods Appl. Sci., pages 33–62, 2007. MR2290408 (2008a:65216) [30] O.A. Karakashian and F. Pascal. A posteriori error estimates for a discontinuous Galerkin approximation of second-order elliptic problems. SIAM J. Numer. Anal., 41:2374–2399 (electronic), 2003. MR2034620 (2005d:65192) [31] R.B. Kellogg. Singularities in interface problems, in: B. Hubbard (Ed.), Numerical Solutions of Partial Differential Equations II, Academic Press, New York, pp. 351–400, 1971. MR0289923 (44:7108) [32] L.S.D. Morley. The triangular equilibrium problem in the solution of plate bending problems. Aero. Quart., 19:149–169, 1968. [33] I. Mozolevski, E. S¨ uli, and P.R. B¨ osing. hp-version a priori error analysis of interior penalty discontinuous Galerkin finite element approximations to the biharmonic equation. J. Sci. Comput., 30:465–491, 2007. MR2295480 (2008c:65341) [34] L. Owens. Multigrid Methods for Weakly Over-Penalized Interior penalty Methods. Ph.D. thesis, Department of Mathematics, University of South Corolina, 2007. [35] S. Prudhomme, F. Pascal and J.T. Oden. Review of error estimation for discontinuous Galerkin methods. TICAM Report 00-27, October 17, 2000. [36] B. Rivi` ere, M.F. Wheeler, and V. Girault. A priori error estimates for finite element methods based on discontinuous approximation spaces for elliptic problems. SIAM J. Numer. Anal., 39:902–931, 2001. MR1860450 (2002g:65149) [37] R. Verf¨ urth. A posteriori error estimation and adaptive mesh-refinement techniques. In Proceedings of the Fifth International Congress on Computational and Applied Mathematics (Leuven, 1992), volume 50, pages 67–83, 1994. MR1284252 (95c:65171) [38] R. Verf¨ urth. A Review of A Posteriori Error Estmation and Adaptive Mesh-Refinement Techniques. Wiley-Teubner, Chichester, 1995. [39] M.F. Wheeler. An elliptic collocation-finite-element method with interior penalties. SIAM J. Numer. Anal., 15:152–161, 1978. MR0471383 (57:11117) Center for Computation and Technology, Louisiana State University, Baton Rouge, Louisiana 70803 E-mail address:
[email protected]