2 DGM for elliptic problems
2 DGM for elliptic problems
2 DGM for elliptic problems
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
2.4 Properties of the bilinear <strong>for</strong>ms 27<br />
a s h(v h ,v h ) (2.104) A3.42<br />
= |v h | 2 H 1 (Ω,T h ) − 2 ∑ ∫<br />
n · 〈∇v h 〉[v h ]dS<br />
Γ ∈F ID<br />
h<br />
Γ<br />
≥ |v h | 2 H 1 (Ω,T h )<br />
⎧<br />
⎨<br />
1 ∑<br />
−2<br />
⎩δ<br />
Γ ∈F ID<br />
h<br />
∫<br />
Γ<br />
≥ |v h | 2 H 1 (Ω,T h ) − ω −<br />
⎫1/2 ⎧<br />
⎬ ⎨<br />
h Γ (n · 〈∇v h 〉) 2 dS<br />
⎭ ⎩ δ ∑<br />
δ<br />
C W<br />
J σ h (v h ,v h ),<br />
Γ ∈F ID<br />
h<br />
∫<br />
Γ<br />
⎫<br />
1<br />
⎬<br />
[v h ] 2 dS<br />
h Γ ⎭<br />
1/2<br />
where<br />
ω = 1 δ<br />
∑<br />
Γ ∈F ID Γ<br />
h<br />
Further, from ( 2.69), A3.1 ( 2.81),( A3.7 2.19) eq:MTI and ( 2.26), eq:InvI we get<br />
ω ≤ C H<br />
δ<br />
≤ C HC M<br />
δ<br />
∑<br />
∫<br />
h Γ |〈∇v h 〉| 2 dS. (2.105) A3.43<br />
h K ‖v h ‖ 2 L 2 (∂K) (2.106) A3.44<br />
K∈T h<br />
∑ (<br />
)<br />
h K |v h | H1 (K)|∇v h | H1 (K) + h −1<br />
K |v h| 2 H 1 (K)<br />
K∈T h<br />
≤ C HC M (1 + C I )<br />
|v h | 2 H<br />
δ<br />
1 (Ω,T h ) .<br />
Now let us choose<br />
δ = 2C H C M (1 + C I ). (2.107) A3.45<br />
then it follows from ( 2.102) A3.40 and ( 2.104) A3.42 – ( 2.107) A3.45 that<br />
a s h(v h ,v h ) (2.108) A3.46<br />
≥ 1 (<br />
|v h | 2 H<br />
2<br />
1 (Ω,T h ) − 4C )<br />
HC M (1 + C I )<br />
J σ<br />
C<br />
h(v h ,v h )<br />
W<br />
≥ 1 (<br />
)<br />
|v h | 2 H<br />
2<br />
1 (Ω,T h ) − Jσ h(v h ,v h ) .<br />
Finally, from ( A2.20c 2.52) and ( A3.46 2.108) we have<br />
B s,σ<br />
h (v h,v h ) = a s h(v h ,v h ) + Jh σ (v h ,v h ) (2.109) A3.47<br />
≥ 1 (<br />
)<br />
|v h | 2 H<br />
2<br />
1 (Ω,T h ) + Jσ h(v h ,v h ) = 1 2 |||v h||| 2 ,<br />
which we wanted to prove.<br />
⊓⊔<br />
Lemma 2.23. (IIPG coercivity) Let assumptions (A1) and (A2) be satis-<br />
fied, let<br />
lem:2.8I