Partial Differential Equations - Modelling and ... - ResearchGate
Partial Differential Equations - Modelling and ... - ResearchGate Partial Differential Equations - Modelling and ... - ResearchGate
18 V. Girault and M.F. Wheeler 5 DG Approximation of a Convection-Diffusion Equation Consider the convection-diffusion equation combining (24) and (15) in the domain Ω of the previous sections: − div(K∇c)+u ·∇c = f, in Ω, (51) K∇c · n Ω =0, on ∂Ω, (52) where f belongs to L 2 0(Ω), the tensor K satisfies the assumptions listed in Section 3 and u satisfies (16): div u =0 inΩ, u · n Ω =0 on∂Ω. This problem has a solution c ∈ H 1 (Ω), unique up to an additive constant under mild restrictions on the velocity u, for instance, when u belongs to H 1 (Ω) d . We propose to discretize it with a DG method when u is replaced by the solution u h ∈ X h of a flow problem that satisfies b h (u h ,q h ) = 0 for all q h ∈ M h : ∑ q h div u h dx − ∑ ∫ {q h } e [u h ] e · n e dσ =0. E∈E h ∫E For an integer l ≥ 1, we define e∈Γ h ∪∂Ω e Y h = {c ∈ L 2 (Ω) :∀E ∈E h , c| E ∈ P l (E)}. (53) In view of (23) and (32), we discretize (51)–(52) by: Find c h ∈ Y h such that for all v h ∈ Y h : ∑ E∈E h ∫E − + ∑ ∑ e∈Γ h ∪∂Ω E∈E h ∫E K∇c h ·∇v h dx ∫ ( ) {K∇ch · n e } e [v h ] e + ε{K∇v h · n e } e [c h ] e dσ + J0 (c h ,v h ) e ( uh ·∇c h + 1 2 (div u ) h)c h vh dx − 1 2 − ∑ ∫ {u h }·n E (c int h E∈E (∂E) − h where (∂E) − is defined by (20) ∑ e∈Γ h ∪∂Ω ∫ [u h ] e · n e {c h v h } e dσ e − c ext h )vh int dσ = (∂E) − = {x ∈ ∂E : {u h }·n E (x) < 0}, ∫ Ω fv h dx, (54) and the parameters ε and σ e are the same as previously. To simplify, we introduce the form t h with the upwind approximation of the transport term in (54):
Discontinuous Galerkin Methods 19 t h (u h ; v h ,w h )= ∑ (u h ·∇v h + E∈E ∫E 1 ) 2 (div u h)v h w h dx h − ∑ ∫ {u h }·n E (vh int −vh ext )wh int dσ− 1 ∑ ∫ [u h ] e·n e {v h w h } e dσ. E∈E (∂E) − 2 h e∈Γ h ∪∂Ω e (55) This form is positive in the following sense (cf. [GRW05]): for all v h ∈ Y h t h (u h ; v h ,v h )= 1 ∑ ‖|{u h }·n E | 1 2 (v int h 2 E∈E h − vh ext )‖ 2 L 2 ((∂E) −\∂Ω) + ‖|u h · n Ω | 1 2 vh ‖ 2 L 2 ((∂Ω) −) , (56) where (∂Ω) − = {x ∈ ∂Ω : u h · n Ω (x) < 0}. Therefore, if the penalty parameters σ e are chosen as in Section 3, we see that system (54) has a solution t h in Y h , unique up to an additive constant. In particular, this means that (54) is compatible with (51)–(52) and this is an important property, cf. [DSW04]. However, proving a priori error estimates is more delicate, considering that u h proceeds from a previous computation. If the error in computing u h is measured in the norm (42), then the contribution of t h (u h ; c h ,v h )tothe error is estimated as in the Navier–Stokes equations. This requires discrete Sobolev inequalities, and as mentioned in Remark 5, this does not seem to be possible for OBB-DG schemes. On the other hand, for IIPG, SIPG and NIPG, the analysis in [GRW05] carries over here and yields, when u and c are sufficiently smooth: where k is the exponent in (50). [|c h − c|] H1 (E h ) =O(h min(k,l) ), Remark 7. Let E be an element as in Remark 3. Taking v h = χ E in (54), we obtain the discrete mass balance relation: − ∑ e∈∂E ∫ {K∇c h }·n E dσ + ∑ e + 1 2 e∈∂E ( ∫ (div u h )c h dx − 1 E 2 + ∑ e∈(∂E) − ∫e σ e (c h e ∫e int h ∫ ∑ e∈∂E (u int h e − c ext h ) dσ − u ext h |{u h }·n E |(c int h ) · n E c int dσ h ) ∫ − c ext h ) dσ = fdx. E
- Page 1 and 2: Partial Differential Equations
- Page 3 and 4: Partial Differential Equations Mode
- Page 5 and 6: Dedicated to Olivier Pironneau
- Page 7 and 8: VIII Preface computers has been at
- Page 9 and 10: Contents List of Contributors .....
- Page 11 and 12: List of Contributors Yves Achdou UF
- Page 13 and 14: List of Contributors XV Claude Le B
- Page 15 and 16: Discontinuous Galerkin Methods Vive
- Page 17 and 18: Discontinuous Galerkin Methods 5 2
- Page 19 and 20: Discontinuous Galerkin Methods 7 g
- Page 21 and 22: Discontinuous Galerkin Methods 9 (
- Page 23 and 24: Discontinuous Galerkin Methods 11 3
- Page 25 and 26: Discontinuous Galerkin Methods 13 3
- Page 27 and 28: Discontinuous Galerkin Methods 15 W
- Page 29: Let a h and b h denote the bilinear
- Page 33 and 34: Discontinuous Galerkin Methods 21 l
- Page 35 and 36: Table 1. Primal DG for transport Di
- Page 37 and 38: Discontinuous Galerkin Methods 25 [
- Page 39 and 40: Mixed Finite Element Methods on Pol
- Page 41 and 42: Mixed FE Methods on Polyhedral Mesh
- Page 43 and 44: Mixed FE Methods on Polyhedral Mesh
- Page 45 and 46: Mixed FE Methods on Polyhedral Mesh
- Page 47 and 48: 4 Hybridization and Condensation Mi
- Page 49 and 50: Mixed FE Methods on Polyhedral Mesh
- Page 51 and 52: is symmetric and positive definite,
- Page 53 and 54: with some coefficient α ∈ R wher
- Page 55 and 56: 44 E.J. Dean and R. Glowinski so fa
- Page 57 and 58: 46 E.J. Dean and R. Glowinski 2 A L
- Page 59 and 60: 48 E.J. Dean and R. Glowinski S:T=
- Page 61 and 62: 50 E.J. Dean and R. Glowinski minim
- Page 63 and 64: 52 E.J. Dean and R. Glowinski 6 On
- Page 65 and 66: 54 E.J. Dean and R. Glowinski Fig.
- Page 67 and 68: 56 E.J. Dean and R. Glowinski and
- Page 69 and 70: 58 E.J. Dean and R. Glowinski 7 Num
- Page 71 and 72: 60 E.J. Dean and R. Glowinski Fig.
- Page 73 and 74: 62 E.J. Dean and R. Glowinski Assum
- Page 75 and 76: Higher Order Time Stepping for Seco
- Page 77 and 78: u n+1 h Optimal Higher Order Time D
- Page 79 and 80: Optimal Higher Order Time Discretiz
Discontinuous Galerkin Methods 19<br />
t h (u h ; v h ,w h )= ∑ (u h ·∇v h +<br />
E∈E<br />
∫E<br />
1 )<br />
2 (div u h)v h w h dx<br />
h<br />
− ∑ ∫<br />
{u h }·n E (vh<br />
int −vh<br />
ext )wh int dσ− 1 ∑<br />
∫<br />
[u h ] e·n e {v h w h } e dσ.<br />
E∈E<br />
(∂E) −<br />
2<br />
h e∈Γ h ∪∂Ω<br />
e<br />
(55)<br />
This form is positive in the following sense (cf. [GRW05]): for all v h ∈ Y h<br />
t h (u h ; v h ,v h )= 1 ∑<br />
‖|{u h }·n E | 1 2 (v<br />
int<br />
h<br />
2<br />
E∈E h<br />
− vh<br />
ext )‖ 2 L 2 ((∂E) −\∂Ω)<br />
+ ‖|u h · n Ω | 1 2 vh ‖ 2 L 2 ((∂Ω) −) , (56)<br />
where<br />
(∂Ω) − = {x ∈ ∂Ω : u h · n Ω (x) < 0}.<br />
Therefore, if the penalty parameters σ e are chosen as in Section 3, we see that<br />
system (54) has a solution t h in Y h , unique up to an additive constant. In<br />
particular, this means that (54) is compatible with (51)–(52) <strong>and</strong> this is an<br />
important property, cf. [DSW04].<br />
However, proving a priori error estimates is more delicate, considering<br />
that u h proceeds from a previous computation. If the error in computing u h<br />
is measured in the norm (42), then the contribution of t h (u h ; c h ,v h )tothe<br />
error is estimated as in the Navier–Stokes equations. This requires discrete<br />
Sobolev inequalities, <strong>and</strong> as mentioned in Remark 5, this does not seem to<br />
be possible for OBB-DG schemes. On the other h<strong>and</strong>, for IIPG, SIPG <strong>and</strong><br />
NIPG, the analysis in [GRW05] carries over here <strong>and</strong> yields, when u <strong>and</strong> c<br />
are sufficiently smooth:<br />
where k is the exponent in (50).<br />
[|c h − c|] H1 (E h ) =O(h min(k,l) ),<br />
Remark 7. Let E be an element as in Remark 3. Taking v h = χ E in (54), we<br />
obtain the discrete mass balance relation:<br />
− ∑<br />
e∈∂E<br />
∫<br />
{K∇c h }·n E dσ + ∑<br />
e<br />
+ 1 2<br />
e∈∂E<br />
( ∫<br />
(div u h )c h dx − 1<br />
E<br />
2<br />
+ ∑<br />
e∈(∂E) −<br />
∫e<br />
σ e<br />
(c<br />
h e<br />
∫e<br />
int<br />
h<br />
∫<br />
∑<br />
e∈∂E<br />
(u int<br />
h<br />
e<br />
− c ext<br />
h ) dσ<br />
− u ext<br />
h<br />
|{u h }·n E |(c int<br />
h<br />
) · n E c int dσ<br />
h<br />
)<br />
∫<br />
− c ext<br />
h ) dσ = fdx.<br />
E