Numerical Solution of 2-D Diffusion Problems Using Discrete Duality Finite Volume Method on General Boundary Conditions ()
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:
(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,
, with
is a piecewise constant function in
and is symmetric, i.e.
(2)
(3)
in
, where
and
denote respectively the euclidian norm and the transposition operator in
.
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) Let’s S be a closed surface bounding a soled D, oriented outwards. Let
be a vector field with continuous partial derivatives then
(4)
Let us focus on a DDFV formulation of the problem (1) in terms of a linear system which involves
and
as discrete unknowns expected to be close approximations of
(cell-point pressures) and
(vertex pressures) respectively, where
and
and where
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
over
possessing the following properties: 1)
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
are located in the mesh element interfaces. 3) For any edge of
arbitrarily exhibited one point and named edge-point in what follows, denote by the set of edge-points,
the set of internal edge-point and
the set of boundary edge-points.
Joining the edge points in suitable way defines an auxiliary mesh
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
as common interface, for each
, can we introduce the quadrangle
diamond cell
whose diagonals are
and
, as shown in (Figure 2) below. Notice that the diamond cells are the union of four disjoint convex triangles. Furthermore, if
then the quadrilateral
degenerate in a single triangle. The set of diamond cells is denoted by
and we have
Remark 1 Note that the set
will sometimes be identified with the set of diamond meshes since there is a trivial bijection between the two sets.
•
angle between
and
•
angle between
and
•
![]()
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.
•
the unit normal to
exterior to triangle
•
•
the length of
•
the length of
•
the measure of the diamond cell
•
•
•
quarter diamond defines by the triangle (
)
•
half diamond defines by the triangle (
)
•
An elementary geometry in triangles (PLI), (PID) and (LID) with reference (Figure 3) permit us to write:
(5)
this implies,
(6)
(7)
Main assumptions:
(
) We assume that the primary mesh
is compatible with the discontinuities of the permeability tensor K defined in
.
(
) The permeability discontinuities divide
into a finite number of convex polygonal subsets denoted by
.
We suppose that the restriction over
of the exact solution
to the model problem (1), denoted by
, satisfies the following property:
(8)
Let us recall below the diverse boundary conditions that we are going to investigate in this paper:
1) Dirichlet boundary conditions
(9)
2) Full Neumann boundary conditions
(10)
where
is a outward unit normal vector and g is a given function
3) Periodic boundary conditions
(11)
where
(northern boundary),
(southern boundary),
(eastern boundary) and
(western boundary) define a partition of the domain boundary denoted by
, and
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:
(12)
Note that the set
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
. 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
be an internal primary cell where P is the corresponding cellpoint. We start, with introducing a discrete gradient operator
defined to be constant on each quarter diamond cell
associated to the control volume
(13)
Then integrating two sides of the balance Equation (1) in
and apply Gauss’s divergence theorem to the left-hand side. The discrete balance equation follows from flux computations over the boundary of
by using a suitable gradient operator
defined above. Thus we have:
(14)
where
, Figure 3 gives an illustration of previous comment. Note that
and therefore
.
Definition 1 The system
defines an eligible system of meshes if the following conditions are fulfilled:
1) There exists
, mesh independent, such that:
(15)
2) There exists
, mesh independent, such that:
(16)
where
and
.
Following ideas we have exposed in [6], and the fact that approximate fluxes
and
meet the principle of flux continuity over the interface
between
and
if and only if the approximate edge point pressure
satisfies to the following relation:
(17)
Proposition 2 Under the only assumption (8) we have:
(18)
In addition, if the system of meshes
is eligible in the sense of Definition 1, the truncation error
(also denoted by
) associated with this flux approximation satisfies the following inequality
(19)
where
,
,
and where C is a mesh independent positive number.
Recall that only the case
, with
, is concerned by the previous result. Summing the two sides of relation (18) on
leads to the following result.
Proposition 3 Let us suppose that the system of meshes
is eligible in the sense of Definition 1. Under the assumption (8), the discrete balance equation in any primary cell
, with
, reads as:
(20)
where
,
and
(see Section 2 devoted mainly to Notations).
Moreover, the truncation error
satisfies the inequality (19). 
It is clear that the number of discrete unknowns
and
is greater than the number of discrete balance equations given by the system of Equation (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
. So, we integrate the two sides of (1) in
. The left-hand side is the flow exchanged between
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
viewed as part of the boundary of
. Denoted by
, it can be expressed by the relation
(21)
By using the same process, the approximate flux across the pseudo-edge is
(22)
Summing the two sides of the Equation (22) on
leads to what follows.
Proposition 4 Under the assumption (8), the flux balance equation for any interior dual cell
reads,:
(23)
In addition, if the system of meshes
is eligible in the sense of Definition 1, the truncation error
obeys the following inequality:
(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
one easily proves that Equations (1) and (9) get a unique variational
solution in the Sobolev space
. Letting
represent the left of the balance equation in primary cell
adjacent to
reads as:
(25)
Because the degenerate discrete gradient reads as:
(26)
2.3.2. Case of Full Neumann Boundary Conditions
In the Sobolev space
the existence and uniqueness of a variational solution to (1) - (10) are ensured if:
(27)
Let
denote the boundary of any primary cell
, then the DDFV balance equation in a primary cell adjacent to domain boundary by using a suitable external discrete gradient operator reads as:
(28)
Note that the degenerate discrete gradient reads as:
(29)
And
is given by Equation (17) with
, finally the degenerate discrete gradient reads as:
(30)
It is easy to check that the balance equation in a dual cell (adjacent or not) to the domain boundary reads as:
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
by periodicity. So there exists a periodic partition of whole space
into control volumes. Our strategy to obtain discrete balance equations associated with degenerated dual cells is to consider a DDFV formulation in whole space
(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
and
, we define the fictitious domain
. Note that the original domain
is embedded inside a fictitious domain
such that
The computational domain
is meshed with respect to the periodicity setting of the problems. The boundary-vertices (
) are distributed along the domain boundary
in such a way that the orthogonal projection of a boundary-vertex on the opposite side of
is a latest vertex-point inside the original domain
denoted by
which means that
. 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
which means that
. 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
where
![]()
Figure 4. A schematic illustration of the fictitious domain delimited by
and recomposed dual cells around the domain
painted in blue.
is the set of internal diamond cells and
is the set of fictitious diamond cells. It follows that the discrete gradients are written as follows
(31)
(32)
(33)
Remark 2 Note that the set
primary edges will sometimes be identified with the set
of diamond meshes since there is a trivial bijection between the two sets i.e.
,
such that
.
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
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
such that
(34)
Which can be written taking in consideration remark (2)as follows
(35)
where
and
denote the mean value of f over
and
respectively,the equivalent diffusion tensor
satisfies
(36)
(37)
(38)
Remark 3 When the points P, I and L are aligned, which means
, then we have
,
,
,
,
, in this case the matrix
is then defined by:
(39)
(40)
(41)
We recognize in (39) the weighted harmonic mean-value of
and
and in the first term of (41) the weighted arithemetic mean-value of
and
. 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
Proof. Since
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:
This quadratic form is elliptic if and only if:
(42)
In effect we have:
where
and
are strictly positive numbers defined as
Since the diffusion matrix K is symmetric and positive definite, the Cauchy-Schwartz inequality for the inner product associated with K ensures that
and
as either
and
are not collinear. Therefore
, thus the matrix
are symmetric and positive definite matrices. Under the assumption 1 the matrix
possesses strictly positive eigenvalues. Let
be its least eigenvalue. so we have
(43)
the equality holds in Equation (43) if and only if
. 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
,
,
and
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
be the total number of discrete unknowns according to the previous numbering of cell-points and vertex-points. Set that:
, where
is the set that consists of dual cells associated with interior vertexpoints and where
and
respectively denote the sets of dual cells associated with boundary vertexpoints different from cornerpoints and located in the
-axis and the
-axis. Of course
is the dual cell associated with
. The two following discrete problems are equivalent:
(DP1): Find
such that Equations (31),(32),(33)and (34)are satisfied
And
(DP2): Find
such that Equations (31) and (32) and (33)and (34)are satisfied
Where, for a given set of mesh elements
, one has set:
.
(44)
For the sake of clarity of the exposition,
will be used either for denoting a cellpoint or its associated number, idem for
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
denotes the auxiliary mesh i.e. an intermediate mesh between the primal mesh
and the dual mesh
. The main feature of
is that each auxiliary cell involves either one only cellpoint or one only vertexpoint. Consequently, we have the following relation between
,
and
:
(45)
where
and
denote the two kinds of auxiliary cells emerging from the definition of the mesh
. 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:
(46)
(47)
Recall that
and
respectively denote the sets of boundary vertex-points different from corner-points and located in the
-axis and the
-axis. In the sequel, we will sometimes do the following identification:
Note that
is an
-dimensional subspace of
. So, the following identification will be sometimes considered:
Proposition 10 The matrix
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
Thus, the kernel
of
defined by
involves a nonzero vector, namely
, and therefore
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
. Our purpose now is to give a characterization of
, the kernel of
. Before that, we recall a result we need for proving the characterization of
.
Proposition 11 (Characterization of
)
•
;
•
,
where we have set:
and where
and
are given real numbers. 
Proof. The inclusion of
in
is trivial. Let us concentrate on the proof of the inclusion of
in
. For this purpose, let
be a vector such that
where one has set
Therefore, it follows from the integration by parts formula that:
(48)
According to [6], there exists
a mesh-independent, strictly positive real number that minimizes both of least eigenvalues of
. We then deduce from Equation (48) that
(49)
It is obvious from the previous inequality that the space
is included in the one spanned by the vectors
and
defined by
and
Remarking that
and
are two (linearly independent) eigenvectors with zero as corresponding eigenvalue with respect to the matrix
, the proof of Proposition 11 is completed.
Remark 6 Note that the dimension of the space
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
orthogonal to
.
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
and such that
The uniqueness of a solution to this continuous problem is got from the subspace of
made up of functions v satisfying the following condition:
(50)
This condition makes obvious the necessity of associating a discrete function
(defined almost everywhere in
) with any vector
from
.
• Basic discrete function spaces. Denote by
the space of such discrete functions
and let
be the characteristic function of a subset
of
i.e.
if
and 0 otherwise. We define the space
as:
(51)
where
and
are two generic notations of the two kinds of auxiliary cells from
. Let us introduce the following mappings (viewed as projections in some sense):
(52)
(53)
where
and
are function spaces respectively associated with vector spaces
and
(see relation (44) for the definition of these vector spaces).
• Looking for uniqueness conditions. Since the dimension of
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:
In other words,
Proposition 13 Define two quadrature expressions
and
on the discrete function space
as follows: for all
Then,
and
are linearly independent linear forms on
.
Proof. Let
and
be two real numbers such that
on
, that is,
Taking
to be successively
and
, one easily see that
. 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
such that the Equations (31) - (34) are satisfied possesses a unique solution if condition (12) is fulfilled and if
(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
. Moreover, in the proof of Proposition 11, we have shown the fact that
(55)
So, to end the proof of Proposition 14, we just need to prove the positive definiteness of
over the subspace
of
made up of vectors
satisfying the conditions (54). For this purpose, it suffices to show the assertion:
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
(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
,
. 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
for all
where
is fixed. we denoted by
the vertices of the primal mesh and by
the center of the primal cell
. Around each vertex of the primal mesh
, we construct a dual cell
. The set of the dual cells
constitutes a second mesh wish will call dual mesh. The diamond meshes are defined by the vertices
or
and denoted respectively by
or
. As you can see in Figure 6, the centers of the dual cells are the vertices of the primal mesh and conversely. The set
made of finite number of nodes is called the computational grid. Recall that:
We also adopt the following conventions:
and.
We are looking for values
which approximate
and
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
: Dirichlet boundary conditions. (LEFT), for Neumann boundary conditions (middle) and for periodic boundary (Right).
(56)
and
(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
and
. For every fixed primary mesh
or dual mesh
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:
(58)
where
is a subvector with
components,
is a subvector with
, A is a
symmetric matrix, C is a
symmetric matrix, B is a
matrix and
it its associated transpose matrix. Note that the components of
and
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
,
,
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
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
.
![]()
Table 2. Connectivity between indices and coordinates of the associated nodes case of Neumann boundary conditions
.
![]()
Table 3. Connectivity between indices and coordinates of the associated nodes case of periodic boundary conditions
.
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
and Western
boundary are equal, similarly for those on the Northern
and Southern
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:
: right Connectivity node and its neighbors in the dual cell:
.
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.
(59)
where
indicates summation overall neighboring nodes (nb),
are the neighboring coefficients
and
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
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
. In the following test-cases we have taken:
and
.
5.1. Notations
In the following tables, ndu denotes the number of discrete unknowns. Recall that
stands for the discrete
- norm and let
denote the discrete
-norm defined as:
(60)
When the exact solution is available, the relative discrete
-norm of the error for the exact potential is defined as:
Defined by analogy,
is the relative discrete
-norm of the error for the exact potential. For a given mesh, since different levels i of refinement may be considered, we denote by
and
the corresponding relative discrete
-norm and relative discrete
-norm of the exact potential. Let us set for any integer i (with
):
We define
, for any integer
, with the same relation as for
, except that in this relation
is replaced with
. On the other hand,
stands for
-norm of the error on the exact mean value of the flux across the mesh edges. So we have:
where
and
are respectively the exact and the approximate flux across
which is either a primal edge or a dual edge. The symbol
denotes the pressure error for
-norm.
Let
denote the error order of convergence to zero for the norm
which may be taken to be one of the following norms
,
and
. The first two norms are used for pressure error estimates while the last one serves for the flux error estimate. The quantity
is defined as:
where
is the maximum level of refinement of a given primal mesh.
At last, we denote by
the error order of convergence to zero for the norm
when computed with the least-square method. The quantity
obeys the relation:
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
is associated with the following diffusion coefficient matrix.
(61)
The exact solution to Equations (1) such that:
(62)
is
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
-norm and discrete
-norm concerning the pressure. The same rate of convergence is observed for
-norm concerning the interface fluxes. The quadratic convergence for
-norm and discrete
-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
-norm,
-norm and discrete
-norm in Test-problem number 1.
Data from Test-problem 2: Let
be a square with the following diffusion coefficient:
(63)
The exact solution to (1) - (11) such that
(64)
is
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
(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
associated with the following diffusion coefficient:
The exact solution to the system (1) - (11) such that
(66)
is what follows:
![]()
Table 5. Convergence rate of flux and pressure errors for
-norm,
-norm and discrete
-norm in Test-problem number 2.
![]()
Table 6. Convergence rate of pressure error for
-norm,
-norm and for discrete
-norm in Test-problems 3 and 4.
Data for Test-problem 4: Let
be the square
associated with the following diffusion coefficient:
(67)
The exact solution to the system (1) - (11) such that
(68)
is what follows:
.
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
-norm,
-norm and discrete
-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
-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
-norm and discrete
-norm
![]()
Figure 8. A numerical solution test-problem Group I
LEFT: Approximation solution; Right: Exact solution.
![]()
Figure 9. A numerical solution test-problem Group II
LEFT: Approximation solution; Right: Exact solution.
while a 1.50 order of convergence is got for
-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
-norm that led to a 0.5 order of convergence (see test-problem number 4).