Numerical Solution of 2-D Diffusion Problems Using Discrete Duality Finite Volume Method on General Boundary Conditions

Abstract

In this paper, we present a discrete duality finite volume (DDFV) method for 2-D flow problems in nonhomogeneous anisotropic porous media under diverse boundary conditions. We use the discrete gradient defined in diamond cells to compute the fluxes. We focus on the case of Dirichlet, full Neumann and periodic boundary conditions. Taking into account the periodicity is the main new ingredient with respect to our recent works. We explain the procedures step by step, for numerical solutions. We develop a matlab code for algebraic equations. Numerical tests were provided to confirm our theoretical results.

Share and Cite:

Donfack, H. and Jeutsa, A. (2022) Numerical Solution of 2-D Diffusion Problems Using Discrete Duality Finite Volume Method on General Boundary Conditions. Journal of Applied Mathematics and Physics, 10, 1968-1997. doi: 10.4236/jamp.2022.106135.

1. Introduction

The discrete ion finite volume is one of the new generation finite volumes very popular today in Geoscience Engineering. The works from [1] [2] [3] [4] [5] have been the first to propose the DDFV method as used today for anisotropic flow problems. The formulation in terms of explicit discrete duality has been introduced in [5] [6]. The aim of this paper is to reformulate approach our DDFV approach by using the discrete gradient operators defined on the diamond meshes in order to show that, it is well adapted to very general meshes including the case of non-conformal locally refined meshes. We focus on general grids a survey of DDFV formulation for anisotropic flow problems under: 1) Dirichlet; 2) Full Neumann and 3) periodic boundary conditions. With regard to the mathematical analysis, we will refer to [5] [6] for details. An example of such a problem reads as follows: Find a function φ defined in Ω ¯ , that satisfies the following partial differential equation:

d i v ( K g r a d ( φ ) ) = f in Ω = ] 0,1 [ × ] 0,1 [ with appropriate boundary conditions (1)

where f is a given function and Ω ¯ is a closure of Ω that is a given open polygonal domain (not necessarily convex). On the other hand, K = K ( x ) , with x = ( x 1 , x 2 ) T Ω is a piecewise constant function in Ω and is symmetric, i.e.

K i j ( x ) = K i j ( x ) 1 i ; j 2 (2)

δ ± + such that ξ 2 , δ ξ 2 ( ξ ) T K ( x ) ξ δ + ξ 2 (3)

in Ω , where and ( . ) T denote respectively the euclidian norm and the transposition operator in 2 .

2. DDFV Formulation for Model Problem (1) on General Boundary Conditions

We first recall Gauss’ divergence theorem which is very useful in this section.

Theorem 1 (Gauss’ divergence theorem) Lets S be a closed surface bounding a soled D, oriented outwards. Let F be a vector field with continuous partial derivatives then

S F d s = D F d v (4)

Let us focus on a DDFV formulation of the problem (1) in terms of a linear system which involves { φ P } P P and { φ D } D D as discrete unknowns expected to be close approximations of { φ ¯ P } P P (cell-point pressures) and

{ φ ¯ D } D D (vertex pressures) respectively, where φ ¯ p = φ ¯ ( x 1 P , x 2 P ) and

φ ¯ D = φ ¯ ( x 1 D , x 2 D ) and where D represents the dual mesh. The DDFV theory

exposed in this work is inspired from the one developed in [6]. However we use the discrete gradient operators to simplify the heaviness concerns the DDFV discretization of balance equation for boundary cells from both primal and dual meshes.

2.1. Domain Discretizations: Some Definitions and Notations

For getting the DDFV formulation of the continuous problem (1), we first introduce a primary mesh P over Ω possessing the following properties: 1) P divides Ω ¯ int o a finite number of convex mesh elements. The mesh element vertices are named the primary mesh vertices. 2) The discontinuity points of K = K ( x ) are located in the mesh element interfaces. 3) For any edge of P arbitrarily exhibited one point and named edge-point in what follows, denote by the set of edge-points, E i n t the set of internal edge-point and E e x t the set of boundary edge-points.

Joining the edge points in suitable way defines an auxiliary mesh A necessary for locating a family of cellpoints in mesh element (with one point per mesh element). The auxiliary mesh plays a key role in the theoretical analysis of our DDFV solution see [6] [7] for details. Note the (Figure 1) below illustrate the process of discretization. Note that degenerate dual cells are involved along the boundary for Neumann and periodic boundary conditions.

Given two adjacent cellpoints P and L sharing σ = [ A B ] as common interface, for each I [ A B ] , can we introduce the quadrangle ( P , A , L , B ) diamond cell D σ σ whose diagonals are σ = [ A B ] and σ = [ P L ] , as shown in (Figure 2) below. Notice that the diamond cells are the union of four disjoint convex triangles. Furthermore, if I [ A B ] Ω then the quadrilateral D σ σ degenerate in a single triangle. The set of diamond cells is denoted by D and we have

Ω ¯ = D D D ¯

Remark 1 Note that the set E will sometimes be identified with the set of diamond meshes since there is a trivial bijection between the two sets.

α D angle between τ A B and τ P L

α B I L angle between τ A B and σ L

α B I L = Π 2 + θ h L , I

Figure 1. Domain discretizations for Dirichlet and Neumann boundary conditions (left) and for periodic boundary (right). The including is in black full lines, the corresponding auxiliary mesh in black dotted lines and the associated dual mesh in red discontinuous lines.

Figure 2. Examples of diamond cells. Left: A normal diamond cell. Right: A degenerate diamond cell.

ξ [ P L ] A the unit normal to [ P L ] exterior to triangle P L A

ξ [ A B ] L = ξ [ A B ] P

m σ the length of σ

m σ the length of σ

m D the measure of the diamond cell

D A = { D σ σ D \ D σ σ C A }

D P = { D σ σ D \ D σ σ C P }

Q L A quarter diamond defines by the triangle ( L A I )

D ˜ L half diamond defines by the triangle ( L A B )

D σ σ = D ˜ L D ˜ P = Q L A Q L B Q P A Q P B

An elementary geometry in triangles (PLI), (PID) and (LID) with reference (Figure 3) permit us to write:

( h I L ξ [ L I ] A + h I P ξ [ P I ] A h P L ξ [ P L ] A = 0 2 h D I ξ [ A B ] P + h I P ξ [ P I ] A h P D ξ [ P L ] A = 0 2 h I L ξ [ L I ] A h D I ξ [ A B ] P h D L ξ [ P L ] A = 0 2 (5)

this implies,

ξ [ L I ] A = h D I h I L ξ [ A B ] P + h D L h I L ξ [ P L ] A (6)

ξ [ P I ] A = h D I h I P ξ [ A B ] P + h D P h I P ξ [ P L ] A (7)

Main assumptions:

( A 1 ) We assume that the primary mesh P is compatible with the discontinuities of the permeability tensor K defined in Ω .

( A 2 ) The permeability discontinuities divide Ω into a finite number of convex polygonal subsets denoted by { Ω s } s S .

We suppose that the restriction over Ω ¯ s of the exact solution φ to the model problem (1), denoted by φ | Ω s , satisfies the following property:

φ | Ω s C 2 ( Ω ¯ s ) s S (8)

Figure 3. Diamond cells and notations.

Let us recall below the diverse boundary conditions that we are going to investigate in this paper:

1) Dirichlet boundary conditions

φ = 0 on Γ = Ω (9)

2) Full Neumann boundary conditions

K g r a d ( φ ) η = g on Γ = Ω (10)

where η is a outward unit normal vector and g is a given function

3) Periodic boundary conditions

φ ( .,0 ) = φ ( .,1 ) K ( .,0 ) g r a d φ ( .,0 ) n Γ S o + K ( .,1 ) g r a d φ ( .,1 ) n Γ N o = 0 } in [ 0,1 ] φ ( 0 , . ) = φ ( .,1 ) K ( .,0 ) g r a d φ ( 0,. ) n Γ W e + K ( 1,. ) g r a d φ ( 1,. ) n Γ E s = 0 } in [ 0,1 ] (11)

where Γ N o (northern boundary), Γ S o (southern boundary), Γ E s (eastern boundary) and Γ W e (western boundary) define a partition of the domain boundary denoted by Γ , and n Γ N o , n Γ S o , n Γ E s , n Γ W e the corresponding outward unit normal vectors

Due to periodicity conditions on the flux (see Equations (11), the source-term f should satisfy the following compatibility condition:

Ω f d x = 0 (12)

Note that the set V of primal mesh vertices contains the set:

made of four corner-points. To get advantage of the periodicity setting of the problem, the boundary-vertices are distributed along the domain boundary in such a way that the orthogonal projection of a boundary-vertex M (different from a corner-point) on the opposite side of Γ is also a boundary-vertex (different from a corner-point) denoted by M . Figure 1 (right) illustrates this fact that one can express in other words by:

2.2. The DDFV Balance Equation in an Internal Cell

For an internal cell the way for getting the DDFV balance equation is the same for Dirichlet, Neumann and periodic boundary conditions. Let C P be an internal primary cell where P is the corresponding cellpoint. We start, with introducing a discrete gradient operator T defined to be constant on each quarter diamond cell Q L A associated to the control volume C L

Q L A T φ T = 1 cos ( θ h L , I ) [ φ I φ A h I A ξ [ I L ] A + φ I φ L h I L ξ [ A B ] L ] (13)

Then integrating two sides of the balance Equation (1) in C L and apply Gauss’s divergence theorem to the left-hand side. The discrete balance equation follows from flux computations over the boundary of C L by using a suitable gradient operator τ defined above. Thus we have:

F [ A B ] L = [ A I ] K L g r a d ( φ ) ξ [ A B ] L d γ [ I B ] K L g r a d ( φ ) ξ [ A B ] L d γ = h I A K L Q L A τ φ , ξ [ A B ] L h I A K L Q L A τ φ , ξ [ A B ] L + T [ A B ] L = b h ( K L ) ( φ A φ B ) + h A B h I L a h ( K L ) ( φ L φ I ) + T [ A B ] L (14)

where

a h ( K L ) = K L ξ [ A B ] L , ξ [ A B ] L cos ( θ h L , I )

b h ( K L ) = K L ξ [ I L ] A , ξ [ A B ] L cos ( θ h L , I )

θ h L , I = m e a s ( σ L , ξ [ A B ] L ^ )

h = max { s i z e ( P ) , s i z e ( D ) } , Figure 3 gives an illustration of previous comment. Note that 0 θ h P , I , θ h L , I < π 2 and therefore 0 < cos ( θ h P , I ) , cos ( θ h L , I ) 1 .

Definition 1 The system ( P ; D ) defines an eligible system of meshes if the following conditions are fulfilled:

1) There exists θ ] 0 , π 2 ] , mesh independent, such that:

0 θ h P , I π 2 θ P P I E P (15)

2) There exists 0 < ϖ 1 , mesh independent, such that:

P P I E P ϖ h h P I , h A * B * h (16)

where h P I = P I and h A B = A B .

Following ideas we have exposed in [6], and the fact that approximate fluxes F [ A ; B ] P and F [ A ; B ] L meet the principle of flux continuity over the interface

between C P and C L if and only if the approximate edge point pressure φ I satisfies to the following relation:

φ I = b h ( K P ) + b h ( K L ) a h ( K P ) h A B h P I + a h ( K L ) h A B h I L { ( φ B φ A ) + a h ( K L ) h A B h I L φ L + a h ( K P ) h A B h P I φ P } (17)

Proposition 2 Under the only assumption (8) we have:

F [ A B ] P [ a h ( K P ) a h ( K L ) h A B a h ( K P ) h I L + a h ( K L ) h P I ] [ φ P φ L ] + [ a h ( K L ) b h ( K P ) h P I a h ( K P ) b h ( K L ) h I L a h ( K L ) h P I + a h ( K P ) h I L ] [ φ B φ A ] (18)

In addition, if the system of meshes ( P ; D ) is eligible in the sense of Definition 1, the truncation error T [ A B ] P (also denoted by T P , I ) associated with this flux approximation satisfies the following inequality

| T P , I | | T [ A B ] P | C h 2 (19)

where A = A ( P , I ) , B = B ( P , I ) , L = L ( P , I ) and where C is a mesh independent positive number.

Recall that only the case E P E e x t = , with P P , is concerned by the previous result. Summing the two sides of relation (18) on I E P leads to the following result.

Proposition 3 Let us suppose that the system of meshes ( P ; D ) is eligible in the sense of Definition 1. Under the assumption (8), the discrete balance equation in any primary cell C P , with E P E e x t = , reads as:

I E P { T P , I + [ a h ( K P ) a h ( K L ) h A B a h ( K P ) h I L + a h ( K L ) h I P ] [ φ P φ L ] + [ a h ( K P ) b h ( K L ) h I L b h ( K P ) a h ( K L ) h I P a h ( K P ) h I L + a h ( K L ) h I P ] [ φ B φ A ] } = C P f d x (20)

where A = A ( P , I ) , B = B ( P , I ) and L = L ( P , I ) (see Section 2 devoted mainly to Notations).

Moreover, the truncation error T P , I satisfies the inequality (19).

It is clear that the number of discrete unknowns { φ P } P P and { φ A } A D is greater than the number of discrete balance equations given by the system of Equation (20) valid for all P P . We naturally should close this system with discrete equations obtained from mass balance equations over dual cells. It is our purpose now to look for discrete balance equations over dual cells C A . So, we integrate the two sides of (1) in C A . The left-hand side is the flow exchanged between C A and outside of this cell, whereas the right-hand side is the term-source contribution (for a fixed time period) Let us look or a flux approximation across the pseudo-edge [ P I L ] viewed as part of the boundary of C B . Denoted by F [ P I L ] B , it can be expressed by the relation

F [ P I L ] B = [ P I ] K P g r a d ( φ ) ξ [ P I ] B d γ [ I L ] K L g r a d ( φ ) ξ [ I L ] B d γ (21)

By using the same process, the approximate flux across the pseudo-edge is

F [ P I L ] B = h P I K P Q P B τ φ , ξ [ P I ] B h I L K L Q L B τ φ , ξ [ I L ] B + T B , I (22)

Summing the two sides of the Equation (22) on I E B leads to what follows.

Proposition 4 Under the assumption (8), the flux balance equation for any interior dual cell C B reads,:

I E B F [ P I L ] B = C B f ( x ) d x B C B (23)

In addition, if the system of meshes ( P ; D ) is eligible in the sense of Definition 1, the truncation error T B , I obeys the following inequality:

| T B , I | C h 2 (24)

where C is a mesh independent positive number.

2.3. The DDFV Balance Equation in Boundary Cells

2.3.1. Case of Dirichlet Boundary Conditions

As shown in (Figure 1), there is no need of degenerate dual cell in the domain discretization for Dirichlet boundary conditions. Thus the set of boundary cells reduces to the set of primary cells adjacent to the boundary. Note that for f L 2 ( Ω ) one easily proves that Equations (1) and (9) get a unique variational

solution in the Sobolev space H 0 1 ( Ω ) . Letting I E i n t E P F [ A B ] P represent the left of the balance equation in primary cell C P adjacent to Γ reads as:

I E i n t E P F [ A B ] P + I E e x t E P a h ( K P ) h A B h P I φ P = C P f d x (25)

Because the degenerate discrete gradient reads as:

D σ σ e x t τ φ τ = 1 sin ( α D ) ( φ P h L P ξ [ A B ] P ) (26)

2.3.2. Case of Full Neumann Boundary Conditions

In the Sobolev space H 1 ( Ω ) the existence and uniqueness of a variational solution to (1) - (10) are ensured if:

f L 2 ( Ω ) g L 2 ( Γ ) Ω f d x Γ g d γ = 0 (27)

Let Γ P denote the boundary of any primary cell C P , then the DDFV balance equation in a primary cell adjacent to domain boundary by using a suitable external discrete gradient operator reads as:

I E e x t E P [ ... ] = C P f d x Γ Γ P g d γ = 0 (28)

Note that the degenerate discrete gradient reads as:

D σ σ e x t τ φ τ = 1 sin ( α D ) ( φ B φ A h B A ξ [ I P ] B + φ I φ P h P I ξ [ A B ] P ) (29)

And φ I is given by Equation (17) with K L = 0 , finally the degenerate discrete gradient reads as:

D σ σ e x t τ φ τ = φ B φ A h B A sin ( α D ) ( ξ [ I P ] B + b h ( K P ) a h ( K P ) ξ [ A B ] P ) (30)

It is easy to check that the balance equation in a dual cell (adjacent or not) to the domain boundary reads as:

D σ σ e x t τ φ τ = φ B φ A h B A sin ( α D ) ( ξ [ I P ] B + b h ( K P ) a h ( K P ) ξ [ A B ] P )

2.3.3. Case of Periodic Boundary Conditions

Note that the periodicity condition (11) implies the periodicity of the discrete solution. Clearly the source f and the tensor K should be extended to 2 by periodicity. So there exists a periodic partition of whole space 2 into control volumes. Our strategy to obtain discrete balance equations associated with degenerated dual cells is to consider a DDFV formulation in whole space 2 (without distinguishing between boundary and interior control volumes). We extend the domain Ω by introducing the fictitious domain around the boundary of the initial domain Ω , the fictitious points (cell points and vertex points) are defined so as to have their corresponding in Ω , due to periodicity. To doing so, let’s compute the flux across the recomposed dual cells C E E and C π , we define the fictitious domain Ω F . Note that the original domain Ω is embedded inside a fictitious domain Ω F such that Ω ¯ F = Ω ¯ Σ Ω F The computational domain Ω is meshed with respect to the periodicity setting of the problems. The boundary-vertices ( A Ω F ) are distributed along the domain boundary Ω F in such a way that the orthogonal projection of a boundary-vertex on the opposite side of Ω F is a latest vertex-point inside the original domain Ω denoted by A which means that ( φ A ) A Ω F = ( φ A ) A Ω . The cell point pressure L are distributed inside the domain Σ in such a way that the orthogonal projection of a boundary dual mesh on the opposite of Ω is a least cell point inside the original domain Ω denoted by L which means that ( φ L ) L Σ = ( φ L ) L Ω . As illustrated in (Figure 4) in the particular case of the uniform rectangular mesh. The strategy allows to have all the dual meshes inside the fictitious domain which greatly simplifies the writing of discrete balance equations. It’s important to note that the introduction of the fictitious domain also makes possible to deal efficiently the Neunman boundary conditions, for that the permeability tensor must be null in Σ domain. Then we use the same process to compute the flux across the boundary cells by defining the appropriate discrete gradient operators. It follows that three types of discrete gradient operators on the diamond mesh are necessary for the computation of the flux whether for the internal or external meshes. Note that this domain extension technique was used in [8] for numerical treatment of initial-Boundary value problems with Mixed Boundary Conditions.

Definition 2 A diamond mesh is said to be fictitious or recomposed if at least one of its vertices is in Σ domain. Let us denote D = D i n t D F i c t where

Figure 4. A schematic illustration of the fictitious domain delimited by Ω F Ω and recomposed dual cells around the domain Ω painted in blue.

D i n t is the set of internal diamond cells and D F i c t is the set of fictitious diamond cells. It follows that the discrete gradients are written as follows

D σ σ i n t τ φ τ = 1 sin ( α D ) ( φ B φ A h B A ξ [ P L ] B + φ L φ P h L P ξ [ A B ] P ) : σ E i n t (31)

D σ σ F i c t τ φ τ = 1 sin ( α D ) ( φ B φ A h B A ξ [ P L ] B + φ L φ P h P L ξ [ A B ] P ) : σ , σ Σ (32)

D σ σ F i c t τ φ τ = 1 sin ( α D ) ( φ B φ A h B A ξ [ P L ] B + φ L φ P h P L ξ [ A B ] P ) : σ Ω (33)

Remark 2 Note that the set E primary edges will sometimes be identified with the set D of diamond meshes since there is a trivial bijection between the two sets i.e. σ P , σ D such that D σ σ i n t D .

2.3.4. DDFV Scheme of the Model Problem

To obtain a DDFV scheme of the problem (1), we rewrite these fluxes across the primary edges and pseudo-edges calculated previously in the base ( ξ σ . A , ξ σ . P ) taking in consideration the vectorial relations (6) and (7). By neglecting truncation errors in the Equations (19)-(24), using equally remark (2) and definition (2) we get the following discrete scheme of the problem (1).

Proposition 5 The DDFV scheme associated of the model problem (1)

We can define a DDFV of problem as find φ ¯ τ = ( ( φ ¯ P ) P P , ( φ ¯ A ) A D ) such that

( D D P m σ K D D τ φ ¯ τ , ξ σ . P = m e a s ( C P ) f P C P P D D A m σ K D D τ φ ¯ τ , ξ σ . A = m e a s ( C A ) f A C A D (34)

Which can be written taking in consideration remark (2)as follows

( σ D P m σ K D D τ φ ¯ τ , ξ σ . P = m e a s ( C P ) f P C P P σ D A m σ K D D τ φ ¯ τ , ξ σ . A = m e a s ( C A ) f A C A D (35)

where f P and f A denote the mean value of f over C P and C A respectively,the equivalent diffusion tensor K ¯ D satisfies

K ¯ D ξ σ . P , ξ σ . P = s i n ( α D ) × m σ K P ξ σ . P , ξ σ . P K L ξ σ . P , ξ σ . P K P ξ σ . P , ξ σ . P cos ( θ h L , I ) h I L + K L ξ σ . P , ξ σ . P cos ( θ h P , I ) h I P (36)

K ¯ D ξ σ . P , ξ σ . A = ( K P ξ σ . P , ξ σ . P K L ξ σ . A , ξ σ . P h D L + K P ξ σ . P , ξ σ . A K L ξ σ . P , ξ σ . P h D P ) sin ( α D ) 1 ( K P ξ σ . P , ξ σ . P cos ( θ h L , I ) h I L + K L ξ σ . P , ξ σ . P cos ( θ h P , I ) h I P ) (37)

K ¯ D ξ σ . A , ξ σ . A = sin ( α D ) m σ { ( h D L 2 h I L K L ξ σ . A , ξ σ . A cos ( θ h L , I ) + h D P 2 h I P K P ξ σ . A , ξ σ . A cos ( θ h P , I ) ) 1 h I L h I P ( h I L h D P K P ξ σ . P , ξ σ . A cos ( θ h P , I ) h I P h D L K L ξ σ . P , ξ σ . A cos ( θ h L , I ) K P ξ σ . P , ξ σ . P cos ( θ h L , I ) h I L + K L ξ σ . P , ξ σ . P cos ( θ h P , I ) h I P ) 2 } (38)

Remark 3 When the points P, I and L are aligned, which means D = I , then we have θ h L , I = θ h P , I = ( π 2 α D ) , m σ = m σ L + m σ P ,

sin ( α D ) = cos ( θ h P , I ) = cos ( θ h L , I ) , m σ L = h I L , m σ P = h I P , in this case the matrix K ¯ D is then defined by:

K ¯ D ξ σ . P , ξ σ . P = ( m σ L + m σ P ) K P ξ σ . P , ξ σ . P K L ξ σ . P , ξ σ . P K P ξ σ . P , ξ σ . P m σ L + K L ξ σ . P , ξ σ . P m σ P (39)

K ¯ D ξ σ . P , ξ σ . A = K P ξ σ . P , ξ σ . P K L ξ σ . A , ξ σ . P m σ L + K P ξ σ . P , ξ σ . A K L ξ σ . P , ξ σ . P m σ P K P ξ σ . P , ξ σ . P m σ L + K L ξ σ . P , ξ σ . P m σ P (40)

K ¯ D ξ σ . A , ξ σ . A = m σ L K L ξ σ . A , ξ σ . A + m σ P K P ξ σ . A , ξ σ . A m σ L + m σ P m σ L × m σ P ( K P ξ σ . P , ξ σ . A K L ξ σ . P , ξ σ . A ) 2 K P ξ σ . P , ξ σ . P m σ L + K L ξ σ . P , ξ σ . P m σ P (41)

We recognize in (39) the weighted harmonic mean-value of K P ξ σ . P , ξ σ . P and K L ξ σ . P , ξ σ . P and in the first term of (41) the weighted arithemetic mean-value of K L ξ σ . A , ξ σ . A and K P ξ σ . A , ξ σ . A . In this particular case this scheme was already proposed in [9], we also recognize in particular case the median-dual mesh based on the primal centers and the midpoint of the edges proposed in [4].

Proposition 6 Discrete integration by parts formula associated to the model problem (1) For all φ ¯ τ , ϕ ¯ τ τ we have

D D m e a s ( D ) K D D τ φ ¯ τ , D τ ϕ ¯ τ = C P P m e a s ( C P ) ϕ P f P + C A D m e a s ( C A ) ϕ A f A

Proof. Since m σ ξ σ . A = h I L ξ [ I L ] . A + h I P ξ [ I P ] . A the proof is similar to the one exposed in [4].

3. Existence of Discrete Solutions of the Model Problem

3.1. Existence and Uniqueness of DDFV Scheme (Case of Dirichlet Boundary Conditions)

Let us check the existence and uniqueness of the discrete solution.

Proposition 7 The matrix associated with the linear system (34)-(31)-(26) is symmetric and positive definite

Proof. It is easily seen that the symmetry of the matrix M associated with the system (26), (31) and (34) essentially follows from the symmetry of the diffusion coefficient K. We should now prove the positive definiteness of that matrix.

Development of the quadratic expression:

M φ T , φ T = 2 D D m e a s ( D ) K ¯ D D T φ T , D T φ T = 2 D σ σ D m e a s ( D σ σ ) K ¯ D σ σ D σ σ T φ T , D σ σ T φ T = D σ σ D { m e s ( σ ) m e s ( σ ) sin ( α D ) K ¯ D σ σ ξ σ A , ξ σ A ( φ B φ A ) 2 + 2 K ¯ D σ σ ξ σ P , ξ σ A sin ( α D ) ( φ B φ A ) ( φ L φ P ) + m e s ( σ ) m e s ( σ ) sin ( α D ) K ¯ D σ σ ξ σ P , ξ σ P ( φ L φ P ) 2 }

This quadratic form is elliptic if and only if:

K ¯ D σ σ ξ σ A , ξ σ A K ¯ D σ σ ξ σ P , ξ σ P K ¯ D σ σ ξ σ P , ξ σ A 2 0 (42)

In effect we have:

Δ K ¯ D σ σ = m e s ( σ ) m e s ( σ ) sin ( α D ) K ¯ D σ σ ξ σ P , ξ σ P × m e s ( σ ) m e s ( σ ) sin ( α D ) K ¯ D σ σ ξ σ A , ξ σ A [ 1 sin ( α D ) K ¯ D σ σ ξ σ P , ξ σ A ] 2

= ( 1 sin ( α D ) ) 2 [ K ¯ D σ σ ξ σ A , ξ σ A K ¯ D σ σ ξ σ P , ξ σ P K ¯ D σ σ ξ σ P , ξ σ A 2 ] = N 1 × Δ K P + N 2 × Δ K L

where N 1 and N 2 are strictly positive numbers defined as

N 1 = [ h P D K L ξ σ P , ξ σ P K P ξ σ P , ξ σ P cos ( θ h L , I ) h I L + K L x s P , x s P cos ( q h P , I ) h I P ] 2 + K L ξ σ A , ξ σ A K L ξ σ P , ξ σ P h P D 2 × cos ( θ h L , I ) h I L h I P cos ( θ h P , I ) ( K P ξ σ P , ξ σ P cos ( θ h L , I ) h I L + K L x s P , x s P cos ( q h P , I ) h I P ) 2

N 2 = [ h L D K P ξ σ P , ξ σ P K P ξ σ P , ξ σ P cos ( θ h L , I ) h I L + K L x s P , x s P cos ( q h P , I ) h I P ] 2 + K L ξ σ A , ξ σ A K L ξ σ P , ξ σ P h L D 2 × cos ( θ h P , I ) h I P h I L cos ( θ h L , I ) ( K P ξ σ P , ξ σ P cos ( θ h L , I ) h I L + K L x s P , x s P cos ( q h P , I ) h I P ) 2

Since the diffusion matrix K is symmetric and positive definite, the Cauchy-Schwartz inequality for the inner product associated with K ensures that

Δ K P = K P ξ σ A , ξ σ A K P ξ σ P , ξ σ P K P ξ σ P , ξ σ A 2 0

and

Δ K L = K L ξ σ A , ξ σ A K L ξ σ P , ξ σ P K L ξ σ P , ξ σ A 2 0

as either ξ σ P and ξ σ A are not collinear. Therefore Δ K ¯ D σ σ 0 , thus the matrix K ¯ D σ σ are symmetric and positive definite matrices. Under the assumption 1 the matrix K ¯ D possesses strictly positive eigenvalues. Let δ min D be its least eigenvalue. so we have

δ min D D D m e a s ( D ) D τ φ ¯ τ 2 1 2 M φ ¯ τ , φ ¯ τ (43)

the equality holds in Equation (43) if and only if φ T = 0 . Thus, the positive definiteness of the matrix M is proven.

Proposition 8 The linear system (26), (31) and (34) possesses a unique solution.

Proof. It follows from the previous proposition.

3.2. Existence and Uniqueness of DDFV Scheme (Case of Periodic Boundary Conditions)

Remark 4 The proof of existence and uniqueness of discrete solutions with Neumann conditions is very similar with that of periodic boundary conditions. For Neumann case we refer to [10] for more details

Let us start this subsection with some preliminary remarks and results. First of all, we assume that the cell-points and the vertex-points from the primary grid are numbered. The numbering is performed in such a way that any boundary-vertex (different from a corner-point) and its orthogonal projection on the opposite side get the same number. On the other hand, the four corner-points O 1 * , O 2 * , O 3 * and O 4 * are given the same number. This way of numbering accounts with the periodicity setting of the discrete problem.

Remark 5 Note that to obtain a square system, due to the periodicity we will only compute the fictitious diamond cells located at the northern and eastern boundary or western and southern boundary

Proposition 9 Let M h be the total number of discrete unknowns according to the previous numbering of cell-points and vertex-points. Set that: D = D i n t D ( Γ S o ) D ( Γ W e ) { D O 1 } , where D i n t is the set that consists of dual cells associated with interior vertexpoints and where D ( Γ S o ) and D ( Γ W e ) respectively denote the sets of dual cells associated with boundary vertexpoints different from cornerpoints and located in the x 1 -axis and the x 2 -axis. Of course D O 1 is the dual cell associated with O 1 . The two following discrete problems are equivalent:

(DP1): Find ( { φ ¯ P } P P ; { φ ¯ D } D D ) P × D such that Equations (31),(32),(33)and (34)are satisfied

And

(DP2): Find ( { φ ¯ P } P P ; { φ ¯ D } D D * ) M h P × D * such that Equations (31) and (32) and (33)and (34)are satisfied

Where, for a given set of mesh elements K , one has set:

K = { { v K } K K ; K K , v K } . (44)

For the sake of clarity of the exposition, P P will be used either for denoting a cellpoint or its associated number, idem for D V D concerning primal vertex-points.

3.2.1. Some Useful Vector Spaces and Preliminary Results

In view to algebraically address the linear discrete system (31) - (34), we introduce some adequate vector spaces. Recall that A denotes the auxiliary mesh i.e. an intermediate mesh between the primal mesh P and the dual mesh D . The main feature of A is that each auxiliary cell involves either one only cellpoint or one only vertexpoint. Consequently, we have the following relation between A , P and D :

A = { Ω P } P P { Ω D } D D (45)

where Ω P and Ω D denote the two kinds of auxiliary cells emerging from the definition of the mesh A . These cells will play a key role for the definition of DDFV solutions to the system of Equations (1) - (10) or (1) - (11). Let us introduce the following vector spaces:

A = { ( { v P } P P ; { v D } D D ) ; P P , D D , v P , v D } (46)

P e r i o A = { ( { v P } ; { v D } ) A ; D D ( Γ S o ) D ( Γ W e ) , v D = v D and v O 1 = v O 2 = v O 3 = v O 4 } (47)

Recall that D ( Γ S o ) and D ( Γ W e ) respectively denote the sets of boundary vertex-points different from corner-points and located in the x 1 -axis and the x 2 -axis. In the sequel, we will sometimes do the following identification:

A P × D .

Note that P e r i o A is an M h -dimensional subspace of A . So, the following identification will be sometimes considered:

P e r i o A M h P × D .

Proposition 10 The matrix M h associated with the discrete system (DP2) is singular.

Proof. The proof is elementary. Indeed it suffices to remark from the discrete system (31) - (34) that

1 j M h ( M h ) i j = 0 1 i M h .

Thus, the kernel K e r ( M h ) of M h defined by

K e r ( M h ) = { V h M h ; M h V h = 0 }

involves a nonzero vector, namely I h = ( 1,1, ,1 ) M h , and therefore M h is singular.

We know from the previous proposition that the discrete problem (DP2) could get either no solution or an infinite number of solutions. Indeed, existence of solutions to this problem depends on whether the right-hand side to (DP2) is in the orthogonal of the kernel of M h . Our purpose now is to give a characterization of K e r ( M h ) , the kernel of M h . Before that, we recall a result we need for proving the characterization of K e r ( M h ) .

Proposition 11 (Characterization of K e r ( M h ) )

K e r ( M h ) = { V h M h P e r i o A ; ( V h ) t M h V h = 0 } ;

( V h ) t M h V h = 0 V h = σ P I P + σ D I D V h M h P e r i o A ,

where we have set:

( I P ) i = ( 1 if i P 0 otherwise and ( I D ) i = ( 1 if i D 0 otherwise .

and where σ P and σ D are given real numbers.

Proof. The inclusion of K e r ( M h ) in { V h M h ; ( V h ) t M h V h = 0 } is trivial. Let us concentrate on the proof of the inclusion of { V h M h ; ( V h ) t M h V h = 0 } in K e r ( M h ) . For this purpose, let V h = ( { V P } P P ; { V D } D D ) M h P D be a vector such that

( V h ) t M h V h = 0.

where one has set

D = D i n t D ( Γ S o ) D ( Γ W e ) { D O 1 } .

Therefore, it follows from the integration by parts formula that:

M h φ h , j h = 2 D D m e a s ( D ) K ¯ D D h φ h , D h φ h = 2 D σ σ D m e a s ( D σ σ ) K ¯ D σ σ D σ σ h φ h , D σ σ h φ h = D σ σ D { m e a s ( σ ) m e a s ( σ ) sin ( α D ) K ¯ D σ σ ξ σ A , ξ σ A ( φ B φ A ) 2 + 2 K ¯ D σ σ ξ σ P , ξ σ A sin ( α D ) ( φ B φ A ) ( φ L φ P ) + m e a s ( σ ) m e a s ( σ ) sin ( α D ) K ¯ D σ σ ξ σ P , ξ σ P ( φ L φ P ) 2 } (48)

According to [6], there exists λ min a mesh-independent, strictly positive real number that minimizes both of least eigenvalues of K ¯ D σ σ . We then deduce from Equation (48) that

λ min D σ σ D { ( φ B φ A ) 2 + ( φ L φ P ) 2 } M h φ h , j h (49)

It is obvious from the previous inequality that the space { V h M h ; ( V h ) t M h V h = 0 } is included in the one spanned by the vectors I P and I D defined by

( I P ) i = ( 1 if i P i .e . i is a cellpoint number 0 otherwise

and

( I D ) i = ( 1 if i D 0 otherwise .

Remarking that I P and I D are two (linearly independent) eigenvectors with zero as corresponding eigenvalue with respect to the matrix M h , the proof of Proposition 11 is completed.

Remark 6 Note that the dimension of the space K e r ( M h ) is equal to 2. This information plays a key-role for uniqueness conditions investigated in the next section.

3.2.2. Existence and Conditions for Uniqueness of a Solution to (DP2)

Let us start with an existence result for the discrete problem (DP2) which involves the system of Equations (31)-(34).

Proposition 12 (Existence)

Under the assumption (12), the discrete system (DP2) possesses an infinite number of solutions.

Proof. Just remark that the condition (12) ensures that the right-hand side of the system of Equations (34) is a vector of M h orthogonal to K e r ( M h ) .

Recall that for the continuous problem (1), the assumptions (2) - (12) ensure the existence of a family of variational solutions i.e. set of functions φ living in the space

H = { v H 1 ( Ω ) ; v ( . , 0 ) = v ( . , b ) in [ 0 , a ] and v ( 0 , . ) = v ( a , . ) in [ 0 , b ] } ,

and such that

Ω K ( x ) g r a d φ ( x ) g r a d v ( x ) d x = Ω f ( x ) v ( x ) d x v H .

The uniqueness of a solution to this continuous problem is got from the subspace of H made up of functions v satisfying the following condition:

Ω v ( x ) d x = 0. (50)

This condition makes obvious the necessity of associating a discrete function v h (defined almost everywhere in Ω ) with any vector ( { v P } P P ; { v D } D D ) from p e r i o A .

• Basic discrete function spaces. Denote by E ( p e r i o A ) the space of such discrete functions v h and let I S be the characteristic function of a subset S of Ω i.e. I S ( x ) = 1 if x S and 0 otherwise. We define the space E ( p e r i o A ) as:

E ( P e r i o A ) = { v : Ω ; ( { v P } P P ; { v D } D D ) P e r i o A such that v ( x ) = P P v P I Ω P ( x ) + D D v D I Ω D ( x ) a .e . in Ω } (51)

where Ω P and Ω D are two generic notations of the two kinds of auxiliary cells from A . Let us introduce the following mappings (viewed as projections in some sense):

v h E ( P e r i o A ) Π P [ v h ] ( x ) v h P ( x ) = P P v P I C P ( x ) E ( P ) (52)

v h E ( P e r i o A ) Π D [ v h ] ( x ) v h D ( x ) = D D v D I C D ( x ) E ( D ) (53)

where E ( P ) and E ( D ) are function spaces respectively associated with vector spaces P and D (see relation (44) for the definition of these vector spaces).

• Looking for uniqueness conditions. Since the dimension of K e r ( M h ) is equal to 2, we should look for two discrete analogues of (50) (namely quadrature formulas), linearly independent, that should ensure uniqueness for a solution to the discrete problem (DP2). These discrete analogues are defined as:

Ω v h P ( x ) d x = 0 and Ω v h D ( x ) d x = 0

In other words,

P P m e s ( C P ) v P = 0 and D D m e s ( C D ) v D = 0

Proposition 13 Define two quadrature expressions P ( . ) and D ( . ) on the discrete function space E ( A ) as follows: for all

v h = ( { v P } ; { v D } ) E ( ℝ A )

P ( v h ) = P P m e s ( C P ) v P and D ( v h ) = D D m e s ( C D ) v D .

Then, P ( . ) and D ( . ) are linearly independent linear forms on E ( A ) .

Proof. Let λ P and λ D be two real numbers such that λ P P ( . ) + λ D D ( . ) = 0 on E ( A ) , that is, λ P P ( v h ) + λ D D ( v h ) = 0 v h E ( A ) .

Taking v h to be successively P P I Ω P and D D I Ω D , one easily see that λ P = λ Q = 0 . This proves the proposition.

We have gathered all the ingredients for existence and uniqueness of a solution to the discrete problem (DP2).

Proposition 14 (Existence and Uniqueness) The problem that consists in finding ( { φ ¯ P } P P ; { φ ¯ D } D D ) P e r i o A such that the Equations (31) - (34) are satisfied possesses a unique solution if condition (12) is fulfilled and if

P P m e s ( C P ) φ ¯ P = D D m e s ( C D ) φ ¯ D = 0. (54)

Proof. We already know from Proposition 12 that under the condition (12), the discrete system (31)-(34) possesses an infinite number of solutions in P e r i o A . Moreover, in the proof of Proposition 11, we have shown the fact that

( V h ) t M h V h 0 V h P e r i o A (55)

So, to end the proof of Proposition 14, we just need to prove the positive definiteness of M h over the subspace P e r i o ,0 A of P e r i o A made up of vectors V h satisfying the conditions (54). For this purpose, it suffices to show the assertion:

( V h ) t M h V h = 0 V h = 0 V h P e r i o ,0 A .

The second part of Proposition 11 lets this assertion be trivial.

4. A Short Survey of the 2D Implementation of DDFV Scheme on Uniform Mesh

4.1. DDFV Formulation on the Internal Meshes

Let us consider the model problem (1), in two dimensional region Ω = ( 0,1 ) × ( 0,1 ) (where the permeability D is used instead of K). Before starting the implementation step, let us introduce the controle volume (Figure 5) and the main notations. We consider a primal mesh composed of rectangular cells

K i ; j = [ x i 1 2 , x i + 1 2 ] × [ y j 1 2 , y j + 1 2 ] , i ; j { 1 , 2 , , N } . For the sake of simplicity,

Figure 5. Controle volume of DDFV scheme up (primal) and down (dual).

we will assume that the mesh is uniform, and we enforce

x i + 1 2 x i 1 2 = y i + 1 2 y i 1 2 = h for all i ; j { 1 , 2 , , n } where h = 1 N 0 is fixed. we denoted by ( x i + 1 2 , y j + 1 2 ) the vertices of the primal mesh and by ( x i , y j ) the center of the primal cell K i ; j . Around each vertex of the primal mesh ( x i + 1 2 , y j + 1 2 ) , we construct a dual cell K i + 1 2 ; j + 1 2 = [ x i , x i + 1 ] × [ y j , y j + 1 ] . The set of the dual cells ( K i + 1 2 ; j + 1 2 ) i , j { 1 , 2 , , N 1 } constitutes a second mesh wish will call dual mesh. The diamond meshes are defined by the vertices ( x i , y j + 1 ) , ( x i 1 2 , y j + 1 2 ) , ( x i , y j ) , ( x i + 1 2 , y j + 1 2 ) or ( x i 1 , y j ) , ( x i + 1 2 , y j + 1 2 ) , ( x i , y j ) , ( x i + 1 2 , y j 1 2 ) and denoted respectively by D i + 1 2 , j or D i , j + 1 2 . As you can see in Figure 6, the centers of the dual cells are the vertices of the primal mesh and conversely. The set Δ h = { ( x i , y j + 1 ) , ( x i + 1 2 , y j + 1 2 ) } i , j { 0 , 1 , , N } made of finite number of nodes is called the computational grid. Recall that:

x i = x i + 1 2 + x i 1 2 2 , y j = y j + 1 2 + y j 1 2 2 , i , j { 1 , 2 , , N }

We also adopt the following conventions: x 0 = x 1 2 = y 0 = y 1 2 = 0 and.

x N + 1 = x N + 1 2 = y N + 1 = y N + 1 2 = 1 We are looking for values φ i , j , φ i + 1 2 , j + 1 2 which approximate φ ( x i , y j ) and φ ( x i + 1 2 , y j + 1 2 ) respectevely. By rewriting Formula

(34) in this particular case, the DDFV formulation of the model problem (1) on the internal meshes is written as follows

Figure 6. The natural ordering nodes for N = 4 : Dirichlet boundary conditions. (LEFT), for Neumann boundary conditions (middle) and for periodic boundary (Right).

2 D 22 i , j D 22 i , j + 1 D 22 i , j + D 22 i , j + 1 ( φ i , j φ i , j + 1 ) + D 22 i , j D 21 i , j + 1 + D 21 i , j D 22 i , j + 1 D 22 i , j + D 22 i , j + 1 ( φ i 1 2 , j + 1 2 φ i + 1 2 , j + 1 2 ) + 2 D 22 i , j D 22 i , j 1 D 22 i , j + D 22 i , j 1 ( φ i , j φ i , j 1 ) + D 22 i , j D 21 i , j 1 + D 21 i , j D 22 i , j 1 D 22 i , j + D 22 i , j 1 ( φ i + 1 2 , j 1 2 φ i 1 2 , j 1 2 ) + 2 D 11 i , j D 11 i + 1 , j D 11 i , j + D 11 i + 1 , j ( φ i , j φ i + 1 , j ) + D 11 i , j D 12 i + 1 , j + D 12 i , j D 11 i + 1 , j D 11 i , j + D 11 i + 1 , j ( φ i + 1 2 , j 1 2 φ i + 1 2 , j + 1 2 ) + 2 D 11 i , j D 11 i 1 , j D 11 i , j + D 11 i 1 , j ( φ i , j φ i 1 , j ) + D 11 i , j D 12 i 1 , j + D 12 i , j D 11 i 1 , j D 11 i , j + D 11 i + 1 , j ( φ i 1 2 , j + 1 2 φ i 1 2 , j 1 2 ) = K i , j f d x 1 i , j N (56)

and

[ ( D 12 i + 1 , j + 1 D 12 i + 1 , j + 1 ) ( D 21 i , j + 1 D 21 i + 1 , j + 1 ) 2 ( D 11 i , j + 1 + D 11 i + 1 , j + 1 ) + D 22 i , j + 1 + D 22 i + 1 , j + 1 2 ] ( φ i + 1 2 , j + 1 2 φ i + 1 2 , j + 3 2 ) + [ D 11 i , j + 1 D 21 i + 1 , j + 1 + D 11 i + 1 , j + 1 D 21 i , j + 1 D 11 i , j + 1 + D 11 i + 1 , j + 1 ] ( φ i , j + 1 φ i + 1 , j + 1 ) + [ ( D 12 i + 1 , j D 12 i , j ) ( D 21 i , j D 21 i + 1 , j ) 2 ( D 11 i , j + D 11 i + 1 , j ) + D 22 i , j + 1 + D 22 i + 1 , j 2 ] ( φ i + 1 2 , j + 1 2 φ i + 1 2 , j 1 2 ) + [ D 11 i + 1 , j D 21 i , j + D 11 i , j D 21 i + 1 , j D 11 i , j + 1 + D 11 i + 1 , j + 1 ] ( φ i , j + 1 φ i , j ) + [ ( D 21 i + 1 , j + 1 D 21 i + 1 , j + 1 ) ( D 12 i + 1 , j D 12 i + 1 , j + 1 ) 2 ( D 22 i + 1 , j + D 22 i + 1 , j + 1 ) + D 11 i , j + 1 + D 11 i + 1 , j + 1 2 ] ( φ i + 1 2 , j + 1 2 φ i + 3 2 , j + 1 2 )

+ [ D 22 i + 1 , j D 12 i + 1 , j + 1 + D 22 i + 1 , j + 1 D 12 i + 1 , j D 22 i + 1 , j + D 22 i + 1 , j + 1 ] ( φ i + 1 , j φ i + 1 , j + 1 ) + [ ( D 21 i , j + 1 D 21 i , j ) ( D 12 i , j D 12 i , j + 1 ) 2 ( D 22 i , j + D 22 i , j + 1 ) + D 11 i , j + D 11 i , j + 1 2 ] ( φ i + 1 2 , j + 1 2 φ i 1 2 , j + 1 2 ) + [ D 22 i , j + 1 D 12 i , j + D 22 i , j D 12 i , j + 1 D 22 i , j + D 22 i , j + 1 ] ( φ i , j + 1 φ i , j ) = K i + 1 2 , j + 1 2 f d x 1 i , j N 1 (57)

The DDFV method can be viewed as a double classical finite volume acting on the primal meshes and on the dual meshes. When the medium is isotropic systems (56) and (57) are decoupled and therefore independent. In the homogeneous and nonhomogeneous anisotropic case there is a connectivity between the

unknown φ i , j and φ i + 1 2 , j + 1 2 . For every fixed primary mesh

K i ; j = [ x i 1 2 , x i + 1 2 ] × [ y j 1 2 , y j + 1 2 ] or dual mesh K i + 1 2 ; j + 1 2 = [ x i , x i + 1 ] × [ y j , y j + 1 ]

the corresponding Equation (56) or (57) involves nine unknown nodal values. For that reason in this particular case DDFV scheme is so called the nine point scheme.

4.2. Matrix Form of the Linear System (56) and (57) and Node Numbering

If we adopt the lexicographic (Figure 6) order according to which nodes (correspondingly, the unknown components) are numbered by proceeding the primary mesh to the dual mesh, from left to right and from the bottom to the top. By so doing we obtain a symmetric linear system whose matrix form is:

[ A B B T C ] [ Φ c c Φ v c ] = [ F c c F v c ] (58)

where F c c is a subvector with c a r d ( P ) components, F c v is a subvector with c a r d ( D ) , A is a c a r d ( P ) × c a r d ( P ) symmetric matrix, C is a c a r d ( D ) × c a r d ( D ) symmetric matrix, B is a c a r d ( P ) × c a r d ( D ) matrix and B T it its associated transpose matrix. Note that the components of F c c and F v c depend on f.

4.3. The Mesh Data Structure and Connectivity between General Nodal and Its Neighbors

Global indices generally used for building the full system of equations over the computational domain while local indices are employed to define the local stencil for an element information that is useful during the discretization process. In this case system local indices are used interchangeably as global indices ( i , j ) , ( i + 1 2 , j + 1 2 ) local index , N global index because they can be readily translated to global indices and vice versa, as illustrated in Tables 1-3. As you can see on the equation systems (57) and (56), the unknowns located at the vertex of the primal cells have the half-integer indices, which complicates the task in terms of Matlab coding, to break obstacle we modify the local indices so as to have only integer indices, the numbering of the local indices remains unchanged. Prior to assembling the nodal equations in matrix form, each node needs to be assigned a unique number (global index), this because the solution to the system shown by Equation (58) is a vector [ Φ c c , Φ v c ] T i.e. it is a 1D column matrix, not a 2D matrix. Essentially this implies combining the new i and j indices into a

Table 1. Connectivity between indices and coordinates of the associated node case of Dirichlet boundary conditions h = 0.5 .

Table 2. Connectivity between indices and coordinates of the associated nodes case of Neumann boundary conditions h = 0.5 .

Table 3. Connectivity between indices and coordinates of the associated nodes case of periodic boundary conditions h = 0.5 .

single index, which in fact is aforementioned unique number assigned to the node. But this case does not fulfill these requirements because the unknowns located on the Eastern Γ E and Western Γ W boundary are equal, similarly for those on the Northern Γ N and Southern Γ S boundary. This requires special treatment afterwards. We start by showing the full matrix assembly strategy. This requires writing the function named IndexGlobalnode which takes as input the global index and the mesh size h and as output the associated local indices, then the function Globalnode Index which takes as input the local index, the mesh size h and returns global index. Let us set a general nodal point P associated to the global index k nodal located inside the domain, which can be a vertex or a center of the primary mesh. This general nodal point P as you can see in Figure 7 is defined by its neighbors nodes on the West, East, North, South, North-West, North-East, South-west and South-East are defined as follow; W, E,

Figure 7. Grid showing both node numbers and general nodal point K with its neighbors in the case of periodic boundary conditions. (left) Connectivity node and its neighbors in the primal cell: K N 2 : right Connectivity node and its neighbors in the dual cell: K N 2 + 1 .

N, S, NE, NW, SW and SE. The discretized Equations (56) and (57) have found to take the following general form (59). So we have all gradients to assemble the matrix in Dirichlet and Neumann boundary case. Let’s now examine the periodic boundary case.

C P φ P + n C n b φ n b = f P (59)

where indicates summation overall neighboring nodes (nb), C n b are the neighboring coefficients C W , C W , C S , C N , C N E , C N W , C S E , C S W and φ n b are the approximate values of pressure at the neighboring nodes. Table 2 shows the connectivity between the indices and the coordinates of the associated nodes in the case of Neumann boundary conditions. We can see that the boundary nodes are unknowns. However for the periodic case, we select from Table 3 only the nodes belonging to Ω ¯ \ ( Γ N Γ E ) of discretization domain, keeping in mind that to get the others by periodicity. Matlab offers several ways (meshgrid, ndgrid) to generate the list of nodes and the corresponding coordinates. The challenge remains to find the connectivity between the neighboring nodes constituting the nine point stencil. Figure 7 illustrates how we proceed to convert Equations (56) and (57) in the form (59).

5. Numerical Results

In this section, we confirm with some numerical tests the theoretical results we have proven in the previous section. For each test-case, a uniform rectangular mesh is used with different levels of refinement materialized by successive decreasing values assigned to the mesh size h = 1 N . In the following test-cases we have taken: h = 1 4 , 1 8 , 1 16 , 1 32 and 1 64 .

5.1. Notations

In the following tables, ndu denotes the number of discrete unknowns. Recall that | . | A stands for the discrete H 0 1 - norm and let . 1, A denote the discrete H 1 -norm defined as:

v 1, A = [ | v | A 2 + v L 2 ( Ω ) 2 ] 1 2 (60)

When the exact solution is available, the relative discrete L 2 -norm of the error for the exact potential is defined as:

e r L 2 = ( P P m e a s ( C P ) [ φ ( x p ) φ ¯ P ] 2 P P m e a s ( C P ) [ φ ( x p ) ] 2 ) 1 2

Defined by analogy, e r . 1, A is the relative discrete H 1 -norm of the error for the exact potential. For a given mesh, since different levels i of refinement may be considered, we denote by e r L 2 ( i ) and e r . 1, A ( i ) the corresponding relative discrete L 2 -norm and relative discrete H 1 -norm of the exact potential. Let us set for any integer i (with i 2 ):

r a L 2 ( i ) = 2 l n [ e r L 2 ( i ) ] l n [ e r L 2 ( i 1 ) ] l n [ n d u ( i ) ] l n [ n d u ( i 1 ) ]

We define r a . 1, A ( i ) , for any integer i 2 , with the same relation as for r a L 2 ( i ) , except that in this relation e r L 2 ( i ) is replaced with e r . 1, A ( i ) . On the other hand, e r f l m stands for L -norm of the error on the exact mean value of the flux across the mesh edges. So we have:

e r f l m = max σ E 1 m e a s ( σ ) | Q σ Q ¯ σ |

where Q σ and Q ¯ σ are respectively the exact and the approximate flux across σ which is either a primal edge or a dual edge. The symbol e r L denotes the pressure error for L -norm.

Let o c v [ × × × ] denote the error order of convergence to zero for the norm [ × × × ] which may be taken to be one of the following norms . L 2 , . 1, A and . L . The first two norms are used for pressure error estimates while the last one serves for the flux error estimate. The quantity o c v [ × × × ] is defined as:

o c v [ × × × ] = l n ( e r [ × × × ] ( i m a x ) l n ( e r [ × × × ] ( i m a x 1 ) ) ) l n ( h i m a x ) l n ( h i m a x 1 )

where i m a x is the maximum level of refinement of a given primal mesh.

At last, we denote by s l o p e [ × × × ] the error order of convergence to zero for the norm [ × × × ] when computed with the least-square method. The quantity s l o p e [ × × × ] obeys the relation:

l n [ e r [ × × × ] ( i ) ] = s l o p e [ × × × ] l n [ h ( i ) ] + ν ,

where ν is a real number.

5.2. Test Problems

We consider two groups of test problems. In the first group, the medium is homogeneous and so is spatially periodic. In the second group, the medium is taken to be heterogeneous and spatially periodic.

5.2.1. Group I

We consider in this group two cases: a homogeneous isotropic medium and a homogeneous anisotropic medium.

Data from Test problem 1: The medium Ω = ] 0 ; 1 [ × ] 0 ; 1 [ is associated with the following diffusion coefficient matrix.

K ( x , y ) = [ 1 0 0 1 ] (61)

The exact solution to Equations (1) such that:

Ω u ( x ) d x = 0 (62)

is

u ( x , y ) = sin ( 2 π x ) sin ( 2 π y ) .

Note that it is easy to determine the corresponding (source term) function f and check that this function satisfies the compatibility condition (12). The same remark remains valid for all the test problems analyzed in this section.

According to Table 4, DDFV computations of the approximate solution to Test problem number one display a quadratic convergence for L 2 -norm and discrete H 1 -norm concerning the pressure. The same rate of convergence is observed for . -norm concerning the interface fluxes. The quadratic convergence for L 2 -norm and discrete H 1 -norm numerically obtained in the homogeneous diffusion analyzed here is not in contradiction with our theoretical results. Indeed, the order one of convergence is based upon much weaker assumptions on the diffusion coefficient which is supposed to be piecewise constant. Note that similar results have been obtained for Dirichlet and Neumann boundary conditions by diverse authors in FVCA5 Benchmark [11].

Table 4. Convergence rate of flux and pressure errors for L -norm, L 2 -norm and discrete H 1 -norm in Test-problem number 1.

Data from Test-problem 2: Let Ω = ] 0 ; 1 [ × ] 0 ; 1 [ be a square with the following diffusion coefficient:

K ( x , y ) = [ 1 1 / 2 1 / 2 1 ] (63)

The exact solution to (1) - (11) such that

Ω u ( x , y ) d x = 0 (64)

is

u ( x , y ) = sin ( 2 π x ) cos ( 2 π y ) .

Results from Table 5 confirm the comment we have developed about the homogeneous flow in Ω exposed in Table 1. The result trends do not change even if one considers homogeneous media with contrasting diffusion coefficients like

K ( x ) = [ 1 10 10 1000 ] (65)

5.2.2. Group II

Now we consider a nonhomogeneous isotropic and anisotropic porous domain Ω . Computation results are presented in (Table 6) below.

Data for Test-problem 3: We have taken Ω = ] 0 ; 1 [ × ] 0 ; 1 [ associated with the following diffusion coefficient:

K ( x , y ) = [ 2 sin ( π x ) sin ( π y ) sin ( π x ) sin ( π y ) 1 ]

The exact solution to the system (1) - (11) such that

Ω u ( x , y ) d x = 0 (66)

is what follows:

u ( x , y ) = 2 sin [ π ( x + y ) ] cos [ π ( x + y ) ] .

Table 5. Convergence rate of flux and pressure errors for L -norm, L 2 -norm and discrete H 1 -norm in Test-problem number 2.

Table 6. Convergence rate of pressure error for L -norm, L 2 -norm and for discrete H 1 -norm in Test-problems 3 and 4.

Data for Test-problem 4: Let Ω be the square ] 0 ; 1 [ × ] 0 ; 1 [ associated with the following diffusion coefficient:

K ( x ) = ( [ 1000 0 0 1000 ] if x [ 1 4 ; 3 4 ] × [ 1 4 ; 3 4 ] [ 750 0 0 2000 ] otherwise . (67)

The exact solution to the system (1) - (11) such that

Ω u ( x , y ) d x = 0 (68)

is what follows:

u ( x , y ) = 2 sin [ π ( x + y ) ] cos [ π ( x + y ) ] .

5.2.3. Concluding Remarks

The numerical simulations in comparison with the exact solutions show the accuracy of the method as you can observe it in Figure 8 and Figure 9.

The numerical experiments were performed on uniform square meshes and have shown that:

1) For isotropic homogeneous media, one gets a quadratic convergence of the approximate pressure for L -norm, L 2 -norm and discrete H 1 -norm as well. The same convergence rate is observed concerning the flux for the vector max-norm. These results are in accordance with those published in the Finite Volume literature (see test-problem number 1).

2) For anisotropic homogeneous media, one can see that the rate of convergence remains globally the same, except for the L -norm that displays a linear convergence (see test-problem number 2).

3) For spatially varying diffusion coefficients D, the cell mean value of D is taken to be the cell-center diffusion coefficients. Approximations of pressure are performed with the order one of convergence for L -norm and discrete H 1 -norm

Figure 8. A numerical solution test-problem Group I h = 1 2 6 LEFT: Approximation solution; Right: Exact solution.

Figure 9. A numerical solution test-problem Group II h = 1 2 6 LEFT: Approximation solution; Right: Exact solution.

while a 1.50 order of convergence is got for L 2 -norm (see test-problem number 3).

4) For piecewise constant diffusion coefficients D, the same results as for spatially varying diffusion coefficients are obtained except for the L -norm that led to a 0.5 order of convergence (see test-problem number 4).

Conflicts of Interest

The authors declare no conflicts of interest regarding the publication of this paper.

References

[1] Njifenjou, A. and Moukouop-Nguena, I. (2001)) Traitement des anisotropies de perméabilité en simulation d’écoulement en milieu poreux par les volumes finis. Systèmes Informatiques pour la Gestion de l’Environnement, Douala, 22-25 October 2001, 245-259.
[2] Njifenjou, A. and Moukouop-Nguena, I. (2006) A Finite Volume Approximation for Second Order Elliptic Problems with a Full Matrix on Quadrilateral Grids. International Journal on Finite, 3, 1-30.
[3] Domelevo, K. and Omnès, P. (2005) A Finite Volume Method for the Laplace Equation on Almost Arbitrary Two-Dimensional Grids. ESAIM: Mathematical Modelling and Numerical Analysis, 39, 1203-1249.
https://doi.org/10.1051/m2an:2005047
[4] Hermeline, F. (2003) Approximation of Diffusion Operators with Discontinuous Tensor Coefficients on Distorted Meshes. Computer Methods in Applied Mechanics and Engineering, 192, 1939-1959.
https://doi.org/10.1016/S0045-7825(02)00644-8
[5] Njifenjou, A. and Kinfack, A.J. (2008) Convergence Analysis of an MPFA Method for Flow Problems in Anisotropic Heterogeneous Porous Media. International Journal of Pure and Applied Mathematics, 5, 35-86.
[6] Njifenjou, A., Donfack, H. and Moukouop-Nguena, I. (2013) Analysis on General Meshes of a Discrete Duality Finite Volume Method for Subsurface Flow Problems. Computational Geosciences, 17, 391-415.
https://doi.org/10.1007/s10596-012-9339-6
[7] Donfack, H., Njifenjou, A. and Jeutsa, A.K. (2019) A Discrete Duality Finite Volume Method for Flow Problems with Prescribed Periodic Boundary Conditions. Development and Mathematical Analysis of Finite Volumes for Complex Physics, 50 p.
[8] Abdullah, A.N. and Omar, B.H. (2018) Numerical Treatment of Initial-Boundary Value Problems with Mixed Boundary Conditions. American Journal of Computational Mathematics, 8, 153-174.
https://doi.org/10.4236/ajcm.2018.82012
[9] Hermeline, F. (2007) A Finite Volume Method for Approximating 3D Diffusion Operators on General Meshes. Computer Methods in Applied Mechanics and Engineering, 196, 2497-2526.
https://doi.org/10.1016/j.cma.2007.01.005
[10] Kinfack, A., Njifenjou, A. and Nganhou, J. (2012) Convergence Analysis Unstructured Meshes of a DDFV Method for Flow Problems with Full Neumann Boundary Conditions. Journal of Applied Mathematics, 2016, Article ID: 5891064.
https://doi.org/10.1155/2016/5891064
[11] Herbin, R. and Hubert, F. (2008) Benchmark on Discretization Schemes for Anisotropic Diffusion Problems on General Grids. In: Eymard, R. and Herard, J.M. Eds., Finite Volume for Complex Applications V, John Wiley & Sons, France, 659-692.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.