18.03.2014 Views

2 DGM for elliptic problems

2 DGM for elliptic problems

2 DGM for elliptic problems

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

20 2 Elliptic <strong>problems</strong><br />

The scheme ( 2.62) A2.22c is called symmetric interior penalty Galerkin (SIPG)<br />

method. It was derived by Arnold ([Arn82]) Arnold and Wheeler ([Whe78]) Whe78 by adding<br />

penalty terms to the <strong>for</strong>m Bh s . This <strong>for</strong>mulation leads to a symmetric bilinear<br />

<strong>for</strong>m which is coercive if the penalty parameter σ is sufficiently large.<br />

Moreover, the Aubin-Nitsche trick can be used <strong>for</strong> obtaining an optimal error<br />

estimate in the L 2 (Ω)-norm.<br />

The method ( 2.63), A2.22d called nonsymmetric interior penalty Galerkin (NIPG)<br />

method, was proposed by Girault, Riviére and Wheeler in [RWG99]. RWG99 In this<br />

case the bilinear <strong>for</strong>m B n,σ<br />

h<br />

is nonsymmetric and does not allow to obtain<br />

optimal error estimates in the L 2 (Ω)-norm with the aid of the Aubin-Nitsche<br />

trick. However, numerical experiments show that the odd degrees of the polynomial<br />

approximation give the optimal order of convergence. On the other<br />

hand, a favorable property of NIPG method is the coercivity of B n,σ<br />

h<br />

(·, ·) <strong>for</strong><br />

any penalty parameter σ > 0.<br />

Finally, the method 2.64), A2.22e called incomplete interior penalty Galerkin<br />

(IIPG) method, was studied in [DSW04], Dawson2004 [Sun03], Sun-PhD [SW05]. Sun05 In this case the<br />

bilinear <strong>for</strong>m B i,σ<br />

h<br />

is nonsymmetric and does not allow to obtain an optimal<br />

error estimate in the L 2 (Ω)-norm. Moreover, the penalty parameter σ should<br />

be chosen sufficiently large in order to guarantee the coercivity of B i,σ<br />

h . The<br />

advantage of the IIPG method is the simplicity of the discrete diffusion operator.<br />

This is particularly advantageous in the case when the diffusion operator<br />

is nonlinear. (See, e.g. [Dol08].<br />

iipg07<br />

It would also be possible to define the scheme Bh i (u,v) = li h (v) ∀v ∈ S hp,<br />

where Bh i (u,v) = ai h (u,v) and li h (v) = F h i (v), but this method does not make<br />

sense, because it does not contain the Dirichlet boundary condition ( 2.2).<br />

A0.2a<br />

sec:2.4<br />

2.4 Properties of the bilinear <strong>for</strong>ms<br />

We are interested in the existence of the numerical solutions of method ( 2.60)<br />

A2.22a<br />

– ( 2.64) A2.22e and in a priori error estimates of the difference of numerical solution<br />

and the exact one. There<strong>for</strong>e, we define the following mesh-dependent norm<br />

|||u||| Th<br />

=<br />

(<br />

|u| 2 H 1 (Ω,T h ) + Jσ h(u,u)) 1/2<br />

, (2.68) en<br />

In what follows, if there is no danger of misunderstanding, we shall omit<br />

the subscript T h . This means that we shall simply write ||| · ||| = ||| · ||| Th<br />

.<br />

exer1 Exercise 2.10. Prove that ||| · ||| is a norm on the spaces H 1 (Ω, T h ) and S hp .<br />

Let Γ ∈ Fh I be an inner face and K(L)<br />

Γ<br />

and K (R)<br />

Γ<br />

the elements sharing Γ.<br />

There are several possibilities how to define the penalty weight σ. We can set<br />

σ| Γ =<br />

(<br />

max<br />

C W<br />

h K<br />

(L)<br />

Γ<br />

, h K<br />

(R)<br />

Γ<br />

), (2.69) A3.1

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!