Skip to main content

A stabilized mixed discontinuous Galerkin method for the incompressible miscible displacement problem

Abstract

A new fully discrete stabilized discontinuous Galerkin method is proposed to solve the incompressible miscible displacement problem. For the pressure equation, we develop a mixed, stabilized, discontinuous Galerkin formulation. We can obtain the optimal priori estimates for both concentration and pressure.

1 Introduction

We consider the problem of miscible displacement which has considerable and practical importance in petroleum engineering. This problem can be considered as the result of advective-diffusive equation for concentrations and the Darcy flow equation. The more popular approach in application so far has been based on the mixed formulation. In a previous work, Douglas and Roberts [1] presented a mixed finite element (MFE) method for the compressible miscible displacement problem. For the Darcy flow, Masud and Hughes [2] introduced a stabilized finite element formulation in which an appropriately weighted residual of the Darcy law is added to the standard mixed formulation. Recently, discontinuous Galerkin for miscible displacement has been investigated by numerical experiments and was reported to exhibit good numerical performance [3, 4]. In Hughes-Masud-Wan [5], the method of [2] was extended to the discontinuous Galerkin framework for the Darcy flow. A family of mixed finite element discretizations of the Darcy flow equations using totally discontinuous elements was introduced in [6]. In [7] primal semi-discrete discontinuous Galerkin methods with interior penalty are proposed to solve the coupled system of flow and reactive transport in porous media, which arises from many applications including miscible displacement and acid-stimulated flow. In [8], stable Crank-Nicolson discretization was given for incompressible miscible displacement problem.

The discontinuous Galerkin (DG) method was introduced by Reed and Hill [9], and extended by Cockburn and Shu [10–12] to conservation law and system of conservation laws,respectively. Due to localizability of the discontinuous Galerkin method, it is easy to construct higher order element to obtain higher order accuracy and to derive highly parallel algorithms. Because of these advantages, the discontinuous Galerkin method has become a very active area of research [4–7, 13–18]. Most of the literature concerning discontinuous Galerkin methods can be found in [13].

In this paper, we analyze a fully discrete finite element method with the stabilized mixed discontinuous Galerkin methods for the incompressible miscible displacement problem in porous media. For the pressure equation, we develop a mixed, stabilized, discontinuous Galerkin formulation. To some extent, we develop a more general stabilized formulation and because of the proper choose of the parameters γ and β, this paper includes the methods of [2, 6] and [5]. All the schemes are stable for any combination of discontinuous discrete concentration, velocity and pressure spaces. Based on our results, we can assert that the mixed stabilized discontinuous Galerkin formulation of the incompressible miscible displacement problem is mathematically viable, and we also believe it may be practically useful. It generalizes and encompasses all the successful elements described in [2, 6] and [5]. Optimal error estimate are obtained for the concentration, velocity and pressure.

An outline of the remainder of the paper follows: In Section 2, we describe the modeling equations. The DG schemes for the concentration and some of their properties are introduced in Section 3. Stabilized mixed DG methods are introduced for the velocity and pressure in Section 4. In Section 5, we propose the numerical approximation scheme of incompressible miscible displacement problems with a fully discrete in time, combined with a mixed, stabilized and discontinuous Galerkin method. The boundedness and stability of the finite element formulation are studied in Section 6. Error estimates for the incompressible miscible displacement problem are obtained in Section 7.

Throughout the paper, we denote by C a generic positive constant that is independent of h and Δt, but might depend on the partial differential equation solution; we denote by ε a fixed positive constant that can be chosen arbitrarily small.

2 Governing equations

Miscible displacement of one incompressible fluid by another in a porous medium Ω ∈ Rd (d = 2, 3) over time interval J = (0, T] is modeled by the system concentration equation:

ϕ ∂ c ∂ t + u ⋅∇c-∇⋅ ( D ( u ) ∇ c ) =q c * , ( x , t ) ∈Ω×J.
(2.1)

Pressure equation:

u =-a ( c ) ∇p, ( x , t ) ∈Ω×J,
(2.2)
∇⋅ u =q, ( x , t ) ∈Ω×J.
(2.3)

The initial conditions

c ( x , 0 ) = c 0 ( x ) ,x∈Ω.
(2.4)

The no-flow boundary conditions

u ⋅ n = 0 , x ∈ ∂ Ω , ( D ( u ) ∇ c - c u ) ⋅ n = 0 , x ∈ ∂ Ω .
(2.5)

Dispersion/diffusion tensor

D ( u ) =Ï• d m I +| u | ( d l E ( u ) + d t ( I - E ( u ) ) ) ,
(2.6)

where the unknowns are p (the pressure in the fluid mixture), u (the Darcy velocity of the mixture, i.e., the volume of fluid flowing cross a unit across-section per unit time) and c (the concentration of the interested species, i.e., the amount of the species per unit volume of the fluid mixture). ϕ = ϕ(x) is the porosity of the medium, uniformly bounded above and below by positive numbers. The E(u) is the tensor that projects onto the u direction, whose (i,j) component is ( E ( u ) ) i j = u i u j | u | 2 ; d m is the molecular diffusivity and assumed to be strictly positive; d l and d t are the longitudinal and the transverse dispersivities, respectively, and are assumed to be nonnegative. The imposed external total flow rate q is sum of sources (injection) and sinks (extraction) and is assumed to be bounded. Concentration c* in the source term is the injected concentration c w if q ≥ 0 and is the resident concentration c if q < 0. Here, we assume that the a(c) is a globally Lipschitz continuous function of c, and is uniformly symmetric positive definite and bounded.

3 Discontinuous Galerkin method for the concentration

3.1 Notation

Let T h = (K) be a sequence of finite element partitions of Ω. Let Γ I denote the set of all interior edges, Γ B the set of the edges e on ∂ Ω, and Γ h = Γ B + Γ I . K+, K- be two adjacent elements of T h ; let x be an arbitrary point of the set e = ∂K+ ∩ ∂K-, which is assumed to have a nonzero (d - 1) dimensional measure; and let n+, n- be the corresponding outward unit normals at that point. Let (u, p) be a function smooth inside each element K± and let us denote by (u±, p±) the traces of (u, p) on e from the interior of K± . Then we define the mean values {{·}} and jumps [[·]] at x ∈ {e} as

[ u ] = u + â‹… n + + u - â‹… n - , { { u } } = 1 2 ( u + + u - ) , { { p } } = 1 2 ( p + + p - ) , [ [ p ] ] = p + n + + p - n - .

For e ∈ Γ B , the obvious definitions is {{p}} = p, [[u]] = u·n, with n denoting the outward unit normal vector on ∂ Ω. we define the set 〈K, K'〉 as

〈 K , K ′ 〉 := ⊘ if meas d - 1 ( ∂ K ∩ ∂ K ′ ) = 0 , interior of ∂ K ∩ ∂ K ′ otherwise .

For s ≥ 0, we define

H s ( T h ) = { v ∈ L 2 ( Ω ) : v | K ∈ H s ( K ) . K ∈ T h } .
(3.1)

The usual Sobolev norm on Ω is denoted by ||·||m, Ω[19]. The broken norms are defined, for a positive number m, as

∥|v∥ | m 2 = ∑ K ∈ T h ∥v ∥ m , K 2 .
(3.2)

The discontinuous finite element space is taken to be

D r ( T h ) = { v ∈ L 2 ( Ω ) : v | K ∈ P r ( K ) , K ∈ T h } ,
(3.3)

where P r (K) denotes the space of polynomials of (total) degree less than or equal to r (r ≥ 0) on K. Note that we present error estimators in this paper for the local space P r , but the results also apply to the local space Q r (the tensor product of the polynomial spaces of degree less than or equal to r in each spatial dimension) because P r (K) ⊂ Q r (K).

The cut-off operator M is defined as

M ( c ) ( x ) = min ( c ( x ) , M ) , M ( u ) ( x ) = u ( x ) if | u ( x ) | ≤ M , M u ( x ) ∕ | u ( x ) | if | u ( x ) | > M , (1)
(3.4)

where M is a large positive constant. By a straightforward argument, we can show that the cut-off operator M is uniformly Lipschitz continuous in the following sense.

Lemma 3.1[7]  (Property of operator M) The cut-off operatorMdefined as in Equation 3.4 is uniformly Lipschitz continuous with a Lipschitz constant one, that is

∥ M ( c ) - M ( w ) ∥ L ∞ ( Ω ) ≤ ∥ c - w ∥ L ∞ ( Ω ) , ∀ c ∈ L ∞ ( Ω ) , w ∈ L ∞ ( Ω ) , ∥ M ( u ) - M ( v ) ∥ ( L ∞ ( Ω ) ) d ≤ ∥ u - v ∥ ( L ∞ ( Ω ) ) d , ∀ u ∈ ( L ∞ ( Ω ) ) d , v ∈ ( L ∞ ( Ω ) ) d .

We shall also use the following inverse inequalities, which can be derived using the method in[20]. Let K ∈ T h , v ∈ P r (K) and h K is the diameter of K. Then there exists a constant C independent of v and h K , such that

∥ D q v ∥ 0 , ∂ K ≤ C h K - 1 ∕ 2 ∥ D q v ∥ K , q ≥ 0 . ∥ D q + 1 v ∥ 0 , K ≤ C h K - 1 ∥ D q v ∥ 0 , K , q ≥ 0 .
(3.5)

3.2 Discontinuous Galerkin schemes

Let ∇ h · v and ∇ h v be the functions whose restriction to each element K∈ℑ are equal to ∇ · v, ∇v, respectively. We introduce the bilinear form B(c, w; u) and the linear functional L(w; u, c)

B ( c , w ; u ) = ( D ( u ) ∇ h c , ∇ h w ) + ∫ Γ h { { D ( u ) ∇ h w } } [ [ c ] ] d s - ∫ Γ h { { D ( u ) ∇ h c } } [ [ w ] ] d s + ∫ Γ h C 11 [ [ c ] ] [ [ w ] ] d s + ( u ⋅ ∇ h c , w ) - ∫ Ω c q - w d x , L ( w ; u , c ) = ∫ Ω c w q + w d x ,

with

C 11 = c 11 max { h K + - 1 , h K - - 1 } x ∈ 〈 K + , K - 〉 , c 11 h K + - 1 x ∈ ∂ K + ∩ ∂ Ω ,
(3.6)

here c11 > 0 is a constant independent of the meshsize.

We now define the weak formulation on which our mixed discontinuous method is based

( ϕ c t , w ) +B ( c , w ; u ) =L ( w ; u , c ) ,∀w∈ H k ( T h ) .
(3.7)

Let N be a positive integer, △t= T N and t m = m Δt for m = 0, 1, ..., N. The approximation of c t at t = tn+1can be discreted by the forward difference. The DG schemes for approximating concentration are as follows. We seek c h ∈ W1,∞(0, T; Dk-1(T h )) satisfying

( ϕ c h n + 1 - c h n △ t , w h ) + B ( c h n + 1 , w h ; u M n ) = L ( w h ; u M n , c h n + 1 ) , ∀ w h ∈ W 1 , ∞ ( 0 , T ; D k - 1 ( T h ) ) ,
(3.8)

where u M n =M ( u h n ) with the DG velocity u h defined below

u h n = - a ( M ( c h n ) ) ∇ p h n , x ∈ K , K ∈ T h .

4 A stabilized mixed DG method for the velocity and pressure

4.1 Elimination for the flux variable u

Letting α(c) = a(c)-1. For the velocity and pressure, we define the following forms

a ( u , v ; c ) = ( α ( c ) u , v ) ,
(4.1)
b ( p , v ) = ( p , ∇ h ⋅ v ) - ∫ Γ I { { p } } [ [ v ] ] d s - ∫ Γ B { { v } } [ [ p ] ] d s .
(4.2)

The discrete problem for the velocity and pressure can be written as: find u h ∈ (Dl-2(T h ))d, (l ≥ 2), p h ∈ Dl-1(T h ) such as

a ( u h , v ; c ) - b ( p h , v ) = 0 , ∀ v ∈ ( D l - 2 ( T h ) ) d , b ( ψ , u h ) = ( ψ , q ) , ∀ ψ ∈ D l - 1 ( T h ) .
(4.3)

In order to eliminate the flux variable, we first recall a useful identity, that holds for vectors u and scalars ψ piecewise smooth on T h :

∑ K ∈ T h ∫ ∂ K v ⋅ n ψ d s= ∫ Γ h { { v } } ⋅ [ [ ψ ] ] d s+ ∫ Γ I [ [ v ] ] { { ψ } } d s.
(4.4)

Using (4.4) we have

∑ K ∫ K ( ∇ ⋅ u h ψ + u h ⋅ ∇ ψ ) d x= ∫ Γ h { { u h } } ⋅ [ [ ψ ] ] d s+ ∫ Γ I [ [ u h ] ] { { ψ } } d s.
(4.5)

Substituting (4.5) in the first equation of (4.3) we obtain

( α ( c ) u h + ∇ h p h , v ) - ∫ Γ I [ [ p h ] ] ⋅ { { v } } ds=0.
(4.6)

We introduce the lift operator R:L1(∪∂K) → (Dl-2(T h ))ddefined by

∫ Ω R [ [ ψ ] ] ⋅ v d x=- ∫ Γ I [ [ ψ ] ] ⋅ { { v } } d s,∀v∈ ( D l - 2 ( T h ) ) d .
(4.7)

From (4.6) and (4.7) we have

( α ( c ) u h + ∇ h p h + R [ [ p h ] ] , v ) =0.
(4.8)

We also introduce the L2-projection π onto (Dl-2(T h ))d

( π w , v ) = ( w , v ) ,∀ v ∈ ( D l - 2 ( T h ) ) d .
(4.9)

Equation 4.8 gives now

α ( c ) u h =- ( π ∇ h p h + R [ [ p h ] ] ) .
(4.10)

Noting that ∇ h Dl-1(T h ) ⊂ (Dl-2(T h ))d, we have π∇ h p h ≡ ∇ h p h for all p h ∈ Dl-1(T h ). The Equation 4.10 gives

α ( c ) u h =- ( ∇ h p h + R [ [ p h ] ] ) .
(4.11)

Using (4.5) and the lifting operator R defined in (4.7) we have

b ( ψ , u h ) = - ( u h , ∇ h ψ ) + ∫ Γ I [ [ ψ ] ] ⋅ { { u } } d s , = - ( u h , ∇ h ψ + R [ [ ψ ] ] ) .
(4.12)

Substituting (4.12) in the second equation of (4.3) and using (4.11) we have

( a ( c ) ( ∇ h p h + R [ [ p h ] ] ) , ∇ h ψ + R [ [ ψ ] ] ) = ( q , ψ ) .
(4.13)

For future reference, it is convenient to rewrite (4.13) as follows

A B R ( p h , ψ ) = ( q , ψ ) ,∀ψ∈ D l - 1 ( T h ) ,
(4.14)

where

A B R ( p h , ψ ) = ( a ( c ) ( ∇ h p h + R [ [ p h ] ] ) , ∇ h ψ + R [ [ ψ ] ] ) .
(4.15)

4.2 Stabilization of formulation (4.3)

We write first (4.3) in the equivalent form: find (u h , p h ) ∈ (Dl-2(T h ))d× Dl-1(T h ) such that

A ( u h , v ; p h , ψ ; c ) =l ( ψ ) ,∀ ( v , ψ ) ∈ ( D l - 2 ( T h ) ) d × D l - 1 ( T h ) ,
(4.16)

where

A ( u h , v ; p h , ψ ; c ) =a ( u h , v ; c ) -b ( p h , v ) +b ( ψ , u h ) ,l ( ψ ) = ( q , ψ ) .
(4.17)

In a sense, (4.16) can be seen as a Darcy problem. The usual way to stabilized it is to introduce penalty terms on the jumps of p and/or on the jumps of u. In [2], Masud and Hughes introduced a stabilized finite element formulation in which an appropriately weighted residual of the Darcy law is added to the standard mixed formulation. In Hughes-Masud-Wan [5], the method was extend within the discontinuous Galerkin framework. A family of mixed finite element discretizations of the Darcy flow equations using totally discontinuous elements was introduced in [6]. In this paper, we consider the following stabilized formulation which includes the methods of [2, 6] and [5].

The stabilized formulation of (4.16) is

A stab ( u h , v ; p h , ψ ; c ) = l stab ( ψ ) ,∀ ( v , ψ ) ∈ ( D l - 2 ( T h ) ) d × D l - 1 ( T h ) ,
(4.18)

where

A stab ( u , v ; p , ψ ; c ) = A ( u , v ; p , ψ ; c ) + γ e ( p , ψ ) + β θ u + a ( c ) ∇ h p , - α ( c ) v + δ ∇ h ψ , l stab ( ψ ) = l ( ψ ) , e ( p , ψ ) = a ( c ) ∫ Γ h C 11 [ [ p ] ] [ [ ψ ] ] d s ,
(4.19)

where γ and β are chosen as the following (i) γ = 1, β = 1. (ii) γ = 0, β = 1, δ could assume either the value +1 or the value -1. The definition of θ will be given in the following content.

5 A mixed stabilized DG method for the incompressible miscible displacement problem

By combining (3.8) with (4.18), we have the stabilized DG for the approximating (2.1)-(2.5): seek c h ∈ W1,∞(0, T; Dk-1(T h )) =: W h , p h ∈ W1,∞(0, T; Dl-1(T h )) =: Q h and u h ∈ (W1,∞(0, T; Dl-2(T h )))d=: V h satisfying

( ϕ c h n + 1 - c h n △ t , w ) + B ( c h n + 1 , w ; u M n ) = L ( w ; u M n , c h n + 1 ) , ∀ w ∈ W h , A stab ( u h n , v ; p h n , ψ ; M ( c h n ) ) = l stab ( ψ ) , ∀ ( v × ψ ) ∈ ( V h × Q h ) .
(5.1)

We define the "stability norm" by

∥ ( u , p ) ∥ stab = 1 2 ∥ | α 1 ∕ 2 ( c ) u ∥ | 0 2 + ∥ p ∥ 1 , h 2 1 ∕ 2 ,
(5.2)

where

∥ p ∥ 1 , h 2 = 1 2 ∥ a 1 ∕ 2 ( c ) ∇ h p ∥ 0 2 + ∥ a 1 ∕ 2 ( c ) [ [ p ] ] ∥ 0 , Γ h 2 , ∥ a 1 ∕ 2 ( c ) [ [ p ] ] ∥ 0 , Γ h 2 = ∫ Γ h a ( c ) C 11 [ [ p ] ] ⋅ [ [ p ] ] d s , ∥ ∇ h p ∥ 0 2 = ∑ K ∥ ∇ p ∥ 0 , K 2 .
(5.3)

6 Stability and consistency

From [6], we can state the following results.

Lemma 6.1[6]There exist two positive constants C1and C2, depending only on the minimum angle of the decomposition and on the polynomial degree

C 1 ∥R [ [ ψ ] ] ∥ 0 , Ω 2 ≤ ∑ e ∈ Γ I h e - 1 ∥ [ [ ψ ] ] ∥ 0 , e 2 ≤ C 2 ∥R [ [ ψ ] ] ∥ 0 , Ω .
(6.1)

Lemma 6.2[6]There exists two positive constants C1and C2, depending only on the minimum angle of the decomposition such that

C 1 ∥R [ [ ψ ] ] ∥ 0 , Ω 2 ≤ ∑ e ∈ Γ I h e - 1 ∥ [ [ ψ ] ] ∥ 0 , e 2 ≤ C 2 ( ∥ R [ [ ψ ] ] ∥ 0 , Ω 2 + ∥ ∇ h ψ ∥ 0 2 ) ,ψ∈ H 2 ( T h ) .
(6.2)

Lemma 6.3[6]LetHbe a Hilbert spaces, and λ and μ positive constants. Then, for every ξ and η inHwe have

λ∥ξ+η ∥ H 2 +μ∥η ∥ H 2 ≥ λ μ 2 ( λ + μ ) ( ∥ ξ ∥ H 2 + ∥ η ∥ H 2 ) .
(6.3)

Theorem 6.1 (Stability) For δ = 1, problem (4.18) is stable for all θ ∈ (0,1).

Proof Consider first the case γ = 1, β = 1. From the definition of Astab(·,·;·,·;·), we have

A stab ( u h , u h ; p h , p h ; c ) =a ( u h , u h ; c ) +e ( p h , p h ) +θ ( u h + a ( c ) ∇ h p h , - α ( c ) u h + ∇ h p h ) .
(6.4)

We remark that (6.4) can be rewritten as

A stab ( u h , u h ; p h , p h ; c ) = ( 1 - θ ) ∥| α 1 ∕ 2 ( c ) u ∥ | 0 2 +θ∥ a 1 ∕ 2 ( c ) ∇ h p ∥ 0 2 +∥ a 1 ∕ 2 ( c ) [ [ p ] ] ∥ 0 , Γ h 2 ,
(6.5)

and the stability in the norm (5.2) follows from θ= 1 2 .

Consider now the case γ = 0, β =1. Using the equivalent expressions (4.11) and (4.12) for the first and second equation of (4.3), respectively, the problem (4.18) for γ = 0 can be rewritten as: find u h ∈ (Dl-2(T h ))d, p h ∈ Dl-1(T h ) such that

( α ( c ) u h + ∇ h p h + R [ [ p h ] ] , v ) - θ ( α ( c ) u h + ∇ h p h , v ) = 0 , - ( u h , ∇ h ψ + R [ [ ψ ] ] ) + δ θ ( u h + a ( c ) ∇ h ψ , ∇ h ψ ) = ( q , ψ ) .
(6.6)

From the first equation in (6.6) and (4.9) we have

α ( c ) u h =- ( ∇ h p h + 1 1 - θ R [ [ p h ] ] ) .
(6.7)

Substituting the expression (6.7) in the second equation of (6.6) for δ = 1, we have

A B R ( p h , ψ ) + θ 1 - θ ∫ Ω a ( c ) R [ [ p h ] ] ⋅R [ [ ψ ] ] d x= ( q , ψ ) ,∀ψ∈ D l - 1 ( T h ) .
(6.8)

Denote by B 1h (·,·) the bilinear form (6.8), we have

B 1 h ( ψ , ψ ) =∥a ( c ) ( ∇ h ψ + R [ [ ψ ] ] ) ∥ 0 , Ω + θ 1 - θ ∥a ( c ) 1 ∕ 2 R [ [ ψ ] ] ∥ 0 , Ω 2 ,
(6.9)

and the stability in the norm (5.3) follows from Lemma 6.1. This completes the proof.   â–¡

Theorem 6.2 For δ = -1, problem (4.18) is stable for all θ < 0.

Proof Consider first the case γ = 1, β = 1. The problem (4.18) for δ = -1 reads

A stab ( u h , u h ; p h , p h ; c ) = a ( u h , u h ; c ) + θ ( u h + a ( c ) ∇ h p h , - α ( c ) u h - ∇ h p h ) + e ( p h , p h ) .
(6.10)

Using the arithmetic-geometric mean inequality, we have

A stab ( u h , u h ; p h , p h ; c ) ≥ ( 1 - 2 θ ) ∥ | α 1 ∕ 2 ( c ) u ∥ | 0 2 - 2 θ ∥ a 1 ∕ 2 ( c ) ∇ h p ∥ 0 2 + ∥ a 1 ∕ 2 ( c ) [ [ p ] ] ∥ 0 , Γ h 2 ,
(6.11)

and since θ < 0 the result follows.

Consider now the case γ = 0, β = 1. From (6.7) the second equation of (6.6) for δ = -1 can be written as

A B R ( p h , ψ ) + 2 θ 1 - θ ( R [ [ p h ] ] , a ( c ) ∇ h ψ ) + θ 1 - θ ∫ Ω a ( c ) R [ [ p h ] ] ⋅R [ [ ψ ] ] d x= ( q , ψ ) .
(6.12)

We remark that formulation (6.12) can be rewritten as

1 1 - θ A B R ( p h , ψ ) - θ 1 - θ A B O ( p h , ψ ) = ( q , ψ ) ,
(6.13)

where A BO (p h , ψ) is introduced by Baumann and Oden [14], and given by

A B O ( p h , ψ ) := ∫ Ω a ( c ) ( ∇ h p h - R [ [ p h ] ] ) ⋅ ( ∇ h ψ + R [ [ ψ ] ] ) d x+ ∫ Ω a ( c ) R [ [ p h ] ] ⋅R [ [ ψ ] ] d x.
(6.14)

Denote by B2h(·,·) the bilinear form (6.13), we have

B 2 h ( ψ , ψ ) = 1 1 - θ ∥ a 1 ∕ 2 ( c ) ( ∇ h ψ + R [ [ ψ ] ] ) ∥ 0 , Ω - θ 1 - θ ∥ a 1 ∕ 2 ( c ) ∇ h ψ ∥ 0 , Ω 2 ,
(6.15)

and since θ < 0 the result follows again from Lemma 6.3 and 6.1.   â–¡

Theorem 6.3 (Consistency) If p,c and u are the solution of (2.1)-(2.5) and are essentially bounded, then

( ϕ c t , w ) + B ( c , w ; u ) = L ( w ; u , c ) , ∀ w ∈ L 2 ( 0 , T ; H k ( T h ) ) A stab ( u , v ; p , ψ ; c ) = l stab ( ψ ) , ∀ ( v × ψ ) ∈ ( ( L 2 ( 0 , T ; H l - 1 ( T h ) ) ) d × L 2 ( 0 , T ; H l ( T h ) ) )
(6.16)

provided that the constant M for the cut-off operator is sufficiently large.

To summarize, for all the bilinear forms in (6.4), (6.10), (6.8) or (6.13) we have: ∃C > 0 such that

B 1 h ( ψ , ψ ) ≥C∥ψ ∥ 1 , h 2 , B 2 h ( ψ , ψ ) ≥C∥ψ ∥ 1 , h 2 ,∀ψ∈ D l - 1 ( T h ) ,
(6.17)

and ∃C > 0 such that

A ( v , v ; ψ , ψ ; c ) stab ≥C∥ ( v , ψ ) ∥ stab 2 ,∀ ( v , ψ ) ∈ ( D l - 2 ( T h ) ) d × D l - 1 ( T h ) ,
(6.18)

where (6.17) clearly holds for every θ ∈ (0,1) for the case ((6.4), (6.8)), and for every θ < 0 for the case ((6.10), (6.13)). On the other hand, since ∇ h Dl-1(T h ) ⊂ (Dl-2(T h ))dholds, boundedness of the bilinear form in (6.8) and (6.13) follows directly from the boundedness of the bilinear forms ABR and ABO, as proved in [13], thanks to the equivalence of the norms (6.1) and (6.2). Thus, we have: ∃C > 0 such that

B 1 h ( p h , ψ ) ≤ C ∥ p h ∥ 1 , h ∥ ψ ∥ 1 , h , B 2 h ( p h , ψ ) ≤ C ∥ p h ∥ 1 , h ∥ ψ ∥ 1 , h , ∀ p h , ψ ∈ D l - 1 ( T h ) .
(6.19)

7 Error estimates

Let ( u ̃ , p ̃ , c ̃ ) be an interpolation of the exact solution (u, p, c) such that

a ( u ̃ , v ; c ) - b ( p ̃ , v ) = 0 , ∀ v ∈ ( D l - 2 ( T h ) ) d , b ( ψ , ũ ) + e ( p ̃ , ψ ) = ( q , ψ ) , ∀ ψ ∈ D l - 1 ( T h ) , ( c ̃ - c , w ) = 0 , ∀ w ∈ D k - 1 ( T h ) .
(7.1)

Let us define interpolation errors, finite element solution errors and auxiliary errors

ξ 1 = u ̃ - u h , ξ 2 = u ̃ - u , e u = u - u h = ξ 1 - ξ 2 ; η 1 = p ̃ - p h , η 2 = p ̃ - p , e p = p - p h = η 1 - η 2 ; τ 1 = c ̃ - c h , τ 2 = c ̃ - c , e c = c - c h = τ 1 - τ 2 .

It was proven in [18] that

∥| α 1 ∕ 2 ( c ) ξ 2 | ∥ 0 2 +∥ a 1 ∕ 2 ( c ) [ [ η 2 ] ] ∥ 0 , Γ h 2 ≤C h 2 l - 2 ( ∥ u ∥ l - 1 2 + ∥ p ∥ l 2 ) .
(7.2)

hold for all t ∈ J with the constant C independent only on bounds for the coefficient α(c), but not on c itself.

Theorem 7.1 (Error estimate for the velocity and pressure) Let ( u, p, c) be the solution to (2.1)-(2.5), and assume p ∈ L2(0, T; Hl (T h )), u ∈ (L2(0, T; Hl-1(T h ))) d and c ∈ L2(0, T; Hk (T h )). We further assume that p, ∇p, c and ∇c are essentially bounded. If the constant M for the cut-off operator is sufficiently large, then there exists a constant C independent of h such that

∥ ( u - u h , p - p h ) ∥ stab 2 ( t ) ≤C ( ∥ c - c h ∥ 0 2 ( t ) + h 2 l - 2 ) .
(7.3)

Proof For the sake of brevity we will assume θ= 1 2 ,δ=1 in the following content. Consider the case γ = 1, β = 1. From the second equation of (5.1) and (6.16) we have

( α ( c ) u - α ( M ( c h ) ) u h , v ) - b ( p - p h , ψ ) + b ( ψ , u - u h ) + e ( p - p h , ψ ) - 1 2 ( u h + a ( M ( c h ) ) ∇ h p h ) , - α ( M ( c h ) ) v + ∇ h ψ ) + 1 2 ( u + a ( c ) ∇ h p , - α ( c ) v + ∇ h ψ ) = 0 .
(7.4)

That is

( α ( c ) ( u - u ̃ ) , v ) + ( α ( M ( c h ) ) ( u ̃ - u h ) , v ) + ( ( α ( c ) - α ( M ( c h ) ) ) u ̃ , v ) - b ( p - p h , v ) + b ( ψ , u - u h ) + e ( p - p h , ψ ) + 1 2 ( α ( M ( c h ) ) u h - α ( c ) u , v ) + 1 2 ( u - u h , ∇ h ψ ) - 1 2 ( ∇ h p - ∇ h p h , v ) + 1 2 ( a ( c ) ∇ h p - a ( M ( c h ) ) ∇ h p h , ∇ h ψ ) = 0 .

Choosing v = ξ1, ψ = η1 and splitting e p according e p = η1- η2, from (7.1) and we obtain

1 2 ( α ( M ( c h ) ) ξ 1 , ξ 1 ) + e ( η 1 , η 1 ) + 1 2 ( a ( M ( c h ) ) ∇ h η 1 , ∇ h η 1 ) = 1 2 ( ( α ( M ( c h ) ) - α ( c ) ) u ̃ , ξ 1 ) - 1 2 ( α ( c ) ξ 2 , ξ 1 ) + 1 2 ( a ( c ) ∇ h η 2 , ∇ h η 1 ) - 1 2 ( ( a ( c ) - a ( M ( c h ) ) ) ∇ h p ̃ , ∇ h η 1 ) + 1 2 ( ξ 2 , ∇ h η 1 ) - 1 2 ( ∇ h η 2 , ξ 1 ) .
(7.5)

Let us first consider the left side of error equation (7.5)

1 2 ( α ( M ( c h ) ) ξ 1 , ξ 1 ) + e ( η 1 , η 1 ) + 1 2 ( a ( M ( c h ) ) ∇ h η 1 , ∇ h η 1 ) = 1 2 ( ∥ | α 1 ∕ 2 ( M ( c h ) ) ξ 1 | ∥ 0 2 + ∥ a 1 ∕ 2 ( M ( c h ) ) ∇ h η 1 ∥ 0 2 ) + ∥ [ [ η 1 ] ] ∥ 0 , Γ h 2 .

We know that (7.2) and quasi-regularity that ∇ h p ̃ , u ̃ are bounded in L∞(Ω). So the right side of the error equation (7.5) can be bounded from below. Noting that |α ( M ( c h ) ) -α ( c ) |≤C| c h -c|, we have

| ( α ( M ( c h ) ) - α ( c ) ) u ̃ , ξ 1 ) |≤C∥c- c h ∥ 0 2 +ε∥| ξ 1 | ∥ 0 2 .
(7.6)

The second and the third terms of the right side of the error equation (7.5) can be bounded using Cauchy-Schwartz inequality and approximation results,

| ( α ( c ) ξ 2 , ξ 1 ) | ≤ ∥ α ( c ) ∥ 0 , ∞ ∥ ξ 2 ∥ 0 ∥ ξ 1 ∥ 0 ≤ ε ∥ | ξ 1 | ∥ 0 2 + C h 2 l - 2 ,
(7.7)
| ( a ( c ) ∇ h η 2 , ∇ h η 1 ) | ≤ ε ∥ ∇ h η 1 ∥ 0 2 + C h 2 l - 2 .
(7.8)

The fourth term can be bounded in a similar way as that for the first term

| ( a ( c ) - a ( M ( c h ) ) ∇ h p ̃ , ∇ h η 1 ) |≤C∥c- c h ∥ 0 2 +ε∥ ∇ h η 1 ∥ 0 2 .
(7.9)

The last two terms can be bounded as follows

( ξ 2 , ∇ h η 1 ) ≤ε∥ ∇ h η 1 ∥ 0 2 +C h 2 l - 2 , ( ∇ h η 2 , ξ 1 ) ≤ε∥| ξ 1 ∥ | 0 2 +C h 2 l - 2 .
(7.10)

Substituting all these inequalities into Equation 7.5, we have

1 2 ( ∥ | α 1 ∕ 2 ( M ( c h ) ) ξ 1 | ∥ 0 2 + ∥ a 1 ∕ 2 ( M ( c h ) ) ∇ h η 1 ∥ 0 2 ) + ∥ a 1 ∕ 2 ( c ) [ [ η 1 ] ] ∥ 0 , Γ h 2 ≤ ε ( ∥ | ξ 1 ∥ | 0 2 + ∥ ∇ h η 1 ∥ 0 2 ) + C ( ∥ c - c h ∥ 0 2 + h 2 l - 2 ) .
(7.11)

Using the facts 1 C I ≤α ( M ( c h ) ) ≤C I , 1 C I ≤α ( c ) ≤C I , and 1 C I ≤a ( M ( c h ) ) ≤C I , 1 C I ≤a ( c ) ≤C I we have

∥ ( ξ 1 , η 1 ) ∥ s t a b 2 ≤C ( ∥ c - c h ∥ 0 2 + h 2 l - 2 ) .
(7.12)

The theorem follows from the triangle inequality.

Now consider the case γ = 0, β = 1. The bilinear form (6.8) from the second equation of (5.1) for θ= 1 2 reads

A B R ( p h , ψ ; c h ) + ∫ Ω a ( M ( c h ) ) R [ [ p h ] ] ⋅ R [ [ ψ ] ] d x = ( q , ψ ) ,
(7.13)

where

A B R ( p h , ψ ; c h ) = ( a ( M ( c h ) ) ( ∇ h p h + R [ [ p h ] ] ) , ∇ h ψ + R [ [ ψ ] ] ) .

Replacing (6.8) with p h = p and subtracting it from (7.13) we finally obtain

a ( c ) ( ∇ h p , ∇ h ψ + R [ [ ψ ] ] ) - A B R ( p h , ψ ; c h ) =0.
(7.14)

Choosing ψ = η1, we have

A B R ( η 1 , η 1 ; c h ) + ∫ Ω a ( M ( c h ) ) R [ [ η 1 ] ] ⋅ R [ [ η 1 ] ] d x = A B R ( η 2 , η 1 ) + ∫ Ω a ( c ) R [ [ η 2 ] ] ⋅ R [ [ η 1 ] ] d x + ( a ( M ( c h ) ) - a ( c ) ) ( ( ∇ h p ̃ + R [ [ p ̃ ] ] , ∇ h η 1 + R [ [ η 1 ] ] ) + ∫ Ω a ( c ) R [ [ p ̃ ] ] ⋅ R [ [ η 1 ] ] d x ) .
(7.15)

Let us first estimate the left side of (7.15). From (6.17) and using the fact 1 C I ≤a ( M ( c h ) ) ≤C I , 1 C I ≤a ( c ) ≤C I , we have

A B R ( η 1 , η 1 ; c h ) + ∫ Ω a ( M ( c h ) ) R [ [ η 1 ] ] ⋅R [ [ η 1 ] ] d x≥C∥η ∥ 1 , h 2 .
(7.16)

The first and the second terms of the right side of (7.15) can be bounded using Lemma 6.1 and (3.5)

A B R ( η 2 , η 1 ) + ∫ Ω a ( c ) R [ [ η 2 ] ] ⋅ R [ [ η 1 ] ] d x ≤ C ∥ η 2 ∥ 1 , h ∥ η 1 ∥ 1 , h , ≤ ε ∥ η 1 ∥ 1 , h 2 + C h 2 l - 2 .
(7.17)

Note that ∇ h p ̃ , p ̃ are bounded in L∞(Ω) and |a ( M ( c h ) ) -a ( c ) |≤C∥ c h -c∥, we have

( a ( M ( c h ) ) - a ( c ) ) ( ∇ h p ̃ + R [ [ p ̃ ] ] , ∇ h η 1 + R [ [ η 1 ] ] ) + ∫ Ω a ( c ) R [ [ p ̃ ] ] ⋅ R [ [ η 1 ] ] d x ≤ C ∥ c - c h ∥ 0 ∥ η 1 ∥ 1 , h ≤ C ∥ c - c h ∥ 0 2 + ε ∥ η 1 ∥ 1 , h 2 .
(7.18)

Substituting all these inequalities into the (7.15) and using the triangle inequality we have

∥p- p h ∥ 1 , h 2 ≤C ( ∥ c - c h ∥ 0 2 + h 2 l - 2 ) .
(7.19)

We easily deduce,using (7.19)

∥| α 1 ∕ 2 ( c ) ( u - u h ) | ∥ 0 2 ≤C∥p- p h ∥ 1 , h 2 ≤C ( ∥ c - c h ∥ 0 2 + h 2 l - 2 ) ,
(7.20)

which completes the proof.   â–¡.

From [7], we state two lemmas for the properties of the dispersion-diffusion tensor, which will be used to prove error estimates for the concentration.

Lemma 7.1[7] (Uniform positive definiteness of D(u)) Let D(u) defined as in Equation 2.6, where ϕd m (x) ≥ 0, d l (x) ≥ 0 and d t (x) ≥ 0 are non-negative functions of x ∈ Ω. Then

D ( u ) ∇ h c⋅ ∇ h c≥ ( ϕ d m + min ( d l , d t ) | u | ) | ∇ h c | 2 .
(7.21)

If, in addition, φd m (x) ≥ dm,*> 0 uniformly in the domain Ω, then D(u) is uniformly positive definite in Ω:

D ( u ) ∇ h c⋅ ∇ h c≥ d m , * | ∇ h c | 2 .
(7.22)

Lemma 7.2[7] (Uniform Lipschitz continuity of D(u)) Let D(u) defined as in Equation 2.6, where d m (x) ≥ 0, d l (x) ≥ 0 and d t (x) ≥ 0 are non-negative functions of x ∈ Ω, and the dispersivities d l and d t is uniformly bounded, i.e., d l (x) ≤ d l *and d t (x) ≤ d t *. Then

∥ D ( u ) - D ( v ) ∥ ( L 2 ( Ω ) ) d × d ≤ k D ∥ u - v ∥ ( L 2 ( Ω ) ) d .
(7.23)

where k D = ( 7 d t * + 6 d l * ) d 3 ∕ 2 is a fixed number (d = 2 or 3 is the dimension of domain Ω).

Theorem 7.2 (Error estimate for concentration) Let ( u, p, c) be the solution to (2.1)-(2.5), and assume p ∈ L2(0, T; Hl (T h )), u ∈ (L2(0, T; Hl-1(T h ))) d and c ∈ L2(0, T; Hk (T h )). We further assume that p, ∇p, c and ∇c are essentially bounded. If the constant M for the cut-off operator is sufficiently large, then there exists a constant C independent of h and Δt such that

∥ ϕ ( c - c h ) ∥ L ∞ ( 0 , T ; L 2 ( Ω ) ) + ( ∑ i = 1 N △ t ( ∥ | D 1 ∕ 2 ( u i - 1 ) ∇ h ( c i - c h i ) | ∥ 0 2 + ∥ [ [ c i - c h i ] ] ∥ 0 , Γ h 2 ) ) 1 ∕ 2 ≤ C ( △ t + h k - 1 + h l - 1 ) .
(7.24)

Proof The first equation of (5.1) is

( Ï• c h n + 1 - c h n â–³ t , w ) +B ( c h n + 1 , w ; u M n ) =L ( w ; u M n , c h n + 1 ) .

It can be written as

( Ï• Ï„ 2 n + 1 - Ï„ 2 n â–³ t , w ) - ( Ï• Ï„ 1 n + 1 - Ï„ 1 n â–³ t , w ) + ( Ï• c n + 1 - c n â–³ t , w ) +B ( c h n + 1 , w ; u M n ) =L ( w ; u M n , c h n + 1 ) .

Subtracting the DG scheme equation from the weak formulation, we have for any w ∈ Dk-1(T h )

( Ï• c t , w ) - Ï• Ï„ 2 n + 1 - Ï„ 2 n â–³ t , w + Ï• Ï„ 1 n + 1 - Ï„ 1 n â–³ t , w - Ï• c n + 1 - c n â–³ t , w - B ( c h n + 1 , w ; u M n ) + B ( c n + 1 , w ; u n ) = L ( w ; u n , c n + 1 ) - L ( w ; u M n , c h n + 1 ) .

that is

( Ï• c t , w ) + Ï• Ï„ 1 n + 1 - Ï„ 1 n â–³ t , w + B ( Ï„ 1 n + 1 , w ; u M n ) = Ï• Ï„ 2 n + 1 - Ï„ 2 n â–³ t , w + Ï• c n + 1 - c n â–³ t , w + B ( Ï„ 2 n + 1 , w ; u M n ) + B ( c n + 1 , w ; u M n ) - B ( c n + 1 , w ; u n ) + L ( w ; u n , c n + 1 ) - L ( w ; u M n , c h n + 1 ) .

Choosing w = Ï„1n+1, we obtain

Ï• Ï„ 1 n + 1 - Ï„ 1 n â–³ t , Ï„ 1 n + 1 + B ( Ï„ 1 n + 1 , Ï„ 1 n + 1 ; u M n ) = Ï• c n + 1 - c n â–³ t , Ï„ 1 n + 1 - ( Ï• c t , Ï„ 1 n + 1 ) + Ï• Ï„ 2 n + 1 - Ï„ 2 n â–³ t , Ï„ 1 n + 1 + B ( Ï„ 2 n + 1 , Ï„ 1 n + 1 ; u M n ) + B ( c n + 1 , Ï„ 1 n + 1 ; u M n ) - B ( c n + 1 , Ï„ 1 n + 1 ; u n ) + L ( Ï„ 1 n + 1 ; u n , c n + 1 ) - L ( Ï„ 1 n + 1 ; u M n , c h n + 1 ) .
(7.25)

Let us first consider the left side of the error equation (7.25). The first term can be bounded as

ϕ τ 1 n + 1 - τ 1 n △ t , τ 1 n + 1 ≥ ϕ 2 △ t ( ( τ 1 n + 1 , τ 1 n + 1 ) - ( τ 1 n , τ 1 n ) ) .
(7.26)

The second term of Equation 7.25 is

B ( τ 1 n + 1 , τ 1 n + 1 ; u M n ) = ( D ( u M n ) ∇ h τ 1 n + 1 , ∇ h τ 1 n + 1 ) + ( u M n ⋅ ∇ h τ 1 n + 1 , τ 1 n + 1 ) - ∫ Ω q - ( τ 1 n + 1 ) 2 d x + ∫ Γ h C 11 [ [ τ 1 n + 1 ] ] [ [ τ 1 n + 1 ] ] d s .

The second term of B(·,·;·) can be estimated using the boundedness of u M and 1 C D ( u ) ≤D ( u M ) ≤C D ( u ) :

( u M n ⋅ ∇ h τ 1 n + 1 , τ 1 n + 1 ) ≤ε∥| D 1 ∕ 2 ( u n ) ∇ h τ 1 n + 1 | ∥ 0 2 +C∥ ϕ τ 1 n + 1 ∥ 0 2 .
(7.27)

Thus

ϕ τ 1 n + 1 - τ 1 n △ t , τ 1 n + 1 + B ( τ 1 n + 1 , τ 1 n + 1 ; u M n ) ≥ ϕ 2 △ t ( ∥ τ 1 n + 1 ∥ 0 2 - ∥ τ 1 n ∥ 0 2 ) + ∥ | D 1 ∕ 2 ( u n ) ∇ h τ 1 n + 1 ∥ | 0 2 + ∥ [ [ τ 1 n + 1 ] ] ∥ 0 , Γ h 2 - C ∥ ϕ τ 1 n + 1 ∥ 0 2 .
(7.28)

Let us bound the right side of the error equation (7.25).

L ( τ 1 n + 1 ; u n , c n + 1 ) -L ( τ 1 n + 1 ; u M n , c h n + 1 ) ≤C∥ ϕ τ 1 n + 1 ∥ 0 2 .
(7.29)

Using Taylor series expansion, we have

ϕ c n + 1 - c n △ t , τ 1 n + 1 - ( ϕ c t , τ 1 n + 1 ) ≤ ϕ 2 △t∥ D t 2 c ∥ L 2 ( t k , t k + 1 ; L 2 ( Ω ) ) +C∥ ϕ τ 1 n + 1 ∥ 0 2 .
(7.30)

The fourth term in the right side of the error equation (7.25) is

B ( τ 2 n + 1 , τ 1 n + 1 ; u M n ) = ( D ( u M n ) ∇ h τ 2 n + 1 , ∇ h τ 1 n + 1 ) + ( u M n ⋅ ∇ h τ 2 n + 1 , τ 1 n + 1 ) - ( q - τ 2 n + 1 , τ 1 n + 1 ) + ∫ Γ h { { D ( u M n ) ∇ h τ 1 n + 1 } } [ [ τ 2 n + 1 ] ] d s - ∫ Γ h { { D ( u M n ) ∇ h τ 2 n + 1 } } [ [ τ 1 n + 1 ] ] d s + ∫ Γ h C 11 [ [ τ 1 n + 1 ] ] [ [ τ 2 n + 1 ] ] d s = : ∑ i = 1 6 T i .

Terms T1 through T3 can be bounded by using Cauchy-Schwartz inequality and approximation results,

| T 1 | ≤ ε ∥ | D 1 ∕ 2 ( u n ) ∇ h τ 1 n + 1 ∥ | 0 2 + C ∥ ∇ h ( c n + 1 - c ̃ n + 1 ) ∥ 0 2 , ≤ ε ∥ | D 1 ∕ 2 ( u n ) ∇ h τ 1 n + 1 ∥ | 0 2 + C h 2 k - 2 ,
(7.31)

and

| T 2 | ≤ ε ∥ | D 1 ∕ 2 ( u n ) ∇ h τ 1 n + 1 ∥ | 0 2 + C h 2 k - 2 , | T 3 | ≤ C ( ∥ ϕ τ 1 n + 1 ∥ 0 2 + h 2 k ) .
(7.32)

Terms T4 and T5 can be estimated using inverse inequalities,

| T 4 | ≤ ε h ∑ K ∈ Γ h ∥ | D 1 ∕ 2 ( u n ) ∇ h τ 1 n + 1 ∥ | 0 , ∂ K + C h ∑ K ∈ Γ h ∥ τ 2 n + 1 ∥ 0 , ∂ K 2 , ≤ ε ∥ | D 1 ∕ 2 ( u n ) ∇ h τ 1 n + 1 ∥ | 0 2 + C h 2 k - 2 ,
(7.33)

and

| T 5 | ≤ ε ∥ [ [ τ 1 n + 1 ] ] ∥ 0 , Γ h 2 + C h ∑ K ∈ Γ h ∥ τ 2 n + 1 ∥ 0 , ∂ K 2 , ≤ ε ∥ [ [ τ 1 n + 1 ] ] ∥ 0 , Γ h 2 + C h 2 k - 2 .
(7.34)

Using Cauchy-Schwartz inequality and the trace inequality, we have

| T 6 |≤ε∥ [ [ τ 1 n + 1 ] ] ∥ 0 , Γ h 2 + C h ∑ K ∈ Γ h ∥ τ 2 n + 1 ∥ 0 , ∂ K 2 ≤ε∥ [ [ τ 1 n + 1 ] ] ∥ 0 , Γ h 2 +C h 2 k - 2 .
(7.35)

Noting that [[cn+1]] = 0, if the constant M for the cut-off operator is sufficiently large, we write the last two terms in the right side of the error equation (7.25) as

B ( c n + 1 , τ 1 n + 1 ; u M n ) - B ( c n + 1 , τ 1 n + 1 ; u n ) = ( ( D ( u M n ) - D ( u n ) ) ∇ h c n + 1 , ∇ h τ 1 n + 1 ) + ( ( u M n - u n ) ⋅ ∇ h c n + 1 , τ 1 n + 1 ) - ∫ Γ h { { ( D ( u M n ) - D ( u n ) ) ∇ h c n + 1 } } [ [ τ 1 n + 1 ] ] d s = : ∑ i = 1 3 S i .

Noting that | u n - u M n |=| u n - u h n | point-wise if the constant M for the cut-off operator is sufficiently large, we can bound term S1 as

| S 1 | ≤ ε ∥ | D 1 ∕ 2 ( u n ) ∇ h τ 1 n + 1 ∥ | 0 2 + C ∥ D ( u n ) - D ( u M n ) ∥ 0 2 , ≤ ε ∥ | D 1 ∕ 2 ( u n ) ∇ h τ 1 n + 1 ∥ | 0 2 + C ∥ u n - u M n ∥ 0 2 , ≤ ε ∥ | D 1 ∕ 2 ( u n ) ∇ h τ 1 n + 1 ∥ | 0 2 + C ∥ u n - u h n ∥ 0 2 .
(7.36)

Term S2 can be bounded in a similar way as that for S1

| S 2 |≤ε∥ ϕ τ 1 n + 1 ∥ 0 2 +C∥ u n - u h n ∥ 0 2 .
(7.37)

Term S3 can be bounded using the penalty term and continuity of dispersion-diffusion tensor

| S 3 | ≤ ε ∫ Γ h C 11 [ [ τ 1 n + 1 ] ] 2 d s + ∥ D ( u n ) - D ( u M n ) ∥ 0 2 , ≤ ε ∥ [ [ τ 1 n + 1 ] ] ∥ 0 , Γ h 2 + C ∥ u n - u h n ∥ 0 2 .
(7.38)

Combining all the terms in (7.25), we have

1 2 △ t ( ∥ ϕ τ 1 n + 1 ∥ 0 2 - ∥ ϕ τ 1 n ∥ 0 2 ) + 1 2 ( ∥ | D 1 ∕ 2 ( u n ) ∇ h τ 1 n + 1 ∥ | 0 2 + ∥ [ [ τ 1 n + 1 ] ] ∥ 0 , Γ h 2 ) ≤ C ( ∥ ϕ τ 1 n + 1 ∥ 0 2 + ϕ 2 △ t ∥ D t 2 c ∥ L 2 ( t k , t k + 1 ; L 2 ( Ω ) ) 2 + △ t ∥ ∂ t τ 2 ∥ L 2 ( t k , t k + 1 ; L 2 ( Ω ) ) 2 ) + C ( h 2 k - 2 + ∥ u n - u h n ∥ 0 2 ) .

Suppose that m is an integer, 0 ≤ m ≤ N - 1. Multiplying by 2Δt, summing from n = 0 to n = m, we obtain

∥ ϕ τ 1 n + 1 ∥ 0 2 + △ t ∑ n = 1 m + 1 ( ∥ | D 1 ∕ 2 ( u n ) ∇ h τ 1 n + 1 ∥ | 0 2 + ∥ [ [ τ 1 n + 1 ] ] ∥ 0 , Γ h 2 ) ≤ C △ t ( ∑ n = 1 m ∥ τ 1 n ∥ 0 2 + ∑ n = 0 m ∥ e u ∥ 0 2 ) + C ( △ t 2 ∥ D t 2 c ∥ L 2 ( t k , t k + 1 ; L 2 ( Ω ) ) 2 + ∥ ∂ t τ 2 ∥ L 2 ( t k , t k + 1 ; L 2 ( Ω ) ) 2 ) .

The theorem follow from (7.3), the discrete Gronwall's lemma and the triangle inequality.    â–¡

Theorem 7.3 (Error estimate for flow in coupled system) Let ( u, p, c) be the solution to (2.1)-(2.5), and assume p ∈ L2(0, T; Hl (T h )), u ∈ (L2(0, T; Hl-1(T h ))) d and c ∈ L2(0, T; Hk (T h )). We further assume that p, ∇p, c and ∇c are essentially bounded. If the constant M for the cut-off operator is sufficiently large, then there exists a constant C independent of h and Δt such that

max 0 ≤ t ≤ T ∥ ( u - u h , p - p h ) ∥ s t a b ( t ) ≤ C ( Δ t + h k - 1 + h l - 1 ) .
(7.39)

Proof Taking L∞ norm with time in (7.3), we have

max 0 ≤ t ≤ T ∥ ( u - u h , p - p h ) ∥ s t a b 2 ( t ) ≤ C ( ∥ c - c h ∥ L ∞ ( 0 , T ; L 2 ) 2 + h 2 l - 2 ) .
(7.40)

Substituting (7.24) into the above inequality, we obtain (7.39).    â–¡

Acknowledgments

The work was supported by National Natural Science Foundation of China (Grant Nos.11101069, Grant Nos.11126105)and the Youth Research Foundation of Sichuan University (no. 2009SCU11113).

References

  1. Douglas J Jr, Roberts JE: Numerical methods for a model for compressible miscible displacement in porous media. Math Comp 1983, 41: 441-459. 10.1090/S0025-5718-1983-0717695-3

    Article  MathSciNet  Google Scholar 

  2. Masud A, Hughes TJR: A stabilized mixed finite element method for Darcy flow. Comput Methods Appl Mech Eng 2002, 191: 4341-4370. 10.1016/S0045-7825(02)00371-7

    Article  MathSciNet  Google Scholar 

  3. Bartels S, Jensen M, Müller R: Discontinuous Galerkin finite element convergence for incompressible miscible displacement problem of low regularity. SIAM J Numer Anal 2009, 47: 3720-3743. 10.1137/070712079

    Article  MathSciNet  Google Scholar 

  4. Rivière B: Discontinuous Galerkin finite element methods for solving the miscible displacement problem in porous media. Ph.D. Thesis, The University of Texas at Austin; 2000.

    Google Scholar 

  5. Hughes TJR, Franca LP, Balestra M: A stabilized mixed discontinuous Galerkin method for Darcy flow. Comput Methods Appl Mech Eng 2006, 195: 3347-3381. 10.1016/j.cma.2005.06.018

    Article  Google Scholar 

  6. Brezzi F, Hughes TJR, Marini LD, Masud A: Mixed discontinuous Galerkin methods for Darcy flow. J Sci Comput 2005, 22: 119-145. 10.1007/s10915-004-4150-8

    Article  MathSciNet  Google Scholar 

  7. Sun S, Wheeler MF: Discontinuous Galerkin methods for coupled flow and reactive transport problems. Appl Numer Math 2005, 52: 273-298. 10.1016/j.apnum.2004.08.035

    Article  MathSciNet  Google Scholar 

  8. Jensen M, Müller R: Stable Crank-Nicolson discretisation for incompressible miscible displacement problem of low regularity. Numer Math Adv Appl 2009, 469-471.

    Google Scholar 

  9. Reed WH, Hill TR: Triangular mesh methods for the neutron transport equation. Technical Report LA-UR-73-479, Los Alamos Scientific Laboratory; 1973.

    Google Scholar 

  10. Cockburn B, Shu CW: TVB Runge-Kutta local projection discontinuous Galerkin finite element method for conservation laws: General framework. Math Comput 1989, 52: 411-435.

    MathSciNet  Google Scholar 

  11. Cockburn B, Lin SY: TVB Runge-Kutta local projection discontinuous Galerkin finite element method for conservation laws: One-dimensional systems. J Comput Phys 1989, 84: 90-113. 10.1016/0021-9991(89)90183-6

    Article  MathSciNet  Google Scholar 

  12. Cockburn B, Shu CW: TVB Runge-Kutta discontinuous Galerkin methods for conservation laws V: Multidimensional systems. J Comput Phys 1998, 144: 199-224.

    Article  MathSciNet  Google Scholar 

  13. Arnold D, Brezzi F, Cockburn B, Marini D: Unified analysis of discontinuous Galerkin methods for elliptic problem. SIAM J Numer Anal 2002, 39: 1749-1779. 10.1137/S0036142901384162

    Article  MathSciNet  Google Scholar 

  14. Baumann CE, Oden JT: A discontinuous hp finite element method for convection-diffusion problems. Comput Methods Appl Mech Eng 1999, 175: 311-341. 10.1016/S0045-7825(98)00359-4

    Article  MathSciNet  Google Scholar 

  15. Luo Y, Feng M: Discontinuous finite element methods for the Stokes equations. Chin J Numer Math and Appl 2006, 28: 163-174.

    MathSciNet  Google Scholar 

  16. Luo Y, Feng M: A discontinuous element pressure gradient stabilization for the Stokes equations based on local projection. Chin J Numer Math and Appl 2008, 30: 25-36.

    Article  MathSciNet  Google Scholar 

  17. Luo Y, Feng M: Discontinuous element pressure gradient stabilizations for compressible Navier-Stokes equations based on local projections. Appl Math Mech 2008, 29: 171-183. 10.1007/s10483-008-0205-z

    Article  MathSciNet  Google Scholar 

  18. Sun S, Rivière B, Wheeler MF: A combined mixed element and discontinuous Galerkin method for miscible displacement problem in porous media. Proceedings of the International Conference on Recent Progress in Computational and Applied PDEs, Zhangjiaje 2001, 321-348.

    Google Scholar 

  19. Adams RA: Sobolev Spaces. Academic Press, San Diego, CA; 1975.

    Google Scholar 

  20. Schwab Ch: p -and hp -Finite Element Methods, Theory and Applications in Solid and Fluid Mechanics. Oxford Science Publications, Oxford; 1998.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Youcai Xu.

Additional information

Competing interests

The authors declare that they have no competing interests.

Authors' contributions

YL participated in the design and theoretical analysis of the study, drafted the manuscript. MF conceived the study, and participated in its design and coordination. YX participated in the design and the revision of the study. All authors read and approved the final manuscript.

Rights and permissions

Open Access This article is distributed under the terms of the Creative Commons Attribution 2.0 International License ( https://creativecommons.org/licenses/by/2.0 ), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Reprints and permissions

About this article

Cite this article

Luo, Y., Feng, M. & Xu, Y. A stabilized mixed discontinuous Galerkin method for the incompressible miscible displacement problem. Bound Value Probl 2011, 48 (2011). https://doi.org/10.1186/1687-2770-2011-48

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1186/1687-2770-2011-48

Keywords