Discrete Duality Finite Volume for Anisotropic Diffusion Problems with Prescribed Robin Boundary Conditions

Abstract

This paper presents and analyzes a Discrete Duality Finite Volume (DDFV) method to solve 2D diffusion problems under prescribed Robin boundary conditions. The derivation of a symmetric discrete problem is established. The existence and uniqueness of a solution to this discrete problem are shown via the positive definiteness of its associated matrix. We show that the discrete scheme meets the Neumann problem when the parameter α0 (and, in a sense, when α the Dirichlet problem). This work is a continuation of our work regarding the development of DDFV methods. The main innovation here is taking into account Robin’s boundary conditions. We provide a few steps of Matlab implementation and numerical tests to confirm the effectiveness of the method.

Share and Cite:

Donfack, H. (2025) Discrete Duality Finite Volume for Anisotropic Diffusion Problems with Prescribed Robin Boundary Conditions. Journal of Applied Mathematics and Physics, 13, 4016-4045. doi: 10.4236/jamp.2025.1311225.

1. Introduction and the Model Problem

Numerical methods play a crucial role in approximating solutions to complex mathematical problems that cannot be solved analytically. The discrete duality finite volume (DDFV) method is one of the new generation finite volumes, very popular today in Geoscience Engineering. The work from [1]-[5] has 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 work is to formulate and conduct a theoretical analysis of the flux-based DDFV method on general grids for flow problems in polygonal anisotropic nonhomogeneous media under Prescribed Robin Boundary conditions, which is the combination of Dirichlet and Neumann boundary conditions.

It is important to note that the DDFV methods come from two formulations. The first, known as the flux-based DDFV, focuses on interface flux computations for primary and dual meshes, ensuring interface flux continuity. This approach was pioneered by [4] and [5]. The second formulation, known as the gradient-based DDFV, is based on pressure gradient reconstructions over a diamond grid, first introduced in [3]. This second formulation has been further developed by mathematicians such as Andreianov, Boyer, and Hubert, who have extended key ideas to nonlinear operators of the Leray-Lions type (see [7]). Motivated by the potential for increasing the order of convergence of the gradient-based method for nonlinear operators, Boyer and Hubert proposed the modified DDFV in [8]. Here, “flux” refers to the outward normal component of the Darcy velocity on cell boundaries.

Donfack and Jeutsa [9] presented a DDFV method for 2-D flow problems in nonhomogeneous anisotropic porous media under diverse boundary conditions. They focus on the case of Dirichlet, full Neumann and periodic boundary conditions, taking into account the periodicity. They use the discrete gradient defined in diamond cells to compute the fluxes. Matlab code was also developed for algebraic equations.

Martin et al. [10] proposed a DDFV method for non-overlapping optimized Schwarz method with Robin transmission conditions to solve anisotropic diffusion problems, taking into account the anisotropic diffusion across sub-domain interfaces. They prove convergence using energy estimates for general decomposition, including cross points and fully anisotropic diffusion. Their analysis reveals that primal and dual meshes might be coupled using different optimized Robin parameters in the optimized Schwarz methods.

Njifenjou et al. [6] presented and analyzed, on unstructured grids, a discrete duality finite volume method for 2D flow problems in nonhomogeneous anisotropic porous media. For presenting our DDFV formulations, let us consider the 2D diffusion problem: Find a function ϕ defined in Ω ¯ , that satisfies the following partial differential equation:

div( Aϕ )+cϕ=finΩ (1.1)

αϕ+( nAϕ )=gonΓ=Ω (1.2)

where f,g,α>0 and c are given functions, Γ is the boundary of Ω, n is the outward unit normal to the boundary and Ω ¯ is a closure of Ω that is a given open polygonal domain (not necessarily convex). On the other hand, A=A( x ) , with x= ( x 1 , x 2 ) t Ω is a piecewise constant in Ω and is symmetric, that is,

A ij ( x )= A ji ( x )1i;j2 (1.3)

δ ± + * suchthatξ 2 , δ ξ 2 ξ T A( x )ξ δ + ξ 2 (1.4)

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

The existence and uniqueness results of Equations (1.1) and (1.2) are well documented in the literature and summarized by the following propositions. See, for example, reference [11] for more details.

Proposition 1.1. Assume that f L 2 ( Ω ) , g L 2 ( Γ ) , c L ( Ω ) , α L ( Γ ) and V= H 1 ( Ω ) . Let vV , then

a( ϕ,v )=l( v ) (1.5)

where

a( ϕ,v )= Ω ( Aϕ,v+cϕv )dx + Γ α γ 0 ( ϕ ) γ 0 ( v )dΓ

l( v )= Ω fvdx + g γ 0 ( v )dΓ

with ϕV , defines a variational formulation for problem model (1.1) and (1.2).

Proposition 1.2. Under the assumptions (1.3) and (1.4), f L 2 ( Ω ) , c L ( Ω ) , α L ( Γ ) , g L ( Γ ) , α0 . Then the problem (1.5) has one and only one solution.

Proof. It follows from the Lax-Milgram theorem □

For sake of simplicity in the presentation, we will consider the functions α and c as positive constants.

2. The Discrete Problem: Existence and Uniqueness

We start with exhibiting the discrete problem. Then, after we focus on the existence and uniqueness of a discrete solution.

2.1. Discretization Domain

Figure 1. Example of primary matching unstructured mesh.

The DDFV theory exposed here is inspired by the one developed in [6]. Therefore, our exposition is based upon a primal mesh, an auxiliary mesh and the associated dual mesh clearly defined in what follows. The spatial domain Ω is split into a family of convex open polygons with matching interfaces. This family defines what is called primal mesh denoted by . Figure 1 below illustrates an example of a primal mesh made up of convex polygons. Following an original idea from [6] one can introduce an auxiliary mesh denoted by A . This mesh plays a key role in either the construction of our DDFV scheme or the stability analysis and error estimates developed later. For deriving an auxiliary mesh from a given primal mesh, one starts with arbitrary fixing one point per internal edge. Let denote by int the set of these edge-points. For a good understanding of the way the auxiliary mesh should be built, one should know the concept of neighboring edge-points introduced in [6]. Two edge-points are neighboring if they share a primal cell and their corresponding edges intersect at the same vertex of this primal cell. The auxiliary mesh A is generated by joining with a straight line all neighboring edge-points (see Figure 2). Note that this auxiliary mesh permits us to fix perimeters in which should necessary be located a finite family of primal cellpoints of ensuring the regularity of the gridding. There is a trivial bijective map between the family of cellpoints and the family of primal cells. So, to any cellpoint P one may associate a unique primal cell denoted by C P , and vice versa. It is then clear that both families could be indexed by . Joining any cellpoint with any edgepoint sharing the same primal cell leads is called (in the sequel) a dual mesh. (see Figure 3)

Figure 2. A primary mesh and the associated auxiliary mesh (dooted lines), including edgepoints and cellpoints in black and blue colors.

Figure 3. Combination of a primary mesh and the associated dual mesh (red discontinuous lines) including the auxiliary mesh.

Main Assumption

  • We assume that the primary mesh is compatible with the discontinuities of the permeability tensor A defined in Ω.

  • The Permeability discontinuities divide Ω into a finite number of convex polygonal subsets denoted by { Ω s } sS .

We suppose that the restriction over Ω ¯ s of the exact solution ϕ to Equations (1.1)-(1.2), denoted by ϕ| Ω s , satisfies the following property:

ϕ| Ω s C 2 ( Ω ¯ s )sS (2.1)

2.2. DDFV Formulation of the Model Problem

We shall now focus on a DDFV formulation of the problem (1.1)-(1.2) which involves as discrete unknowns and { ϕ D * } D * D expected to be close approximations of (cell-point pressures) and { ϕ ¯ D * } D * D (vertex-point pressures) respectively where ϕ P =ϕ( x 1 P , x 2 P ) and ϕ D =ϕ( x 1 D , x 2 D ) and where D represent the dual mesh. As developed in [6], we are inspired to present the DDFV theory here.

2.2.1. DDFV Flux Approximation in Primal and Dual Cells

Consider C P as a primary cell, with P representing the corresponding cell point. We integrate both sides of the balance Equation (1.1) within C P . The application of Ostrogradsky’s theorem to the integral on the left-hand side of this equation involves computing the flux across the boundary C P .

σ C P C P Aϕ η C P dγ Flux +c C P ϕdx = C P fdx (2.2)

where η C P is the unit normal to the boundary of C P

Using a suitable quadrature formula for approximating this flux, a discrete balance equation is derived. To illustrate our ideas, we consider an edge σ=[ A * B * ] associated with the primary cell C P see Figure 4.

Figure 4. Two molecules for a DDFV computation of the flux across the edge σ=[ A * B * ] . Left: [ A * B * ] lies inside Ω, Right: [ A * B * ] is part of the boundary of Ω.

Let A P be the absolute permeability tensor of the cell C P . Denoted by ξ [ A * B * ] P the unit normal vector to [ A * B * ] exterior to C P , the flux expression over the edge [ A * B * ] viewed as part of the boundary of C P is given by

F [ A * B * ] P = A * I ϕ( A P ξ [ A * B * ] P )dγ I B * ϕ( A P ξ [ A * B * ] P )dγ (2.3)

Before starting with the flux computations across the subedges [ A * I ] and [ I B * ] , let us set

Then, it is easily seen that the following identity holds:

A P ξ [ A * B * ] P = a h ( A P ) σ P + b h ( A P ) τ A * B * (2.4)

where the real numbers a h ( A P ) and b h ( A p ) are given by the relations

a h ( A P )= ( ξ [ A * B * ] P ) t A P ξ [ A * B * ] P cos( θ h P,I )

b h ( A P )= ( ξ [ PI ] A * ) t A P ξ [ A * B * ] P cos( θ h P,I )

θ h P,I =mes( σ P , ξ [ A * B * ] P ^ )

Using assumption (2.1), the decomposition (2.4) and the Taylor expansion series the flux through the edge σ=[ A B ] is written as follows

F [ A B ] P = b h ( A P )( ϕ A ϕ I )+ a h ( A P ) h I A h PI ( ϕ P ϕ I )+ T [ A I ] P + b h ( A P )( ϕ I ϕ B )+ a h ( A P ) h I B h PI ( ϕ P ϕ I )+ T [ I B ] P = b h ( A P )( ϕ A ϕ B )+ a h ( A P ) h A B h PI ( ϕ P ϕ I )+ T [ A B ] P (2.5)

where h I A * =| I A * |, h I B * =| I B * |, h PI =| PI | and the truncation errors T [ A * I ] P ,  T [ I B * ] P are given by

T [ A * I ] P = a h ( A P ) 2 [ h I A * 2 ( σ P ) t ϕ ( M ) τ A * B * h I A * h IP σ P t ϕ ( Q ) σ P ] T [ I B * ] P = a h ( A P ) 2 [ h I B * 2 ( σ P ) t ϕ ( N ) τ A * B * h I A * h IP σ P t ϕ ( Q ) σ P ] T I[ A * B * ] = T [ A * I ] P + T [ I B * ] P (2.6)

with M[ A * ,I ],Q[ P,I ],N[ B * ,I ] and ϕ ( . ) being the Hessian of ϕ . Note that ϕ ( . ) exists, thanks to Equation (2.1).

For estimating the truncation error T I[ A * B * ] , we start with some useful notations. First of all, recall that is the set made of edge-points (from the primary mesh of course). We denote by int the subset of made up of edge-points lying on Ω, ext the subset of made up of edge-points lying on the boundary of Ω, and P (for ) the subset of made up of edge-points lying on the boundary of the primary cell C P .

Remark 2.1. Note that the set will sometimes be identified with the set of primary edges since there is a trivial bijection between the two sets. In the same order of ideas, the set of cellpoints and the set of vertices will sometimes be identified with the set of primary cells and the set D of dual cells, respectively. At last, primary mesh and primal mesh mean the same thing in this work [6].

Definition 2.2. The system defines a regular mesh if the following condition is fulfilled: There exists θ] 0, π 2 [ , not depending on h, such that

(2.7)

Ingredients are gathered for estimating truncation errors. In this connection, it is easily seen that the following result holds:

Proposition 2.3. Assume that the mesh system defines a regular mesh system in the sense of the previous definition and that there exists 0<ϖ<1 , mesh independent, such that

(2.8)

where A I * , B I * D are extremities of the only edge (from the cell C P ) involving the edge-point I .

Under the assumptions (2.1) and Equation (2.7), there exists a strictly positive number C , mesh independent, such that

| T [ A * B * ] P |C h 2 (2.9)

The relation (2.9) is a consistency property and so naturally allow us to approximate F [ A * B * ] P as follows:

F [ A * B * ] P b h ( A P )( ϕ A * ϕ B * )+ a h ( A P ) h A * B * h PI ( ϕ P ϕ I ) (2.10)

When [ A * B * ] is part of the domain boundary, the edge pressure ϕ I is determined by the Robin conditions. it is worth noting that in this case, both points A * and B * must be situated on the boundary as well. However, if [ A * B * ] serve as an interface between cell C P and some primary cell denoted by C L , the edge pressure ϕ I is an auxiliary unknown. But, thanks to the principle of flux continuity, one can approximate it with a linear function of ϕ P , ϕ L , ϕ A * , and ϕ B * . For investigating the above-mentioned linear function, we compute the flux across [ A * B * ] viewed as part of the boundary of C L . For this purpose, we set

A L ξ [ A * B * ] L = a ^ h ( A L ) σ L + b ^ h ( A L ) τ A * B * (2.11)

where the real numbers a ^ h ( A L ) and b ^ h ( A L ) are given by the relations

a ^ h ( A L )= ( ξ [ A * B * ] P ) t A L ξ [ A * B * ] P cos( θ h L,I )

b ^ h ( A L )= ( ξ [ IL ] A * ) t A L ξ [ A * B * ] P cos( θ h P,I )

θ h L,I =mes( σ L , ξ [ A * B * ] P ^ )

where ξ [ IL ] A * denotes the unit normal vector to [ IL ] exterior to the triangle ( LI A * ) . Performing flux computation over the interelement [ A * B * ] , viewed as part of the boundary of C L (see Figure 4) leads to

F [ A * B * ] L = b ^ h ( A L )( ϕ B * ϕ A * )+ a ^ h ( A L ) h A * B * h IL ( ϕ L ϕ I )+ T [ A * B * ] L (2.12)

where for a fixed Q[ IL ] and fixed M,N[ A * B * ] , we have set

T [ A * B * ] L = a ^ h ( A L ) 2 [ h I A * 2 ( σ L ) t ϕ ( M ) τ A * B * + h I B * 2 ( σ L ) t ϕ ( N ) τ A * B * h A * B * h IP σ L t ϕ ( Q ) σ L ] (2.13)

Thus, this flux can be approximated with the expression

F [ A * B * ] L b ^ h ( A L )( ϕ B * ϕ A * )+ a ^ h ( A L ) h A * B * h IL ( ϕ L ϕ I ) (2.14)

The 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 = h IP h IL h IL a h ( A P )+ h IP a ^ h ( A L ) { a h ( A P ) h IP ϕ P + a ^ h ( A L ) h IL ϕ L + 1 h A * B * ( b h ( A P ) b ^ ( A L ) )( ϕ A * ϕ B * ) } (2.15)

for all I int .

This is a consistent approximation for ϕ I in the sense that the corresponding truncation error vanishes when h goes to zero. So, replacing ϕ I in Equation (2.14) by its approximate value yields the following conservative scheme:

F [ A * B * ] P [ a h ( A P ) b ^ h ( A L ) h IL + h IP a ^ h ( A L ) b h ( A P ) h IL a h ( A P )+ h IP a ^ h ( A L ) ]( ϕ A * ϕ B * ) +[ a h ( A P ) a ^ h ( A L ) h A * B * h IL a h ( A P )+ h IP a ^ h ( A L ) ]( ϕ P ϕ L ) (2.16)

Case where I P Ω : How can we approximate ϕ I ?

Recall that: αϕ( ηAϕ )=g on Γ=Ω .

[ A * B * ] αϕdγ [ A * B * ] Aϕ η Ω dγ = [ A * B * ] gdγ F [ A * B * ] P =α h [ A * B * ] ϕ I [ A * B * ] gdγ (2.17)

substituting the value of F [ A * B * ] P from Equation (2.17) and simplifying, we have the following

ϕ I = 1 ( α h IP + a h ( A P ) ) h A * B * { h IP b h ( A P )( ϕ A * ϕ B * )+ a h ( A P ) h A * B * ϕ P } + h IP ( α h IP + a h ( A P ) ) h A * B * [ A * B * ] gdγ (2.18)

substituting ϕ I as given in Equation (2.18) into (2.17), we have the following flux approximation for boundary primal cell

F [ A B ] P =α h A B ϕ I [ A B ] gdγ = I P ext [ α h IP b h ( A P ) α h IP + a h ( A P ) ( ϕ A ϕ B )+ α a h ( A P ) h A B α h IP + a h ( A P ) ϕ P ] + I P ext a h ( A P ) α h IP + a h ( A P ) [ A B ] gdγ (2.19)

Using the previous notations and thanks to the consistency of the previous DDFV flux approximations, the approximate flux balance equation within C P is

(2.20)

where A * and B * are extremities of the edge containing I and lying on the boundary of the primary cell C P and where is such that C ¯ P C ¯ L =[ A * B * ] .

2.2.2. DDFV Flux Approximation in Dual Cells

It is clear that the number of discrete unknowns and { ϕ P * } P * D is greater than the number of discrete balance equations given by the system of Equation (2.20) valid for all . 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 B * . For carrying out our technique, we need to introduce the notion of pseudo-edge associated with dual cells see Figure 5.

Figure 5. Illustration of a dual cell (blue dotted line) with its four pseudo-edges that intersect primal edges at the red point interface of .

Definition 2.4. Let P and L be two cellpoints from the primary mesh (that is, ) such that the corresponding primary cells C P and C L are adjacent, and consider I P L (recall that E , for , is the set of edge-points from lying on the boundary of cell C E ). The line [ PI ][ IL ] defines a pseudo-edge, denoted by PIL , whose extremities are P and L . We will say that a pseudo-edge is associated with a dual cell C B * if it is part of the boundary of C B *

Remark 2.5. Note that the boundary of any dual cell is a union of finite number of pseudo-edges.

Now, we will examine discrete balance equations across dual cells. This process involves the following steps: We begin by integrating both sides of Equation (1.1) within a dual cell C B * as depicted in Figure 3. The application of Ostrogradski’s theorem and the utilization of Remark (2.5) result in:

I B [ PIL ] Aϕ η B dγ +c C B ϕdx = C B fdx (2.21)

where η B * is the outward unit normal vector of the boundary of C B * and [ PIL ] is a pseudo-edge associated with the dual cell C B * . Recall that ε B * is the set of edge points lying in the boundary of the dual cell C B * . We will seek a flux approximation along the pseudo-edge [ PIL ] , considering it as a segment of the boundary of C B * . Denoting the exact flux over [ PIL ] as F [ PIL ] B * , it can be expressed by the following relation:

F [ PIL ] B * = [ PI ] ϕ( A P ξ [ PI ] B * )dγ [ IL ] ϕ( A L ξ IL B * )dγ = F [ PI ] B * + F [ IL ] B * (2.22)

Initially, our attention should be directed towards computing the flux across [ PI ] . Therefore, let’s define the subsequent decomposition of A P ξ [ PI ] B * :

A P ξ [ PI ] B * = c h ( A P ) σ P d h ( A P ) τ A * B * (2.23)

It is clear that

c h ( A P )= b h ( A P )

d h ( A P )= ( ξ [ PI ] B * ) t A P ξ [ PI ] B * cos( θ h P,I )

Therefore

F [ PI ] B * = [ PI ] ϕ( A P ξ [ PI ] B * )dγ = b h ( A P ) [ PI ] ϕ σ P dγ + d h [ PI ] ϕ τ A * B * dγ = b h ( A P )( ϕ P ϕ I )+ h PI h A * B * d h ( A P )( ϕ B * ϕ A * )+ T [ PI ] B * (2.24)

where

T [ PI ] B * = d h ( A P ) 2 [ h PI 2 ( τ h ) t ϕ ( Q PI ) σ P + h PI h I B * 2 h A * B * ( τ h ) t ϕ ( I B * ) τ h h PI h I A * 2 h A * B * ( τ h ) t ϕ ( I A * ) τ h ] (2.25)

with τ h = τ A * B * , Q PI [ PI ], Q I A * [ I A * ] and Q I B * [ I B * ] .

Neglecting T [ PI ] B * and exploiting Equation (2.15) yields the following approximation:

F [ PI ] B * h IP [ d h ( A P ){ h IL a h ( A P )+ h IP a ^ h ( A L ) }+ b h ( A P ) h IL { b ^ h ( A L ) b h ( A P ) } ] h A * B * [ h IL a h ( A P )+ h IP a ^ h ( A L ) ] ( ϕ B * ϕ A * ) 1 a ^ h ( A L ) b h ( A P ) h IP [ h IL a h ( A P )+ h IP a ^ h ( A L ) ] ( ϕ P ϕ L ) (2.26)

Likewise, let’s concentrate on computing the flux across [ IL ] . To achieve this, we establish the following setting:

A L ξ [ IL ] B * = c ^ h ( A L ) σ L d ^ h ( A L ) τ A * B * (2.27)

where

c ^ h ( A L )= b ^ h ( A L )

d ^ h ( A L )= ( ξ [ IL ] B * ) t A L ξ [ IL ] B * cos( θ h L,I )

Following the same procedure as for [ PI ] , we obtain

F [ IL ] L = c ^ h ( A L ) [ IL ] ϕ σ L dγ + d ^ h ( A L ) [ IL ] ϕ τ A * B * dγ = b ^ h ( A L )( ϕ I ϕ L )+ h IL h A * B * d ^ h ( A L )( ϕ B * ϕ A * )+ T [ IL ] B * (2.28)

where

T [ IL ] B * = d h ( A L ) 2 [ h IL 2 ( τ h ) t ϕ ( Q IL ) σ L + h IL h I B * 2 h A * B * ( τ h ) t ϕ ( I B * ) τ h h IL h I A * 2 h A * B * ( τ h ) t ϕ ( I A * ) τ h ] (2.29)

Neglecting the error term and substituting the value of ϕ I from Equation (2.28) yield

F [ IL ] B * h IL [ d ^ h ( A L ){ h IL a h ( A P )+ h IP a ^ h ( A L ) }+ b ^ h ( A L ) h PI { b h ( A P ) b ^ h ( A L ) } ] h A * B * [ h IL a h ( A P )+ h IP a ^ h ( A L ) ] ( ϕ B * ϕ A * ) 1 + b ^ h ( A L ) a h ( A P ) h IL [ h IL a h ( A P )+ h IP a ^ h ( A L ) ] ( ϕ P ϕ L ) (2.30)

Proposition 2.6. Under the same assumptions as those of Proposition 2.3, there exists a strictly positive number C , mesh independent, such that

| T [ PI ] B * |+| T [ IL ] B * |C h 2 (2.31)

We summarize the flux approximation across the pseudo-edge [ PIL ] in the following way:

F [ PIL ] B * b ^ h ( A L ) a h ( A P ) h IL + b h ( A P ) a ^ h ( A L ) h IP h IL a h ( A P )+ h IP a ^ h ( A L ) ( ϕ P ϕ L ) + w h ( P,L,I ) h A * B * [ h IL a h ( A P )+ h IP a ^ h ( A L ) ] ( ϕ B * ϕ A * ) 1 (2.32)

where we have set

w h ( P,L,I )=[ a h ( A P ) h IL + a ^ h ( A L ) h PI ]×[ d h ( A P ) h PI + d ^ h ( A L ) h IL ] + h PI h IL [ b ^ h ( A L ) b h ( A P ) ]×[ b h ( A P ) b ^ ( A L ) ] (2.33)

We have to compute the flux around the degenerated dual cells i.e. with I B Ω , we substitute ϕ I as given in Equation (2.15) into Equation (2.28). That is

F PI B * =[ b h ( A P )( ϕ P ϕ I )+ h PI h A * B * d h ( A P )( ϕ B * ϕ A * ) ] = I B * ext [ α b h ( A P ) h IP α h IP + a h ( A P ) ϕ P + h IP ( α d h ( A P ) h IP +( a h ( A P ) d h ( A P ) b h 2 ( A P ) ) ) h A * B * ( α h IP + a h ( A P ) ) ( ϕ A * ϕ B * ) 1 ] I B * ext b h ( A P ) h IP ( α h IP + a h ( A P ) ) h A * B * [ A * B * ] gdγ (2.34)

We deduce from the previous developments that the discrete balance equation in any dual cell C B * reads

I B * int { b ^ h ( A L ) a h ( A P ) h IL + b h ( A P ) a ^ h ( A L ) h PI [ h IL a h ( A P )+ h IP a ^ h ( A L ) ] ( ϕ P ϕ L ) + w h ( P,L,I ) h A * B * [ h IL a h ( A P )+ h IP a ^ h ( A L ) ] ( ϕ B * ϕ A * ) }+c B C B meas( C B ) ϕ B I B * ext [ α b h ( A P ) h IP α h IP + a h ( A P ) ϕ P + h IP ( α d h ( A P ) h IP +( a h ( A P ) d h ( A P ) b h 2 ( A P ) ) ) h A * B * ( α h IP + a h ( A P ) ) ( ϕ A * ϕ B * ) 1 ] =meas( C B * ) f B * + I B * ext [ b h ( A P ) h IP ( α h IP + a h ( A P ) ) h A * B * ] [ A * B * ] gdγ + I B * ext C B * Ω gdγ B * Dand B * D (2.35)

2.2.3. DDFV Scheme of the Model Problem (1.1)-(1.2)

From Equations (2.34) and (2.35), we define a DDFV formulation of the model problem (1.1)-(1.2) as: Find and { ϕ D * } D * D such that

(2.36)

I B * int { b ^ h ( A L ) a h ( A P ) h IL + b h ( A P ) a ^ h ( A L ) h PI [ h IL a h ( A P )+ h IP a ^ h ( A L ) ] ( ϕ P ϕ L ) + w h ( P,L,I ) h A * B * [ h IL a h ( A P )+ h IP a ^ h ( A L ) ] ( ϕ B * ϕ A * ) }+c B C B meas( C B ) ϕ B I B * ext [ α b h ( A P ) h IP α h IP + a h ( A P ) ϕ P + h IP ( α d h ( A P ) h IP +( a h ( A P ) d h ( A P ) b h 2 ( A P ) ) ) h A * B * ( α h IP + a h ( A P ) ) ( ϕ A * ϕ B * ) 1 ] =meas( C B * ) f B * + I B * ext [ b h ( A P ) h IP ( α h IP + a h ( A P ) ) h A * B * ] [ A * B * ] gdγ + I B * ext C B * Ω gdγ B * D (2.37)

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

Remark 2.7. If α=0 we obtain the balance equation of diffusion reaction problem with prescribed Neumann bounbary conditions which is written as follows

(2.38)

I B * int { b ^ h ( A L ) a h ( A P ) h IL + b h ( A P ) a ^ h ( A L ) h PI [ h IL a h ( A P )+ h IP a ^ h ( A L ) ] ( ϕ P ϕ L ) + w h ( P,L,I ) h A * B * [ h IL a h ( A P )+ h IP a ^ h ( A L ) ] ( ϕ B * ϕ A * ) }+c B C B meas( C B ) ϕ B

I B ext h IP ( a h ( A P ) d h ( A P ) b h 2 ( A P ) ) h A B ( ϕ A ϕ B ) =meas( C B * ) f B * + I B ext h IP b h ( A P ) h A B a h ( A P ) [ A B ] gdγ + I B * ext C B * Ω gdγ B * D (2.39)

Remark 2.8. When α and g=0 we recognize the balance equation of diffusion reaction problem with homogeneous Dirichlet bounbary conditions which is written as follows

(2.40)

I B * int { b ^ h ( A L ) a h ( A P ) h IL + b h ( A P ) a ^ h ( A L ) h PI [ h IL a h ( A P )+ h IP a ^ h ( A L ) ] ( ϕ P ϕ L ) + w h ( P,L,I ) h A * B * [ h IL a h ( A P )+ h IP a ^ h ( A L ) ] ( ϕ B * ϕ A * ) } +c B C B meas( C B ) ϕ B =meas( C B * ) f B * B * D (2.41)

3. Existence and Uniqueness for a Discrete Scheme

Assume that all the cellpoints and all the vertices (with respect to the primary mesh) are numbered. On the other hand and Card( D ) denote respectively the total number of cellpoints and vertices. A preliminary result is:

Proposition 3.1. Under the assumption (1.3)-(1.4), the matrix associated with the linear system (2.36)-(2.37) is symmetric and positive definite.

Proposition 3.2. Under the assumption (1.3)-(1.4), the linear system (2.36)-(2.37) possesses a unique solution.

It is sufficient to prove Proposition 3.1 as it implies Proposition 3.2.

Proof. It is easily seen that the symmetry of the matrix M associated with the linear system (2.36)-(2.37) essentially follows from the symmetry of the diffusion coefficient A . We now should prove the positive definiteness of that matrix.

Let us set:

(3.1)

M=[ A B B t D ] (3.2)

where

M[ ϕ cc ϕ vc ]=[ F cc F vc ] (3.3)

where A is a symmetric matrix, D is a Card( D )×Card( D ) symmetric matrix, B is a matrix and B t is the transpose of B . In this context, F cc represents a subvector with a number of components equal to derive from the right-hand side of Equation (2.36). Similarly, F vc is a subvector with Card( D ) components obtained from the right-hand side of Equation (2.37). We start by developing the quadratic expression

[ Φ cc , Φ vc ]M[ Φ cc Φ vc ]

of the system (2.36)-(2.37). It is clear that

(3.4)

where D is a set diamond cells (see Figure 6) and D σ σ a diamond cell whose diagonals are σ=[ A * B * ] and σ * =[ PL ] . This diamond cell is widely used to establish the stability result and error estimates. Set

A 11 PL = a h ( A P ) a ^ h ( A L ) h A * B * a h ( A P ) h IL + a ^ h ( A P ) h PI

A 22 PL = w h ( P,L,I ) h A * B * [ a h ( A P ) h IL + a ^ h ( A L ) h IP ]

A 12 PL = A 21 PL = c ^ h ( A L ) a h ( A P ) h IL + c h ( A P ) a ^ h ( A L ) h PI a h ( A P ) h IL + a ^ h ( A L ) h IP

A 11 PI = α a h ( A P ) h A * B * α h IP + a h ( A P )

A 22 PI = h IP ( α d h ( A P ) h IP +( a h ( A P ) d h ( A P ) b h 2 ( A P ) ) ) h A * B * ( α h IP + a h ( A P ) )

A 21 PI = 2α h IP b h ( A P ) α h IP + a h ( A P )

where are two adjacent primary cells sharing the edge [ A * B * ] as interface containing the edge-point I . Let us prove that the homogenized symmetric permeability tensor A PL is positive definite, that is A 11 PL A 22 PL ( A 21 PL ) 2 >0 . Setting

PL = A 11 PL A 22 PL ( A 21 PL ) 2 , (3.5)

we have that

Δ PL = N 1 [ a h ( A P ) d h ( A P ) ( b h ( A P ) ) 2 ]+ N 2 [ a ^ h ( A L ) d ^ h ( A L ) ( b ^ ( A L ) ) 2 ] (3.6)

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

N 1 = ( a ^ h ( A L ) h IL a h ( A P ) h IL + a ^ h ( A L ) h IP ) 2 + a h ( A P ) a ^ h ( A L ) h IP h IL [ a h ( A P ) h IL + a ^ h ( A L ) h IP ] 2 and N 2 = ( a h ( A P ) h IP a h ( A P ) h IL + a ^ h ( A L ) h IP ) 2 + a h ( A P ) a ^ h ( A L ) h IP h IL [ a h ( A P ) h IL + a ^ h ( A L ) h IP ] 2 (3.7)

Given that the diffusion coefficient A adhere to assumptions (1.3)-(1.4), symmetric and positive definite, Cauchy-Schwarz’s inequality applied to the inner product associated with A guarantees that

a h ( A P ) d h ( A P ) ( b h ( A P ) ) 2 >0 and a ^ h ( A L ) d ^ h ( A L ) ( b ^ ( A L ) ) 2 >0 (3.8)

Since either ξ [ A * B * ] P and ξ [ PI ] B * or ξ [ A * B * ] P and ξ [ IL ] B * are not collinear, it follows that Δ PL >0 . Consequently, A PL forms a symmetric positive definite matrix. For the second quadratic form, set

Δ PI =[ A 11 PI A 21 PI A 21 PI A 22 PI ] (3.9)

The second quadratic form is positive if

det( Δ PI )= A 11 PI A 22 PI ( A 21 PI ) 2 >0 (3.10)

We now show that the bilinear form is quadratic and elliptic. That is

det( Δ PI )=( α 2 h IP 2 +α a h ( A P ) h IP )( a h ( A P ) d h ( A P ) b h 2 ( A P ) )0 (3.11)

The Cauchy-Schwarz inequality for the inner product associated with A ensure that relation (3.11) is positive.

It follows from the previous step that the matrices A PL and A PI have respectively λ min PL and λ min PI as strictly positive eigenvalues. So, we have

(3.12)

The equality holds in Equation (3.12) if and only if Φ cc =0 and Φ vc =0 . Thus, the positive definiteness of the matrix M is proven.

4. DDFV Formulation of the Problem in Uniform Grid

In this section, we derive our discrete problem via the discrete balance equations over the primary and dual cell interfaces. We consider the domain Ω=] 0,1 [×] 0,1 [ covered with a primary mesh whose grid size is h= 1 N , where N is a given strictly positive integer. We denote by K ij the primary grid block given by

K ij =[ x i 1 2 , x i+ 1 2 ]×[ y j 1 2 , y j+ 1 2 ] where

x i+ 1 2 = x i 1 2 +h , y j+ 1 2 = y j 1 2 +h for i,j=1,2,3,,N1 .

We also consider a second grid block K i+ 1 2 ,j+ 1 2 centered in ( x i+ 1 2 , y j+ 1 2 ) and called dual grid block and defined by K i+ 1 2 ,j+ 1 2 =[ x i1 , x i+1 ]×[ y j1 , y j+1 ] where x i+1 = x i +h , y j+1 = y j +h for i,j=1,2,3,,N1 For any cell along the boundary of the domain, we adopt the convention x 1 2 = y 1 2 =0 , x N+ 1 2 = y N+ 1 2 =1 and x 0 = y 0 =0 , x N+1 = y N+1 =1 . We now focus our attention on finding for the unknowns ( φ i,j ) 1i,jN and ( φ i+ 1 2 ,j+ 1 2 ) 0i,jN which are reasonable approximate solutions of Equation (1.1)-(1.2), where φ i,j =φ( x i , y j ) and φ i+ 1 2 ,j+ 1 2 =φ( x i+ 1 2 , y j+ 1 2 ) . Figure 7 is a computational grid,

where the local coordinates are given by the integer and fractional indices. We give now a description of the procedure leading to the linear discrete system. Integrating the balance Equation (1.1)-(1.2) in the grid-block K i,j and K i+ 1 2 ,j+ 1 2 respectively, applying Ostrogradski’s theorem leads to compute fluxes through the boundary of K i,j and K i+ 1 2 ,j+ 1 2 as illustrated by Figure 7. The integration in primary cell K ij is a direct result of taking the interface flux values over i± 1 2 ,j and i,j± 1 2 as you can see in the following formulas.

Figure 7. 2D computational grid in uniform mesh with primal cells (black lines) and dual cells (black discontinuous lines).

K i,j div( A ij φ )dx = σ K i,j σ A ij φ η ij σ dσ = F i+ 1 2 ,j K i,j + F i 1 2 ,j K i,j + F i,j+ 1 2 K i,j + F i,j 1 2 K i,j 1i,jN (4.1)

Likewise the integration in primary cell K i+ 1 2 ,j+ 1 2 is a direct result of taking the flux values over i+ 1 2 ,j+1 , i+ 1 2 ,j , i+1,j+ 1 2 and i,j+ 1 2 as you can see in the following formulas.

K i+ 1 2 ,j+ 1 2 div( A i+ 1 2 ,j+ 1 2 φ )dx = σ K i+ 1 2 ,j+ 1 2 σ A i+ 1 2 ,j+ 1 2 φ η i+ 1 2 ,j+ 1 2 σ d σ = F i+ 1 2 ,j+1 K i+ 1 2 ,j+ 1 2 + F i+ 1 2 ,j K i+ 1 2 ,j+ 1 2 + F i+1,j+ 1 2 K i+ 1 2 ,j+ 1 2 + F i,j+ 1 2 K i+ 1 2 ,j+ 1 2 0i,jN (4.2)

4.1. Computation of Fluxes

Let us consider the segment [ A B ] delimited by points x i 1 2 ,j+ 1 2 and x i+ 1 2 ,j+ 1 2 (see Figure 7), le flux the edge [ A B ] seen as element of the primal cell K ij and denoted by F i,j+ 1 2 K i,j is calculated as follows.

F i,j+ 1 2 K i,j = [ A B ] A i,j φ η ij i,j+ 1 2 ds = [ A B ] [ A 11 i,j A 12 i,j A 21 i,j A 22 i,j ][ φ x φ y ],( 0 1 ) dx = [ A I ] ( A 21 i,j φ x + A 22 i,j φ y )dx [ I B ] ( A 21 i,j φ x + A 22 i,j φ y )dx

where η ij i,j+ 1 2 is the unit normal vector exterior from K i,j and I the midpoint or interface point of segment [ A B ] . We now use suitable gradient operators to compute the flux F i,j+1/2 K ij as follows

F i,j+ 1 2 K i,j = h 2 ( φ i,j+ 1 2 φ i 1 2 ,j+ 1 2 h 2 ) A 21 i,j h 2 ( φ i,j+ 1 2 φ i,j h 2 ) A 22 i,j h 2 ( φ i+ 1 2 ,j+ 1 2 φ i,j+ 1 2 h 2 ) A 21 i,j h 2 ( φ i,j+ 1 2 φ i,j h 2 ) A 22 i,j + T i,j+ 1 2 K i,j = A 21 i,j ( φ i+ 1 2 ,j+ 1 2 φ i 1 2 ,j+ 1 2 )+2 A 22 i,j ( φ i,j φ i,j+ 1 2 )+ T i,j+ 1 2 K i,j (4.3)

T i,j+ 1 2 K i,j represents the truncation error so that | T i,j+ 1 2 K i,j |Ch , where C is a mesh independent positive constant that depends exclusively on Ω. Considering the principle of flux continuity across the interface joining two adjacent cells K i,j and K i,j+1 we have that,

F i,j+ 1 2 K i,j = F i,j+ 1 2 K i,j+1

where, F i,j+1/2 K i,j+1 represents the flux over K ij+1 . We therefore obtain that the edge midpoint potential φ i,j+1/2 is given by

φ i,j+ 1 2 = 1 A 22 i,j + A 22 i,j+1 { A 21 i,j+1 A 21 i,j 2 ( φ i 1 2 ,j+ 1 2 φ i+ 1 2 ,j+ 1 2 )+ A 22 i,j φ i,j + A 22 i,j+1 φ i,j+1 } (4.4)

Substituting the edge midpoint potential φ i,j+1/2 in the flux equation F i,j+ 1 2 K i,j we obtain that

F i,j+ 1 2 K i,j = 2 A 22 i,j A 22 i,j+1 A 22 i,j + A 22 i,j+1 [ φ i,j φ i,j+1 ]+ A 22 i,j A 21 i,j+1 + A 22 i,j+1 A 21 i,j A 22 i,j + A 22 i,j+1 [ φ i 1 2 ,j+ 1 2 φ i+ 1 2 ,j+ 1 2 ]

If we perform similar calculations on the neighboring primal cells of K i,j that is on the cells, K i+1,j , K i1,j , K i,j+1 . We obtain the following balance equation in internal primary cell.

2 A 22 i,j A 22 i,j+1 A 22 i,j + A 22 i,j+1 [ φ i,j φ i,j+1 ]+ A 22 i,j A 21 i,j+1 + A 22 i,j+1 A 21 i,j A 22 i,j + A 22 i,j+1 [ φ i 1 2 ,j+ 1 2 φ i+ 1 2 ,j+ 1 2 ] + 2 A 22 i,j A 22 i,j1 A 22 i,j + A 22 i,j1 [ φ i,j φ i,j1 ]+ A 22 i,j A 21 i,j1 + A 22 i,j1 A 21 i,j A 22 i,j + A 22 i,j1 [ φ i+ 1 2 ,j 1 2 φ i 1 2 ,j 1 2 ] + 2 A 11 i,j A 11 i1,j A 11 i,j + A 11 i1,j [ φ i,j φ i1,j ]+ A 11 i,j A 12 i1,j + A 11 i1,j A 12 i,j A 11 i,j + A 11 i1,j [ φ i 1 2 ,j+ 1 2 φ i 1 2 ,j 1 2 ] + 2 A 11 i,j A 11 i+1,j A 11 i,j + A 11 i+1,j [ φ i,j φ i+1,j ]+ A 11 i,j A 21 i+1,j + A 11 i+1,j A 21 i,j A 11 i,j + A 11 i+1,j [ φ i+ 1 2 ,j 1 2 φ i+ 1 2 ,j+ 1 2 ] +meas( K i,j ) c ij φ i,j =meas( K i,j ) f i,j 2i,jN (4.5)

We develop in order to close system 4.1, the balance equations over the interface of the interior dual cell K i+ 1 2 ,j+ 1 2 (see Figure 7 for clarity), Following the same procedure as shown above when computing the balance equation for the primal cells using the dual cell K i+ 1 2 ,j+ 1 2 and the neighboring cells K i+ 1 2 ,j 1 2 , K i+ 1 2 ,j+ 3 2 , K i+ 3 2 ,j+ 1 2 and K i 1 2 ,j+ 1 2 , we obtain the balance equation.

A 11 i,j+1 A 21 i+1,j+1 + A 11 i+1,j+1 A 21 i,j+1 A 11 i,j+1 + A 11 i+1,j+1 [ φ i,j+1 φ i+1,j+1 ]+ A 11 i+1,j A 21 i,j + A 11 i,j A 21 i+1,j A 11 i,j + A 11 i+1,j [ φ i+1,j φ i,j ] + A 22 i+1,j A 12 i+1,j+1 + A 22 i+1,j+1 A 21 i+1,j A 22 i+1,j + A 22 i+1,j+1 [ φ i+1,j φ i+1,j+1 ]+ A 22 i,j+1 A 12 i,j + A 22 i,j A 12 i,j+1 A 22 i,j + A 22 i,j+1 [ φ i,j+1 φ i,j ] +( A 22 i,j+1 + A 22 i+1,j+1 2 ( A 12 i+1,j+1 A 12 i,j+1 ) 2 2( A 11 i,j+1 + A 11 i+1,j+1 ) )[ φ i+ 1 2 ,j+ 1 2 φ i+ 1 2 ,j+ 3 2 ] +( A 22 i,j + A 22 i+1,j 2 ( A 12 i+1,j A 12 i,j ) 2 2( A 11 i,j + A 11 i+1,j ) )[ φ i+ 1 2 ,j+ 1 2 φ i+ 1 2 ,j 1 2 ] +( A 11 i+1,j+1 + A 11 i+1,j 2 ( A 21 i+1,j+1 A 21 i+1,j ) 2 2( A 11 i+1,j+1 + A 11 i+1,j ) )[ φ i+ 1 2 ,j+ 1 2 φ i+ 3 2 ,j+ 1 2 ] +( A 11 i,j + A 11 i,j+1 2 ( A 21 i,j+1 A 21 i,j ) 2 2( A 22 i,j+1 + A 22 i,j ) )[ φ i+ 1 2 ,j+ 1 2 φ i 1 2 ,j+ 1 2 ] +meas( K i+ 1 2 ,j+ 1 2 ) c i+ 1 2 ,j+ 1 2 φ i+ 1 2 ,j+ 1 2 =meas( K i+ 1 2 ,j+ 1 2 ) f i+ 1 2 ,j+ 1 2 1i,jN1 (4.6)

4.2. DDFV Flux Approximation along the Boundary Cells

It clearly results in Equations (4.1) and (4.2) that the case j=N requires special treatment for example, due to the fact that the associated dual and primal cells meet the Robin boundary conditions. These are the fluxes F i,N+ 1 2 K i,N , F i+ 1 2 ,N K i,N , F i,N+ 1 2 K i+ 1 2 ,N+ 1 2 and F i+1,N+ 1 2 K i+ 1 2 ,N+ 1 2 as illustrated in Figure 8.

Figure 8. 2D computational grid along the boundary cells (black lines) and dual cells (hatted in black discontinuous lines).

How can we approximate fluxes F i,N+ 1 2 K i,N and F i,N+ 1 2 K i+ 1 2 ,N+ 1 2 ?. Recall from equation (1.2) that:

αϕ( nAϕ )=g

It follows by integration of both sides of the previous equation that:

F i,N+ 1 2 K i,N =αh φ i,N+ 1 2 [ A B ] gds (4.7)

where

F i,N+ 1 2 K i,N =2 A 22 i,N ( φ i,N φ i,N+ 1 2 )+ A 12 i,N ( φ i 1 2 ,N+ 1 2 φ i+ 1 2 ,N+ 1 2 ) (4.8)

By combining the two previous equations, we obtain edgepoint pressure on the boundary φ i,N+ 1 2 , that is:

φ i,N+ 1 2 = 2 A 22 i,N αh+2 A 22 i,N φ i,N + A 12 i,N αh+2 A 22 i,N ( φ i 1 2 ,N+ 1 2 φ i+ 1 2 ,N+ 1 2 ) + 1 αh+2 A 22 i,N [ A B ] gds

Therefore the fluxes F i,N+ 1 2 K i,N and F i,N+ 1 2 K i+ 1 2 ,N+ 1 2 are given by the following formulas:

F i,N+ 1 2 K i,N = 2 A 22 i,N αh αh+2 A 22 i,N φ i,N + 2 A 12 i,N αh αh+2 A 22 i,N ( φ i 1 2 ,N+ 1 2 φ i+ 1 2 ,N+ 1 2 ) 2 A 22 i,N αh+2 A 22 i,N [ A B ] gds ,fori=1,2,3,,N (4.9)

F i,N+ 1 2 K i+ 1 2 ,N+ 1 2 =[ A 11 i,N 2 ( A 12 i,N ) 2 αh+2 A 22 i,N ]( φ i+ 1 2 ,N+ 1 2 φ i 1 2 ,N+ 1 2 ) 2 A 12 i,N αh αh+2 A 22 i,N φ i,N + 2 A 12 i,N αh+2 A 22 i,N [ A B ] gds ,fori=1,2,3,,N (4.10)

We can follow the same procedure to derive the other boundary fluxes over degenerated dual and primary cells. Then we have the following

F i, 1 2 K i,1 = 2 A 22 i,1 αh αh+2 A 22 i,1 φ i,1 + 2 A 21 i,1 αh αh+2 A 22 i,1 ( φ i+ 1 2 , 1 2 φ i 1 2 , 1 2 ) 2 A 22 i,1 αh+2 A 22 i,N [ A B ] gds fori=1,2,3,,N (4.11)

F i, 1 2 K i 1 2 , 1 2 =[ A 11 i,1 2 ( A 12 i,1 ) 2 αh+2 A 22 i,1 ]( φ i 1 2 , 1 2 φ i+ 1 2 , 1 2 )+ 2 A 12 i,1 αh αh+2 A 22 i,1 φ i,1 + 2 A 12 i,1 αh+2 A 22 i,1 [ A B ] gds ,fori=1,2,3,,N (4.12)

F N+ 1 2 ,j K N,j = 2 A 12 N,j αh αh+2 A 11 i,1 ( φ N+ 1 2 ,j 1 2 φ N+ 1 2 ,j+ 1 2 )+ 2 A 11 N,j αh αh+2 A 11 N,j φ N,j 2 A 22 N,j αh+2 A 11 N,j [ A B ] gds forj=1,2,3,,N (4.13)

F i, 1 2 K N+ 1 2 ,j+ 1 2 =[ A 22 N,j 2 ( A 12 N,j ) 2 αh+2 A 11 N,j ]( φ N+ 1 2 ,j+ 1 2 φ N+ 1 2 ,j 1 2 ) 2 A 21 N,j αh αh+2 A 11 N,j φ N,j + 2 A 11 N,j αh+2 A 11 N,j [ A B ] gds ,forj=1,2,3,,N (4.14)

F 1 2 ,j K 1,j = 2 A 11 1,j αh αh+2 A 11 1,j φ 1,j + 2 A 12 1,j αh αh+2 A 11 1,j ( φ 1 2 ,j+ 1 2 φ 1 2 ,j 1 2 ) 2 A 11 1,j αh+2 A 11 1,j [ A B ] gds forj=1,2,3,,N (4.15)

F i, 1 2 K 1 2 ,j 1 2 =[ A 22 1,j 2 ( A 12 1,j ) 2 αh+2 A 11 1,j ]( φ 1 2 ,j 1 2 φ 1 2 ,j+ 1 2 ) 2 A 21 1,j αh αh+2 A 11 1,j φ 1,j + 2 A 21 1,j αh+2 A 11 N,j [ A B ] gds ,forj=1,2,3,,N (4.16)

Now all the ingredients are gathered for define our DDFV algebraic linear system assciated with the governing equations (1.1) and (1.2) in uniform mesh

Proposition 4.1. The DDFV scheme associated of the governing equations (1.1) and (1.2)

We define our DDFV of the problem as find Φ h =( ( φ i,j ) 1i,jN , ( φ i+ 1 2 ,j+ 1 2 ) 0i,jN ) such that

F i+ 1 2 ,j K ij + F i 1 2 ,j K ij + F i,j+ 1 2 K ij + F i,j 1 2 K ij +meas( K ij ) c i,j φ ij =meas( K ij ) f ij fori,j{ 1,2,3,,N } (4.17)

F i+ 1 2 ,j+1 K i+ 1 2 ,j+ 1 2 + F i+ 1 2 ,j K i+ 1 2 ,j+ 1 2 + F i+1,j+ 1 2 K i+ 1 2 ,j+ 1 2 + F i,j+ 1 2 K i+ 1 2 ,j+ 1 2 +meas( K i+ 1 2 ,j+ 1 2 ) c i+ 1 2 ,j+ 1 2 φ i+ 1 2 ,j+ 1 2 =meas( K i+ 1 2 ,j+ 1 2 ) f i+ 1 2 ,j+ 1 2 fori,j{ 0,1,2,3,,N } (4.18)

where,

F 0,j+ 1 2 K 1 2 ,j+ 1 2 = F i+ 1 2 ,N+1 K i+ 1 2 ,N+ 1 2 = F i+ 1 2 ,0 K i+ 1 2 , 1 2 =0fori,j{ 0,1,2,3,,N }

Which can be written for g=0 as

α i,j φ i,j + α i,j+1 φ i,j+1 + α i,j1 φ i,j1 + α i1,j φ i1,j + α i+1,j φ i+1,j + α i+ 1 2 ,j+ 1 2 φ i+ 1 2 ,j+ 1 2 + α i 1 2 ,j+ 1 2 φ i 1 2 ,j+ 1 2 + α i+ 1 2 ,j 1 2 φ i+ 1 2 ,j 1 2 + α i 1 2 ,j 1 2 φ i 1 2 ,j 1 2 =meas( K i,j ) f i,j fori,j{ 1,2,3,,N } (4.19)

β i+ 1 2 ,j+ 1 2 φ i+ 1 2 ,j+ 1 2 + β i+ 1 2 ,j+ 3 2 φ i+ 1 2 ,j+ 3 2 + β i+ 1 2 ,j 1 2 φ i+ 1 2 ,j 1 2 + β i 1 2 ,j+ 1 2 φ i 1 2 ,j+ 1 2 + β i+1,j+1 φ i+1,j+1 + β i,j+1 φ i,j+1 + β i+1,j φ i+1,j + β i,j1 φ i,j1 + β i,j φ i,j =meas( K i+ 1 2 ,j+ 1 2 ) f i+ 1 2 ,j+ 1 2 fori,j{ 0,1,,N } (4.20)

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 an isotropic system, 4.19 and 4.20 are decoupled and therefore independent. In the homogeneous and nonhomogeneous anisotropic case there is a connectivity between the unknown φ i+ 1 2 ,j+ 1 2 and φ i,j . It is clear that the total number of unknows is N 2 + ( N+1 ) 2 . Depending on the numbering process (see Figure 9), the general form of the associated linear system is as follows

Figure 9. Node numbering (mesh size N=4 ) from primal cell points, left to right, bottom to top, to dual cell points left to right and bottom to top.

( A     B t B    C )( Φ cc Φ cv )=( F p F v )

With,

Φ cc = { φ ( j1 )N+i } 1i,jN

Φ cv = { φ j( N+1 )+i+1+ N 2 } 0i,jN

F cc = { F ( j1 )N+i } 1i,jN

F cv = { F j( N+1 )+i+1+ N 2 } 0i,jN

where,

A is a N 2 × N 2 symmetric and positive define matrix, B is a N 2 × ( N+1 ) 2 , C is a ( N+1 ) 2 × ( N+1 ) 2 symmetric and positive define matrix and B t the transpose of B .

4.3. Implementation Steps

In this part, we briefly present the basis data structure of our problem, we discuss what input data are required in general, how matrix equation is assembled, how the boundary conditions are applied in the matrix equation. The key of implementation is to establish a bijective relationship between the nodes of the grid and the pairs of integer numbers ( i,j ) for i,j=1,2,3,,N such that given the node indices ( i,j ) and his eigth neighbors ( i+1,j ) , ( i1,j )

( i,j1 ) , ( i,j+1 ) , ( i 1 2 ,j 1 2 ) , ( i+ 1 2 ,j 1 2 ) , ( i+ 1 2 ,j+ 1 2 ) , ( i 1 2 ,j+ 1 2 ) because they can readly translated to global indices and vice versa

as illustrated in Figure 9 and Figure 7. 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 O, as you can see in Figure 10, is defined by its neighbors nodes on the West, East, North, South, North-West, North-East, South-west and South-East are defined as follows: W, E, N, S, NE, NW, SW and SE.

The discretized Equations (4.19) and (4.20) have been found to take the following general form

C P φ P + n C nb φ nb = f P (15)

where indicates summation overall neighboring nodes ( nb ), C nb are the neighboring coefficients C E , C W , C S , C N , C NE , C NW , C SE , C SW and φ nb are the

Figure 10. Nine point stencils.

approximate values of pressure at the neighboring nodes. 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. The snippet Matlab codes below shows how we proceed to convert Equations (4.19) and (4.20) in the last form i.e. that is conversion from 2D to 1D

5. Some Numerical Simulations

This section is firstly dedicated to numerically validating the analysis of the behavior of the solution proposed in the abstract of this paper, and secondly to showing the numerical test. We consider two test problems on the square domain Ω=] 0,1 [×] 0,1 [ . For each test problem a uniform rectangular mesh is used with different levels of refinement materialized by successive decreasing values assigned to the mesh size h= 1 2 i ( i=2,3,4,5 ), we select a diffusion tensor D and the exact solution φ( x,y ) . Then after we calculate the corresponding right hand side. The error and convergence orders are performed in the following norms.

5.1. Error Norms Used and Convergence Orders

When the analytical solution is available and the mesh is refined, we set H 0 1 ( Ω ) -norm or energy norm

Er H 0 1 ={ D σ σ D int { ( φ P φ L ) 2 + ( φ A φ B ) 2 } + D σ σ D ext { ( φ P ) 2 + ( φ A φ B ) 2 } } 1 2 (5.1)

L 2 -norm or energy norm

(5.2)

and

(5.3)

which is the relative discrete L 2 -norm of the error for the exact potential. Defined by analogy, ergradL2 is the relative discrete L 2 -norm of the error on the exact potential gradient. We denote by erL2( i ) (resp. ergradL2( i ) ) the relative discrete L 2 -norm (resp. ergradL2 ) of the error on the exact potential (resp. exact potential gradient) corresponding to a level i (integer 2 ) of refinement for a given mesh. Let us set for all integers i2

ratioL2( i )=2 ln[ erL2( i ) ]ln[ erL2( i1 ) ] ln[ nunkw( i ) ]ln[ nunkw( i1 ) ] (5.4)

We define ratiogradL2( i ) , for all integers i2 , with the same relation as for ratioL2( i ) , except that erL2 is replaced by ergradL2 .

We denote by ocvL2 (resp. ocvgradL2 ) the order of convergence of the approximate potential (gradient of potential) in L 2 -norm. ocvL2 is given by the formula

ocvL= ln[ erL2( imax ) ]ln[ erL2( imax1 ) ] ln[ h( imax ) ]ln[ h( imax1 ) ] (5.5)

where imax is the maximum level of refinement of a given mesh and h( imax ) the corresponding mesh size. ocvgradL2 is defined by the same formula as for ocvL2 except that erL2 is replaced by ergradL2 .

5.2. Numerical Results

Test 1: Heterogeneous rotating anisotropy. We consider a case: Where α+ , c=0 , φ( x,y )=sin( πx )sin( πy ) and f=div( Aφ ) , the diffusion operator A is given by

A= 1 x 2 + y 2 [ 10 3 x 2 + y 2 ( 10 3 1 )xy ( 10 3 1 )xy x 2 + 10 3 y 2 ]

Table 1. Test 1: Error and convergence orders.

level of refinement

Er-inf error

L2 error

H1 error

1

5.2e−02

5.200e−02

1.9e−01

2

1.4e−02

1.200e−02

6.2e−02

3

3.7e−03

3.1e−02

2.08e−02

4

9.5e−04

7.9e−04

7.1e−02

5

2.52e−04

2.1e−04

2.6e−03

ocv1er

1.92

1.98

1.56

ocv2er

1.88

1.87

1.51

Test 2. We consider a case: where α0 , c=0 φ( x,y )=sin( 2πy ) e 2× 10 5 2 πx and f=div( Aφ ) operator A is given by

A=[ 1 0 0 10 5 ]

and

g={ 2π× 10 5 cos( 2πy )exp( 2πx× 10 5 2 ) if0x1andy=1 2π× 10 5 sin( 2πy )exp( 2πx× 10 5 2 ) if0y1andx=0 2π× 10 5 sin( 2πy )exp( 2πx× 10 5 2 ) if0y1andx=1 2π× 10 5 cos( 2πy )exp( 2πx× 10 5 2 ) if0x1andy=0

It is important to note that in this special case the exact solution must satisfies the following null average condition

Ω φ( x,y )dxdy =0

and the following compatibility condition to ensure the uniqueness of the solution

Ω f( x,y )dxdy Γ g( x )dγ( x ) =0

Table 2. Test problem 2.

level of refinement

Er-inf error

L2 error

H1 error

1

2.72e−02

2.49e−02

2.67e−01

2

1.44e−02

1.21e−02

9.77e−02

3

7.5e−03

6.00e−03

4.41e−02

4

3.82e−03

2.99e−03

1.53e−02

5

1.9e−03

1.49e−03

4.36e−03

6

9.7e−04

7.45e−04

1.18e−03

ocv1er

1.92

1.98

1.56

ocv2er

1.88

1.87

1.51

It follows by observing Table 1 and Table 2 of error estimates and convergences that, numerical tests above show a convergence of order two in L2-norm and Er-inf norm, a convergence of order 1.5 in relative norm H1.

5.3. Conclusion and Perspectives

In summary, we proposed a numerical scheme for anisotropic diffusion problems with prescribed Robin boundary conditions. We showed an existence and uniqueness result of the solution of the discrete problem. Numerical tests confirmed the theoretical cases. Unfortunately, the numerical results for general cases (case where α0 ) were not performed due to the robustness of calculations are designed for further work. Our challenge is to present similar tests on an unstructured mesh.

Funding

This work was supported by ongoing institutional funding. No additional grants to carry out or direct this particular research were obtained.

Conflicts of Interest

The author declares no conflicts of interest regarding the publication of this paper.

References

[1] Njifenjou, A. and Moukouop-Nguena, I. (2001) Traitement des anisotropies de per-meabilite en simulation d’ecoulement en milieu poreux par les volumes finis. Sys-temes Informatiques pour la Gestion de lEnvironnement, 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 Omnes, 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.[CrossRef
[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.[CrossRef
[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.[CrossRef
[7] Andreianov, B., Boyer, F. and Hubert, F. (2007) Discrete Duality Finite Volume Schemes for Leray-Lions-Type Elliptic Problems on General 2D Meshes. Numerical Methods for Partial Differential Equations, 23, 145-195.[CrossRef
[8] Boyer, F. and Hubert, F. (2008) Finite Volume Method for 2D Linear and Nonlinear Elliptic Problems with Discontinuities. SIAM Journal on Numerical Analysis, 46, 3032-3070.[CrossRef
[9] Donfack, H. and Jeutsa, A.K. (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.[CrossRef
[10] Gander, M.J., Halpern, L., Hubert, F. and Krell, S. (2021) Discrete Optimization of Robin Transmission Conditions for Anisotropic Diffusion with Discrete Duality Finite Volume Methods. Vietnam Journal of Mathematics, 49, 1349-1378.[CrossRef
[11] Le Dret, H. and Lucquin, B. (2016) Partial Differential Equations: Modeling, Analysis and Numerical Approximation. International Series of Numerical Mathematics, 168, Article 40340.

Copyright © 2025 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.