Partial Differential Equations - Modelling and ... - ResearchGate
Partial Differential Equations - Modelling and ... - ResearchGate Partial Differential Equations - Modelling and ... - ResearchGate
16 V. Girault and M.F. Wheeler For a given force f ∈ L 2 (Ω) d , this problem has a unique solution u ∈ H 1 0 (Ω) d and p ∈ L 2 0(Ω) (cf., for instance, [Tem79, GR86]). In fact, the solution is more regular and the scheme below is consistent (cf. [Gri85, Dau89]). In view of the operator and boundary condition in (11), the relevant spaces here are H 1 (E h ) d and L 2 0(Ω), and the set Γ h,N is empty. The definition of J 0 is extended straightforwardly to vectors and the permeability tensor is replaced by the identity multiplied by the viscosity. Thus, the semi-norms (28) and (30) are replaced by |||∇v||| L2 (E h ) = [|v|] H 1 (E h ) = µ 1 2 [ ∑ E∈E h ‖∇v‖ 2 L 2 (E) ] 1 2 , (41) ( ) 1 |||∇v||| 2 L 2 (E h ) + J 2 0(v, v) . (42) Again, we choose an integer k ≥ 1 and we discretize H 1 (E h ) d and L 2 0(Ω) with the finite element spaces X h = {v ∈ L 2 (Ω) d : ∀E ∈E h , v| E ∈ P k (E) d }, (43) M h = {q ∈ L 2 0(Ω) :∀E ∈E h , q| E ∈ P k−1 (E)}. (44) The choice P k−1 for the discrete pressure, one degree less than the velocity, is suggested by the fact that L 2 is the natural norm for the pressure. Keeping in mind (13) and (14), we discretize (11) by the following discrete system: Find u h ∈ X h and p h ∈ M h satisfying for all v h ∈ X h and q h ∈ M h : µ ∑ ∇u h : ∇v h dx E∈E h ∫E − µ − ∑ ∑ e∈Γ h ∪∂Ω E∈E h ∫E ∑ ∫ ( ) {∇uh · n e } e [v h ] e + ε{∇v h · n e } e [u h ] e dσ + µJ0 (u h , v h ) e p h div v h dx + E∈E h ∫E ∑ e∈Γ h ∪∂Ω q h div u h dx − ∫ ∫ {p h } e [v h ] e · n e dσ = e ∑ e∈Γ h ∪∂Ω Ω f · v h dx, (45) ∫ {q h } e [u h ] e · n e dσ =0, (46) with the interpretation for the parameters ε and σ of formula (7). e
Let a h and b h denote the bilinear forms a h (u, v) =µ ∑ ∇u : ∇v dx E∈E h ∫E − µ b h (v,q)= ∑ E∈E h ∫E ∑ e∈Γ h ∪∂Ω Discontinuous Galerkin Methods 17 ∫ ( ) {∇u · ne } e [v] e + ε{∇v · n e } e [u] e dσ, (47) e q div v dx − ∑ e∈Γ h ∪∂Ω ∫ {q} e [v] e · n e dσ. (48) Clearly, the properties of a h listed in the previous section are valid here and, therefore, existence and uniqueness of u h hold for IIPG and SIPG if the penalty parameters σ e are well-chosen; they hold unconditionally for NIPG and they hold for OBB-DG if k ≥ 2. But existence and uniqueness of p h is not straightforward because it is the consequence of the uniform “inf-sup” condition, that is now a standard tool in studying problems with a linear constraint (cf. [Bab73, Bre74]): There is a constant β ∗ > 0 independent of h such that b h (v h ,q h ) inf sup ≥ β ∗ . (49) q h ∈M h v h ∈X h [|v h |] H 1 (E h )‖q h ‖ L 2 (Ω) By using the Raviart–Thomas interpolation operator (cf. [RT75, GR86]), we can readily show that (49) holds for IIPG, SIPG, NIPG and OBB-DG (cf., for instance, [SST03]). Hence the four schemes have a unique solution. However, in order to derive optimal error estimates, we have to bound the term b h (v h ,p− ρ h p), where ρ h is a suitable approximation operator, for instance, a local L 2 projection on each E, andv h is an arbitrary test function in X h .Itiseasyto prove that if p ∈ H k (E h )then ( ) 1 ∑ 2 |b h (v h ,p− ρ h p)| ≤Ch k 1 ‖[v h ]‖ 2 L h 2 (e) + |||∇v h||| 2 L 2 (E h ) . e e∈Γ h ∪∂Ω As J 0 is zero for OBB-DG, we cannot obtain a good estimate for this method: it does not seem to be well-adapted to this formulation of the Stokes problem. On the other hand, we can obtain optimal error estimates for IIPG, SIPG, NIPG: if the exact solution (u,p) of the problem (11) belongs to H k+1 (Ω) d × H k (Ω), then for the three methods [|u h − u|] H1 (E h ) + ‖p h − p‖ L2 (Ω) =O(h k ). (50) Remark 6. Let E be an element as in Remark 3. Taking first q h = χ E in (46) and next the i-th component of v h , v h,i = χ E in (45), we obtain the discrete mass balance relations: ∫ div u h dx − 1 ∑ ∫ (u int h − u ext h ) · n E dσ =0, E 2 e e∈∂E −µ ∑ ∫ {∇u h,i }·n E dσ + µ ∑ e∈∂E e e∈∂E e σ e (u h e ∫e int h,i − u ext h,i ) dσ = ∫ E f i dx.
- 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: Discontinuous Galerkin Methods 15 W
- Page 31 and 32: Discontinuous Galerkin Methods 19 t
- 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
Let a h <strong>and</strong> b h denote the bilinear forms<br />
a h (u, v) =µ ∑<br />
∇u : ∇v dx<br />
E∈E h<br />
∫E<br />
− µ<br />
b h (v,q)= ∑<br />
E∈E h<br />
∫E<br />
∑<br />
e∈Γ h ∪∂Ω<br />
Discontinuous Galerkin Methods 17<br />
∫<br />
( )<br />
{∇u · ne } e [v] e + ε{∇v · n e } e [u] e dσ, (47)<br />
e<br />
q div v dx −<br />
∑<br />
e∈Γ h ∪∂Ω<br />
∫<br />
{q} e [v] e · n e dσ. (48)<br />
Clearly, the properties of a h listed in the previous section are valid here <strong>and</strong>,<br />
therefore, existence <strong>and</strong> uniqueness of u h hold for IIPG <strong>and</strong> SIPG if the<br />
penalty parameters σ e are well-chosen; they hold unconditionally for NIPG<br />
<strong>and</strong> they hold for OBB-DG if k ≥ 2. But existence <strong>and</strong> uniqueness of p h is<br />
not straightforward because it is the consequence of the uniform “inf-sup”<br />
condition, that is now a st<strong>and</strong>ard tool in studying problems with a linear<br />
constraint (cf. [Bab73, Bre74]): There is a constant β ∗ > 0 independent of h<br />
such that<br />
b h (v h ,q h )<br />
inf sup<br />
≥ β ∗ . (49)<br />
q h ∈M h v h ∈X h<br />
[|v h |] H 1 (E h )‖q h ‖ L 2 (Ω)<br />
By using the Raviart–Thomas interpolation operator (cf. [RT75, GR86]), we<br />
can readily show that (49) holds for IIPG, SIPG, NIPG <strong>and</strong> OBB-DG (cf., for<br />
instance, [SST03]). Hence the four schemes have a unique solution. However, in<br />
order to derive optimal error estimates, we have to bound the term b h (v h ,p−<br />
ρ h p), where ρ h is a suitable approximation operator, for instance, a local L 2<br />
projection on each E, <strong>and</strong>v h is an arbitrary test function in X h .Itiseasyto<br />
prove that if p ∈ H k (E h )then<br />
( ) 1<br />
∑<br />
2<br />
|b h (v h ,p− ρ h p)| ≤Ch k 1<br />
‖[v h ]‖ 2 L<br />
h 2 (e) + |||∇v h||| 2 L 2 (E h ) .<br />
e<br />
e∈Γ h ∪∂Ω<br />
As J 0 is zero for OBB-DG, we cannot obtain a good estimate for this method:<br />
it does not seem to be well-adapted to this formulation of the Stokes problem.<br />
On the other h<strong>and</strong>, we can obtain optimal error estimates for IIPG, SIPG,<br />
NIPG: if the exact solution (u,p) of the problem (11) belongs to H k+1 (Ω) d ×<br />
H k (Ω), then for the three methods<br />
[|u h − u|] H1 (E h ) + ‖p h − p‖ L2 (Ω) =O(h k ). (50)<br />
Remark 6. Let E be an element as in Remark 3. Taking first q h = χ E in (46)<br />
<strong>and</strong> next the i-th component of v h , v h,i = χ E in (45), we obtain the discrete<br />
mass balance relations:<br />
∫<br />
div u h dx − 1 ∑<br />
∫<br />
(u int<br />
h − u ext<br />
h ) · n E dσ =0,<br />
E 2 e<br />
e∈∂E<br />
−µ ∑ ∫<br />
{∇u h,i }·n E dσ + µ ∑<br />
e∈∂E<br />
e<br />
e∈∂E<br />
e<br />
σ e<br />
(u<br />
h e<br />
∫e<br />
int<br />
h,i − u ext<br />
h,i ) dσ =<br />
∫<br />
E<br />
f i dx.