• No results found

ERROR ESTIMATE FOR SPACE-TIME DISCONTINUOUS GALERKIN FINITE ELEMENT METHOD OF CONVECTION-DIFFUSION PROBLEM

N/A
N/A
Protected

Academic year: 2020

Share "ERROR ESTIMATE FOR SPACE-TIME DISCONTINUOUS GALERKIN FINITE ELEMENT METHOD OF CONVECTION-DIFFUSION PROBLEM"

Copied!
26
0
0

Loading.... (view fulltext now)

Full text

(1)

Available Online at www.ijpret.com

25

INTERNATIONAL JOURNAL OF PURE AND

APPLIED RESEARCH IN ENGINEERING AND

TECHNOLOGY

A PATH FOR HORIZING YOUR INNOVATIVE WORK

ERROR ESTIMATE FOR SPACE-TIME DISCONTINUOUS GALERKIN FINITE

ELEMENT METHOD OF CONVECTION-DIFFUSION PROBLEM

HASHIM A. KASHKOOL, YAHEA H. SALEEM, GHAZI A. MUFTEN

Dep. of Mathematics, College of Education, University of Basrah, Basrah, Iraq.

Accepted Date: 01/11/2013 ; Published Date: 01/12/2013

Abstract: This paper presents the theory of the space-time discontinuous Galerkin finite element ( DGFE) method for linear convection – diffusion problem. DGFE method is applied separately in space and time using, in general, different space grids on different time levels.

We prove the properties of the bilinear form ( , ), (v-elliptic and continuity), stability and

prove the approximate solution is converges with error of order (ℎ + ).

Keywords: linear convection – diffusion equation, discontinuous Galerkin method,

convergent, stability.

Corresponding Author: HASHIM A. KASHKOOL

Access Online On:

www.ijpret.com

How to Cite This Article:

(2)

Available Online at www.ijpret.com

26

INTRODUCTION

A number of complex problems from science and technology (aerospace engineering, turbo machinery, oil recovery, meteorology, environmental protection etc.) require to apply new efficient, robust, reliable and highly accurate numerical methods. It is necessary to develop techniques that allow realizing numerical approximations of strongly nonlinear singularly perturbed systems in domains with complex geometry whose solution contain internal or boundary layers. An excellent candidate to overcome these difficulties is the DGFE method, which becomes more and more popular in the solution of a number of problems. The DGFE method uses piecewise polynomial approximations of the sought solution on a finite elements mesh without any requirement on continuity between neighboring elements and can be considered a generalization of the finite volume and finite element methods . It allows to construct higher order schemes in a natural way and is suitable for approximation of discontinuous solutions of conservation laws or solutions of singularly perturbed convection-diffusion problems having steep gradients. This method exploits' advantages of the finite element method and finite volume schemes with an approximate Riemann solver and can be applied on unstructured grids which are generated for most complex geometries. The original DGFE method was introduced in [8] for the solution of a neutron transport linear equation and analyzed theoretically in [7] and later in [6]. Almost simultaneously the DGFE techniques were developed for the numerical solution of elliptic problems [14] and space semi discretization of parabolic problems [5], [1], using the interior penalty Galerkin methods. In the discretization of non stationary problems, one often uses the space semi discretization, also called the method of lines. The DGFE discretization with respect to space leads to a large system of ordinary differential equations which can be solved numerically by a suitable ODE solver (See, e.g., [9], [10], [3], [4], [2], [11], [12], [13] ).

In the present paper we are concerned with the space-time discontinuous Galekin discretization applied to the convection-diffusion problem. The time interval is split into subintervals and on each time level a different space mesh may be used in general. Moreover, the triangulations used for the space discretization may be nonconforming with hanging nodes.

(3)

Available Online at www.ijpret.com

27

2. The Convection-Diffusion problem.

Let Ω ⊂ be a bounded polyhedral domain and T > 0. We consider he

convection-diffusion problem[18]: Find ∈ = Ω × (0, ) → such that

− ∆ + ∇ = (2.1)

= Ω × (0, ) (2.2)

= Ω × (0, ) (2.3)

( , 0) = ( ), ∈ . (2.4)

We assume that = Ω ∪ Ω

∙ < 0 Ω (2.5)

∙ ≥0 Ω for all ∈[0 . ], (2.6)

here is the unit outer normal to the boundary ∂Ω of Ω, Ω is the inflow boundary and

Ω is the outflow boundary

3-Definitions:

It is beneficial to mention the definitions of the vector space that we used during this study.

The vector space (Ω) is the space of square-integrable functions on Ω ⊂

(Ω) = :Ω → . . Ω ≤ ∞ ,

indeed (Ω) is Hilbert space with respect to the following inner product

( , ) = ( )

( ) and norm ‖ ‖ () =

for =∞, (Ω) denotes the space of all functions which are bounded for almost all ∈ Ω:

(Ω) = { ∶| ( )| <∞ ∈ Ω},

this space is equipped with the norm

‖ ‖ ()= { sup {| ( )|: ∈ }.

(4)

Available Online at www.ijpret.com

28 (Ω) = ∈ (Ω): ∈ (Ω), = 1,2 … … .

and the corresponding norm,

‖ ‖ (Ω) = ( + ( ) Ω)

also,

(Ω) = { ∈ (Ω): = 0 Ω},

with the same scalar product and norm as (Ω). We introduce the norm for both

continuous time ∈[0, ] and space Ω by:

‖ ‖ () = ‖ ‖ and ‖ ‖ ( () = ‖ ‖

We also use the Buchner spaces. Let be a Banach space with a norm ‖ .‖ and a semi norm

| . | . Then we define:

([0, ]; ) = : [0, ]→ , ,‖ ‖ ([ , ]; )= sup

∈[ , ]

‖ ‖ <∞ ,

(0, ; ) = : (0, )→ , ,‖ ‖ ( , ; ) = ‖ ‖ < ∞},

(0, ; ) = ∈ (0, ; ); ‖ ‖ ( , ; ) = <∞},

moreover, we set

| | ([ , ]; ) = sup

∈[ , ]

(5)

Available Online at www.ijpret.com

29 | | ( , ; )= .

4. Discretization of the problem:

In the time interval ∈[0, ] we shall construct a partition 0 = < <⋯< = , and

denote = ( , ), = − , = ,⋯, . For each we consider a

partition , of the closure Ω of the domain Ω into a finite number of closed triangles with

mutually disjoint interiors. The partitions , are in general different for different . By ,

we denote the system of all edges of all elements ∈ , . Further, we denote the set of all

inner and boundary edges by:

, = ∈ , , ⊂ Ω ,

, = ∈ , , ⊂ Ω ,

Γ = ∈ , , ⊂ Ω ,

Γ = ∈ , , ⊂ Ω ,

For ∈ Ω, , , we introduce the following notation. Obviously , = , ∪ , ,

, =Γ ∪ Γ for each ∈ , . For a function defined in ⋃ .

Put, = ( ) = → ( ), = → ( ) , [ ] = ( − ),

{ } =1

2( + ) (4.1)

[ ] = ( − ) (4.2)

further,

= ∈ : ∙ < 0 (4.3) = ∈ : ∙ ≥0 (4.4)

where denotes the unit outer normal to .

4.1 Assumptions:

(6)

Available Online at www.ijpret.com

30

b) is the trace of some ∈ [0, ]; (Ω) ∩ ( ) on Ω × (0, )

c) ∈ [0, ]; ( Ω ) ,

d) | | = the area of ∈ , , and =| | , ≥( −1) .

e) Define ℎ = the length of the longest side of the triangle ∈ , and put ℎ =

diameter of . ℎ = ∈ , ℎ .

5. The weak form of problem.

We multiply equation (2.1) by the test function ∈ = (Ω) and integrating by part such

that:

Ω + ∇ ∇ Ω

∈ ,

− ∇ ∙

∈ ,

+ ∙ ∇

,

Ω − | ∙ |

,

=

∈ ,

Ω .

where denotes the outward normal to each element edge. The fourth and sixth terms in the left-hand side contains the integrals over the element edges, Then we have,

Ω + ∇ ∇ Ω

∈ ,

− [ ∇ ∙ ]

∈ ,

+ ∙ ∇

∈ ,

Ω − [| ∙ | ]

∈ ,

=

∈ ,

(7)

Available Online at www.ijpret.com

31

Ω + ∇ ∇ Ω

∈ ,

− ([ ∇ ∙ ]{ } + [ ]{ ∇ ∙ })

,

+ ∙ ∇

,

− | ∙ |([ ]{ } + { }[ ])

∈ ,

=

∈ ,

Ω .

since is continuous then [u] and [ ∇ ∙ ] = 0, we get,

Ω + ∇ ∇ Ω

∈ ,

− [ ]{ ∇ ∙ }

∈ ,

− ∙ ∇

,

Ω − | ∙ |{ }[ ]

,

=

,

Ω .

We note that the left hand side of the above equation is still non-symmetric and non

positivity with respect to argument and [15], to rectify these properties, we add the terms,

[ ]{ ∇ ∙ }

,

and [ ][ ]

,

,

we have,

( , ) + ([ ] , ) + (∇ ,∇ )

,

− ({ ∇ ∙ }[ ]− { ∇ ∙ }[ ])

∈ ,

+ ( ∙ ∇ , )

∈ ,

− | ∙ |{ }[ ]

,

+ [ ][ ]

,

= ( , )

,

(8)

Available Online at www.ijpret.com

32

( , ) + ([ ] , ) + (∇ ,∇ )

∈ ,

− ({ ∇ ∙ }[ ]− { ∇ ∙ }[ ])

,

+ ( ∙ ∇ , )

,

− | ∙ |{ }[ ]

∈ ,

+ [ ][ ]

∈ ,

= ( , )

∈ ,

+

− ∇ ∙

+ | ∙ |

. (5.1)

Then the weak form is: find ∈ such that:

( , ) + ([ ] , ) + ( , ) = ( ) (5.2)

where,

( , ) = (∇ ,∇ )

,

− ({ ∇ ∙ }[ ]− { ∇ ∙ }[ ])

,

+ ( ∙ ∇ , )

∈ ,

– | ∙ |{ }[ ]

∈ ,

+ [ ][ ]

∈ ,

. (5.3)

( ) = ( , )

,

+

− ∇ ∙

+ | ∙ |

. (5.4)

(9)

Available Online at www.ijpret.com

33 , , + ([ ] , ) + ( , ) = ( ) (5.5)

where,

( , ) = (∇ ,∇ )

,

− ({ ∇ ∙ }[ ]− { ∇ ∙ }[ ])

,

+ ( ∙ ∇ , )

,

− | ∙ |{ }[ ]

,

+ [ ][ ]

,

. (5.6)

( ) = ( , )

∈ ,

+

− ∇ ∙

+ | ∙ |

. (5.7)

where,

, = ∈ (Ω); | ∈ ( ),∀ ∈ ,

and ( ) = set of polynomials of degree at most on and ≥1 is an integer.

6. Properties of the bilinear form ( , ).

Let be Hilbert space with scalar product (∙,∙) , ( = ( )), and corresponding norm

‖ ‖ (Ω). suppose that ( , ) is bilinear form on × . We prove the properties of the

bilinear form (v- and ).

Lemma 1. (v− ). Assume that the penalty value is sufficiently large and that,

≥( −1) , there exist a positive constant k independent of ℎ and such that,

( , )≥k‖ ‖ (

, ), ∀ ∈ , ∀ ∈ ,

Proof: put = in equation (5.3), we get

( , ) = (∇ ,∇ )

∈ ,

+ ( −1) { ∇ ∙ }[ ]

∈ ,

+ ( ∙ ∇ , )

(10)

Available Online at www.ijpret.com

34

− | ∙ |{ }[ ]

∈ ,

+ [ ]

∈ ,

= ( ) (6.1)

Define the energy norm,

( , ) = ∇

( )

,

+ ‖[ ]‖ ( )

,

=‖ ‖ ( , )

To estimate ( ),

( )

= (∇ ,∇ )

∈ ,

= ∇

( )

∈ ,

(6.2)

for ( ), by Schwartz and young inequalities we have,

( )

= ( −1) { ∇ ∙ }[ ]

∈ ,

≤ ‖{ ∙ }‖ ( ) ‖[ ]‖ ( )

,

= ( −1) ‖{ ∙ }‖ ( )‖[ ]‖ ( )

∈ ,

= ( −1) ‖{ ∙ }‖ ( ) ‖[ ]‖ ( )

∈ ,

since,

‖{ ∙ }‖ ( ) =

2 ( ∙ ) + ( ∙ ) ( )

≤ 2

1

ℎ ( ∙ ) ( )+ ( ∙ ) ( )

where = and = , from the trace inequality [17], we have,

≤| |

(11)

Available Online at www.ijpret.com

35 ≤| |

2 ‖∇ ‖ ( )+‖∇ ‖ ( )

≤| | ‖∇ ‖ ( ) = ‖ ∇ ‖ ( )

Where

| |≤ ℎ ≤ ℎ , ∀ ∈ , [17]. And is a constant function [16]. Then,

( )

≤( −1) ‖ ∇ ‖ ( ) ‖[ ]‖ ( )

,

using young inequality we have,

2 ∇ ( )

∈ ,

+ ( −1)

2 ‖[ ]‖ ( )

∈ ,

≤ ∇

( )

,

+ ‖[ ]‖ ( )

,

= ‖ ‖ (

, ). (6.3)

To estimate ( ),

( )

= ( ∙ ∇ , )

∈ ,

− | ∙ |{ }[ ]

∈ ,

= ( )+ ( ) (6.4)

for ( ), by Schwartz and young inequality, we have

( )

= ∙ ∇ ≤ | |

∈ , ∈ ,

‖∇ ‖ ( )‖ ‖ ( )

2‖ ‖ , +2 ‖∇ ‖ ,

≤ ‖ ‖ ( )+‖∇ ‖ ( ) = ‖ ‖

,

(12)

Available Online at www.ijpret.com

36 ( ) ≤ ‖ ‖

, . (6.5)

where, = m, ax , ( ) , .

To estimate ( ),

( )

=− | ∙ |[ ] { }

∈ ,

≤ | ∙ |‖[ ]‖ ( )‖ { }‖ ( )

∈ ,

= | ∙ |‖[ ]‖ ( )‖ { }‖ ( )

,

= | ∙ | ‖[ ]‖ ( ) ‖ { }‖ ( )

∈ ,

since,

‖ { }‖ ( ) ≤1

2ℎ ( ) ( )+ ( ) ( )

from the trace and Poincare inequality we have,

≤1

2ℎ ℎ ( ) ( )+ℎ ( ) ( )

=1

2 ( ) ( )+ ( ) ( )

≤1

2 ‖ ‖ ( ) +‖ ‖ ( ) = ‖ ‖ ,

≤ ‖ ‖ ( , ).

then,

( )

≤ | ∙ | ‖[ ]‖ ( )

,

‖ ‖ ( )

≤ ‖[ ]‖ ( )

∈ ,

(13)

Available Online at www.ijpret.com

37 ≤

2 ‖[ ]‖ ( )

,

+

2 ‖ ‖ ( , ). (6.6)

substituting (6.5)and (6.6) in (6.4) we have,

( )

≤ ‖ ‖

, +2 ‖[ ]‖ ( )

∈ ,

+

2 ‖ ‖ ( , ). (6.7)

To estimate ( ),

( )

= [ ]

∈ ,

≤ ‖[ ]‖ ( )

∈ ,

. (6.8)

substituting (6.2), (6.3), (6.7) and (6.8) in (6.1) we have,

( , ) = ∇ ( ) ∈ , + ‖ ‖ ( , )+ ‖[ ]‖ ( ) , + ‖ ‖ (

, )+2 ‖[ ]‖ ( )+2 ‖ ‖ ( , )

,

= ∇

( )

∈ ,

+ 1 +

2 ‖[ ]‖ ( )

,

+ 2 +

2 ‖ ‖ ( , )

≥ ∇ ( ) ∈ , + ‖[ ]‖ ( ) , + ‖ ‖ ( , ) then,

( , )≥ k‖ ‖ (

, ) .

where,

≥ | ∙ |, = 1, 1 + , ≤ 2 + , and k ≤( + ).

(14)

Available Online at www.ijpret.com

38 ( , )≤ ‖ ‖ , ‖ ‖

, . ∀ , ∈ .

Proof: we introduce equation (5.3),

( , ) = (∇ ,∇ )

,

+ ( ∙ ∇ , )− { ∇ ∙ }[ ]

,,

+ { ∇ ∙ }[ ]

,

− | ∙ |{ }[ ]

,

+ [ ][ ]

,

= ( ). (6.9)

To estimate ( ),

( )

= (∇ ,∇ ) + ( ∙ ∇ , )

∈ ,

≤ | | ‖∇ ‖ ( )‖∇ ‖ ( ) + | | ‖∇ ‖ ( )‖ ‖ ( )

∈ ,

≤ ‖∇ ‖ ( ) ‖∇ ‖ ( )+‖ ‖ ( )

∈ ,

≤ ‖∇ ‖ ( ) +‖ ‖ ( ) ‖∇ ‖ ( )+‖ ‖ ( )

,

= ‖ ‖ ( , )‖ ‖ ( , ). (6.10)

where,

= {| | , | | }

To estimate ( ),

( )

= { ∇ ∙ }[ ]

∈ ,

≤ ‖{ ∙ }‖ ( ) ‖[ ]‖ ( )

,

(15)

Available Online at www.ijpret.com

39 = ‖{ ∙ }‖ ( )‖[ ]‖ ( )

∈ ,

= ‖{ ∙ }‖ ( ) ‖[ ]‖ ( )

∈ ,

since,

‖{ ∙ }‖ ( ) =

2 ( ∙ ) + ( ∙ ) ( )

≤ 2

1

ℎ ( ∙ ) ( )+ ( ∙ ) ( )

from the trace inequality we have,

2 ℎ ( ∙ ) ( )+ ( ∙ ) ( ) ≤

| |

2 ‖∇ ‖ ( ) +‖∇ ‖ ( )

≤| | ‖∇ ‖ ( ) (6.11)

similarly for,

‖[ ]‖ ( ) = ‖[ ]‖ ( )= ‖[ ]‖ ( ) ≤ ‖ ‖ ( ) (6.12)

from (6.11) and (6.12), we get,

( )

≤| | ‖∇ ‖ ( )

‖ ‖ ( )

≤| | ‖∇ ‖ ( )+‖ ‖ ( )

‖ ‖ ( )+‖∇ ‖ ( )

= | | ‖ ‖ ( , )‖ ‖ ( , ). (6.13)

To estimate ( ),

( )

=− { ∇ ∙ }[ ]

∈ ,

≤| | ‖ ‖ (

(16)

Available Online at www.ijpret.com

40 similarly for ( ),

( )

= | ∙ |{ }[ ] ≤

∈ ,

‖ ‖ ( , )‖ ‖ ( , ). (6.15)

To estimate ( ),

( )

= [ ][ ] ≤ ‖[ ]‖ ( )‖[ ]‖ ( )

∈ , ∈ ,

= ‖[ ]‖ ( ) ‖[ ]‖ ( )

.

since,

‖[ ]‖ ( ) ≤ ‖ ‖ ( ) and ‖[ ]‖ ( ) ≤ ‖ ‖ ( )

then,

( )

≤ ‖ ‖

, ‖ ‖ , ≤ ‖ ‖ ( , )‖ ‖ ( , ). (6.16)

substituting (6.10), (6.13), (6.14), (6.15) and (6.16) in (6.9), we have

( , ) = (∇ ,∇ )

∈ ,

+ ( ∙ ∇ , )− { ∇ ∙ }[ ]

∈ ,

+ { ∇ ∙ }[ ] − | ∙ |{ }[ ]

,,

+ [ ][ ]

,

≤ ‖ ‖ ( , )‖ ‖ ( , )−| | ‖ ‖ ( , )‖ ‖ ( , )

+ | | ‖ ‖ (

, )‖ ‖ ( , )− ‖ ‖ ( , )‖ ‖ ( , )

+ ‖ ‖ ( )‖ ‖ ( , )

= + | | (ε −1) + ( −1) ‖ ‖ ( , )‖ ‖ ( , ).

(17)

Available Online at www.ijpret.com

41 ( , )≤ ‖ ‖ ( , )‖ ‖ ( , ).

where,

≥ + | | (ε −1) + ( −1)

Lemma 3.(stability): there exist a constant > 0 independent of ℎ and such that:

‖( ) ‖

, +‖[ ] ‖ , + ‖ ‖ ( ; ( , ))

≤ ‖ ‖

, + ‖ ‖ ( ) + ‖ ‖ ( )

∈ ,

.

∈ ,

Proof: choose = in equation (5.5), we get,

, , + ([ ] , ( ) ) + ( , )

= ( , )

,

+

− ∇ ∙

+ | ∙ |

= ( ) (6.17)

to estimate the first term in the lift hand side,

, , =

1

2 ‖ ‖ , =‖( ) ‖ ,

−‖( ) ‖

, (6.18)

to estimate second term,

([ ] , ( ) )≤ ‖[ ] ‖

(18)

Available Online at www.ijpret.com

42

≤ ‖[ ] ‖

, +‖( ) ‖ , (6.19)

from (6.18) and (6.19) we have,

, , + ([ ] , ( ) ) =‖( ) ‖ ,

+‖[ ] ‖

, (6.20)

for the third term, from lemma (4), we have,

( , ) ≥ ‖ ‖

, = ‖ ‖ ( ; ( , )) (6.21)

To estimate ( ), by young's inequality, we have,

( )

= ( , )≤

2‖ ‖ , +

1

2 ‖ ‖ ,

≤ ‖ ‖

, +‖ ‖ , (6.22).

To estimate ( ),

( )

= – ∇ ∙

≤ ‖ ∇ ∙ ‖ ( )

,

‖ ‖ ( )

2‖∇ ‖ ( )+2 ‖ ‖ ( )

,

≤ ‖ ‖ ( )+‖ ‖ ( )

∈ ,

(6.23)

similarly for the terms,

( ) =

≤ ‖ ‖ ( )+‖ ‖ ( )

∈ ,

(19)

Available Online at www.ijpret.com

43 ( )

= | ∙ |

≤ ‖ ‖ ( )+‖ ‖ ( )

∈ ,

. (6.25)

( ) =−

≤ ‖ ‖ ( ) +‖ ‖ ( )

∈ ,

. (6.26)

substituting (6.18), (6.19), (6.20), (6.21), (6.22),(6.23), (6.24), (6.25) and (6.26) in (6.17), we have,

‖( ) ‖

, +‖[ ] ‖ , + ‖ ‖ ( ; ( , ))

≤ ‖ ‖

, +‖ ‖ , + ‖ ‖ ( )+‖ ‖ ( )

∈ ,

+ ‖ ‖ ( )+‖ ‖ ( )

,

+ ‖ ‖ ( )+‖ ‖ ( )

,

.

+ ‖ ‖ ( )+‖ ‖ ( )

,

re arrangement above inequality, we have,

‖( ) ‖

, +‖[ ] ‖ , + ‖ ‖ ( ; ( ))

≤ ‖ ‖

, +‖ ‖ , + 4‖ ‖ , + 3‖ ‖ ( )

∈ ,

+ ‖ ‖ ( )

∈ ,

.

‖( ) ‖

, +‖[ ] ‖ , + ( −5 )‖ ‖ ( ; ( , ))

≤ ‖ ‖

, + ‖ ‖ ( )

∈ ,

+ ‖ ‖ ( )

∈ ,

.

(20)

Available Online at www.ijpret.com

44

‖( ) ‖

, +‖[ ] ‖ , + ‖ ‖ ( ; ( , ))

≤ ‖ ‖

, + ‖ ‖ ( )

,

+ ‖ ‖ ( )

,

.

where, = , , ≤( −5 ) and ≥3

7. The error estimate.

Theorem (1): suppose that ; (Ω) and that belongs to (Ω) and let sufficiently large then there exist a constant such that :

‖ − ‖ ( , ( , )) ≤ (ℎ + ), , ≥ 1, ≠ .

Proof: let be the projection, and = − = − + − = − , hen,

‖ − ‖ ( , ( , )) ≤ ‖ − ‖ ( , ( , ))+‖ − ‖ ( , ( , ))

=‖ ‖ ( , ( , ))+‖ ‖ ( , ( , )) (7.1) from [19], we have,

‖ ‖ ( , (

, ))

≤ ℎ | |

, , + | | , , .

hence,

‖ ‖ ( , (

, ))≤ √ (ℎ + ) (7.2)

by subtracting (5.5) from (5.2) we have,

( − ) , ) + ( − , ) + ([ − ] , )

= ( − ) , ) + ( − , ) + ([ − ] , ) = 0.

(21)

Available Online at www.ijpret.com

45 ( , ) + ( , ) + ([ ] , ) = ( , ) + ( , )

+([ ] , ).

for bound , let = , we have,

( , ) + ([ ] , ) + ( , )

= ( , ) + ([ ] , ) + ( , ) . (7.3)

since,

( , ) =1

2 ‖ ‖ , = ‖ ‖ , − ‖ ‖ , (7.4)

([ ] , )≤ ‖[ ] ‖

, ‖ ‖ ,

≤1

2 ‖[ ] ‖ , +‖ ‖ , (7.5)

from (7.4) and (7.5), we have,

( , ) + ([ ] , ) =‖ ‖

, +

1

2(‖[ ] ‖ ,

−‖ ‖

, ) (7.6)

from lemma (1) we have,

( , ) ≥k ‖ ‖ (

, ) = k‖ ‖ ( , ( , )). (7.7)

clearly,

( , ) = ( , )−( , )− ( , )

(22)

Available Online at www.ijpret.com

46 ( , ) = 0 and ( , ) = 0,

then we have,

( , ) + ([ ] , ) =−( , ) + ( , ) + ( , )

= ( , )≤1

2 ‖ ‖ , +‖ ‖ , . (7.8)

from lemma (2), we have,

( , )≤ ‖ ‖ , ‖ ‖

, ,

then,

( , ) ≤ ‖ ‖ , ‖ ‖ ,

2 ‖ ‖ , +2 ‖ ‖ ,

=

2 ‖ ‖ ( , ( , ))+2 ‖ ‖ ( , ( , )).

for the first term,

2 ‖ ‖ ( , ( , ))

≤ ℎ | |

, , + | | , , .

dividing by , we have,

‖ ‖ ( , (

, )) ≤ ℎ | | , , + | | , , .

(23)

Available Online at www.ijpret.com

47

( , ) ≤ ℎ | |

, , + | | , ,

+

2 ‖ ‖ ( , ( , )). (7.9)

by substituting (7.6), (7.7), (7.8) and (7.9) in (7.3), we have,

‖ ‖

, +

1

2(‖[ ] ‖ , −2‖ ‖ , ) + k‖ ‖ ( , ( , ))

≤ ℎ | |

, , + | | , , + 2 ‖ ‖ ( , ( , ))

+1

2‖ ‖ , .

k‖ ‖ ( , (

, )) ≤ ℎ | | , , + | | , ,

+

2 ‖ ‖ ( , , ).

re arrangement above inequality, we have,

k−

2 ‖ ‖ ( , ( , ))

≤ ℎ | |

, , + | | , , .

hence,

‖ ‖ ( , (

, ))≤ ℎ | | , , + | | , ,

≤ (ℎ + ).

hence,

‖ ‖ ( , ( , )) ≤ (ℎ + ) (7.10)

(24)

Available Online at www.ijpret.com

48

‖ − ‖ ( , (

, )) ≤ (ℎ + ).

where,

= 2 , ≥

k−2

, = ,√ and k≠ 2

8.Conclusions.

This paper is devoted to the theoretical analysis of error estimates of the space-time DGFE method for linear convection- diffusion problem. The DGFE method is applied separately in space and time using, in general, different space grids on different time levels. There are three

versions depend on the choices of the parameters and .

• If = −1 and is bounded below by a large enough constant, the resulting method is called

the symmetric interior penalty Galerkin (SIPG) method.

• If = +1 and = 1, the resulting method is called the non-symmetric interior penalty Galerkin

(NIPG) method.

• If =0 and > 0 we obtain the incomplete interior penalty Galerkin (IIPG) method.

We prove the properties of the bilinear form ( , ), (v-elliptic and continuity) of DG, stability

and proved the approximate solution is converges with error of order (ℎ + ).

REFERENCES:

1. D. N. Arnold: An interior penalty finite element method with discontinuous elements.

SIAM J. Numér. Anal. 19 (1982), 742–760.bl

2. V. Dolejší, M. Feistauer, and J. Hozman: Analysis of semi-implicit DGFEM for nonlinear

convection- diffusion problems on nonconforming meshes. Preprint No. MATHknm - 2005/1. Charles University Prague, School of Mathematics, 2005; Comput. Methods Appl. Mech. Eng. In press. (doi:10.1016/j. cma. 2006.09.025).

3. V. Dolejší, M. Feistauer, and C. Schwab: A finite volume discontinuous Galerkin scheme for

nonlinear convection-diffusion problems. Calcolo 39 (2002), 1–40.bl

4. V. Dolejší, M. Feistauer, and V. Sobotíková: A discontinuous Galerkin method for nonlinear

(25)

Available Online at www.ijpret.com

49 5. J. Douglas, T. Dupont: Interior penalty procedures for elliptic and parabolic Galerkin methods. In: Computing methods in applied sciences (Second Internat. Sympos., Versailles, 1975). Lect. Notes Phys., Vol. 58. Springer- Verlag, Berlin, 1976, pp. 207–216

6. C. Johnson, J. Pitkäranta: An analysis of the discontinuous Galerkin method for a scalar

hyperbolic equation. Math. Comp. 46 (1986), 1–26.

7. P. Le Saint, P. A. Raviart: On a finite element method for solving the neutron transport

equation. In: Mathematical Aspects of Finite Elements in Partial Differential Equations(C. de Boor, ed.). Academic Press, 1974, pp. 89–145.

8. W. H. Reed, T. R. Hill: Triangular mesh methods for the neutron transport equation.

Technical Report LA-UR-73-479. Los Alamos Scientific Laboratory, 1973.

9. B. Riviere, M.F. Wheeler: A discontinuous Galerkin method applied to nonlinear parabolic

equations. In: Discontinuous Galerkin methods. Theory, Computation and Applications. Lect. Notes in Comput. Sci. Eng. 11 (B. Cockburn et al., eds.). Springer-Verlag, Berlin, 2000, pp. 231– 244.

10. B. Riviere, M. F. Wheeler: Non-conforming methods for transport with nonlinear reaction.

Contemp. Math. 295 (2002), 421–432.

11. S. Sun, M. F. Wheeler: L2(H1) - norm a posteriori error estimation for discontinuous Galerkin approximations of reactive transport problems. J. Sci. Comput. 22– 23 (2005), 501–530.

12. S. Sun, M.F. Wheeler: Symmetric and nonsymmetric discontinuous Galerkin methods

for reactive transport in porous media. SIAM J. Numér. Anal. 43 (2005), 195–219.

13. S. Sun, M. F. Wheeler: Discontinuous Galerkin methods for coupled flow and reactive

transport problems. Appl. Numér. Math. 52 (2005), 273–298.

14. M. F. Wheeler: An elliptic collocation- finite element method with interior penalties.

SIAM J. Numér. Anal. 15 (1978), 152–161.

15. Emmanuil H. Georgoulis: Discontinuous Galerkin Methods for Linear Problems: An

(26)

Available Online at www.ijpret.com

50

16. T. Warburton and J. Hesthaven: On the constants in hp-finite element trace inverse

inequalities, Computer Methods in Applied Mechanics and Engineering, 192 (2003), pp. 2765– 2773.

17. Beatrice Rivi'ere: Discontinuous Galerkin Methods for Solving Elliptic and Parabolic Equations . SIAM J. Society for Industrial and Applied Mathematics Philadelphia, (2008), pp. 29-30.

18. Miloslav Feistauer; Jaroslav Hájek; Karel Švadlenka: Space-time discontinuous Galerkin

method for solving non stationary convection- diffusion- reaction problems Applied Mathematics, Vol. 52 (2007), No. 3, 197—233.

19. Jan Cesenek † And Miloslav Feistauer: Theory of the Space-Time Discontinuous Galerkin

References

Related documents

ABSTRACT: This paper presents a system for the automatic detection of hypernasal speech signals based on the combination of two different characterization approaches applied to

The main goal of the immersion program is to enable students to construct knowledge of instructional design and learn relevant competencies and skills while working on an

We use your personal information to keep you informed about Peel Children Centre’s services and activities, as well as fundraising and volunteer opportunities. If you wish

Conclusions: In the Netherlands Perinatal Audit Registry, stillbirth occurred relatively less often antepartum and more often intrapartum in pregnancies ≥41 weeks compared

These broad ranges for flow indicate that the GA was free to find solutions that do not at all reflect historical flows (which range from ~1,000 to 2,000 m 3 /s), yet the GA

A spatio-temporal analysis was performed to identify risk factors associat- ed with child (1-4 years) mortality in the Agincourt sub-district, South Africa, to assess temporal

Neurosupport offers practical and emotional support to people with neurological conditions and to their families, friends and carers. We

While most of the works made in this domain is specific to energy management, our autonomic computing approach is generic, as it can be used to define any management