Discrete Duality Finite Volume for Anisotropic Diffusion Problems with Prescribed Robin Boundary Conditions ()
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:
(1.1)
(1.2)
where
and
are given functions,
is the boundary of Ω,
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,
, with
is a piecewise constant in Ω and is symmetric, that is,
(1.3)
(1.4)
in Ω, where
and
denote respectively the euclidian norm and the transposition operator in
.
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
,
,
,
and
. Let
, then
(1.5)
where
with
, defines a variational formulation for problem model (1.1) and (1.2).
Proposition 1.2. Under the assumptions (1.3) and (1.4),
,
,
,
,
. 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
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
. 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
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
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
one may associate a unique primal cell denoted by
, 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
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 Equations (1.1)-(1.2), denoted by
, satisfies the following property:
(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
expected to be close approximations of
(cell-point pressures) and
(vertex-point pressures) respectively where
and
and where
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
as a primary cell, with
representing the corresponding cell point. We integrate both sides of the balance Equation (1.1) within
. The application of Ostrogradsky’s theorem to the integral on the left-hand side of this equation involves computing the flux across the boundary
.
(2.2)
where
is the unit normal to the boundary of
Using a suitable quadrature formula for approximating this flux, a discrete balance equation is derived. To illustrate our ideas, we consider an edge
associated with the primary cell
see Figure 4.
Figure 4. Two molecules for a DDFV computation of the flux across the edge
. Left:
lies inside Ω, Right:
is part of the boundary of Ω.
Let
be the absolute permeability tensor of the cell
. Denoted by
the unit normal vector to
exterior to
, the flux expression over the edge
viewed as part of the boundary of
is given by
(2.3)
Before starting with the flux computations across the subedges
and
, let us set

Then, it is easily seen that the following identity holds:
(2.4)
where the real numbers
and
are given by the relations
Using assumption (2.1), the decomposition (2.4) and the Taylor expansion series the flux through the edge
is written as follows
(2.5)
where and the truncation errors
are given by
(2.6)
with
and
being the Hessian of
. Note that
exists, thanks to Equation (2.1).
For estimating the truncation error
, 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
the subset of
made up of edge-points lying on Ω,
the subset of
made up of edge-points lying on the boundary of Ω, and
(for
) the subset of
made up of edge-points lying on the boundary of the primary cell
.
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
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
, not depending on
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
, mesh independent, such that
(2.8)
where
are extremities of the only edge (from the cell
) involving the edge-point
.
Under the assumptions (2.1) and Equation (2.7), there exists a strictly positive number
, mesh independent, such that
(2.9)
The relation (2.9) is a consistency property and so naturally allow us to approximate
as follows:
(2.10)
When
is part of the domain boundary, the edge pressure
is determined by the Robin conditions. it is worth noting that in this case, both points
and
must be situated on the boundary as well. However, if
serve as an interface between cell
and some primary cell denoted by
, the edge pressure
is an auxiliary unknown. But, thanks to the principle of flux continuity, one can approximate it with a linear function of
, and
. For investigating the above-mentioned linear function, we compute the flux across
viewed as part of the boundary of
. For this purpose, we set
(2.11)
where the real numbers
and
are given by the relations
where
denotes the unit normal vector to
exterior to the triangle
. Performing flux computation over the interelement
, viewed as part of the boundary of
(see Figure 4) leads to
(2.12)
where for a fixed
and fixed
, we have set
(2.13)
Thus, this flux can be approximated with the expression
(2.14)
The 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:
(2.15)
for all
.
This is a consistent approximation for
in the sense that the corresponding truncation error vanishes when
goes to zero. So, replacing
in Equation (2.14) by its approximate value yields the following conservative scheme:
(2.16)
Case where
: How can we approximate
?
Recall that:
on
.
(2.17)
substituting the value of
from Equation (2.17) and simplifying, we have the following
(2.18)
substituting
as given in Equation (2.18) into (2.17), we have the following flux approximation for boundary primal cell
(2.19)
Using the previous notations and thanks to the consistency of the previous DDFV flux approximations, the approximate flux balance equation within
is
(2.20)
where
and
are extremities of the edge containing
and lying on the boundary of the primary cell
and where
is such that .
2.2.2. DDFV Flux Approximation in Dual Cells
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 (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
. 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
and
be two cellpoints from the primary mesh (that is,
) such that the corresponding primary cells
and
are adjacent, and consider
(recall that
, for
, is the set of edge-points from
lying on the boundary of cell
). The line
defines a pseudo-edge, denoted by
, whose extremities are
and
. We will say that a pseudo-edge is associated with a dual cell
if it is part of the boundary of
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
as depicted in Figure 3. The application of Ostrogradski’s theorem and the utilization of Remark (2.5) result in:
(2.21)
where
is the outward unit normal vector of the boundary of
and
is a pseudo-edge associated with the dual cell
. Recall that
is the set of edge points lying in the boundary of the dual cell
. We will seek a flux approximation along the pseudo-edge
, considering it as a segment of the boundary of
. Denoting the exact flux over
as
, it can be expressed by the following relation:
(2.22)
Initially, our attention should be directed towards computing the flux across
. Therefore, let’s define the subsequent decomposition of
:
(2.23)
It is clear that
Therefore
(2.24)
where
(2.25)
with
and
.
Neglecting
and exploiting Equation (2.15) yields the following approximation:
(2.26)
Likewise, let’s concentrate on computing the flux across
. To achieve this, we establish the following setting:
(2.27)
where
Following the same procedure as for
, we obtain
(2.28)
where
(2.29)
Neglecting the error term and substituting the value of
from Equation (2.28) yield
(2.30)
Proposition 2.6. Under the same assumptions as those of Proposition 2.3, there exists a strictly positive number
, mesh independent, such that
(2.31)
We summarize the flux approximation across the pseudo-edge
in the following way:
(2.32)
where we have set
(2.33)
We have to compute the flux around the degenerated dual cells i.e. with
, we substitute
as given in Equation (2.15) into Equation (2.28). That is
(2.34)
We deduce from the previous developments that the discrete balance equation in any dual cell
reads
(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
such that
(2.36)
(2.37)
Figure 6. Examples of diamond cells. Left: A normal diamond cell. Right: A degenerate diamond cell.
Remark 2.7. If
we obtain the balance equation of diffusion reaction problem with prescribed Neumann bounbary conditions which is written as follows
(2.38)
(2.39)
Remark 2.8. When
and
we recognize the balance equation of diffusion reaction problem with homogeneous Dirichlet bounbary conditions which is written as follows
(2.40)
(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
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
associated with the linear system (2.36)-(2.37) essentially follows from the symmetry of the diffusion coefficient
. We now should prove the positive definiteness of that matrix.
Let us set:
(3.1)
(3.2)
where
(3.3)
where
is a
symmetric matrix,
is a
symmetric matrix,
is a
matrix and
is the transpose of
. In this context,
represents a subvector with a number of components equal to
derive from the right-hand side of Equation (2.36). Similarly,
is a subvector with
components obtained from the right-hand side of Equation (2.37). We start by developing the quadratic expression
of the system (2.36)-(2.37). It is clear that
(3.4)
where
is a set diamond cells (see Figure 6) and
a diamond cell whose diagonals are
and
. This diamond cell is widely used to establish the stability result and error estimates. Set
where
are two adjacent primary cells sharing the edge
as interface containing the edge-point
. Let us prove that the homogenized symmetric permeability tensor
is positive definite, that is
. Setting
(3.5)
we have that
(3.6)
where
and
are strictly positive numbers defined as
(3.7)
Given that the diffusion coefficient
adhere to assumptions (1.3)-(1.4), symmetric and positive definite, Cauchy-Schwarz’s inequality applied to the inner product associated with
guarantees that
(3.8)
Since either
and
or
and
are not collinear, it follows that
. Consequently,
forms a symmetric positive definite matrix. For the second quadratic form, set
(3.9)
The second quadratic form is positive if
(3.10)
We now show that the bilinear form is quadratic and elliptic. That is
(3.11)
The Cauchy-Schwarz inequality for the inner product associated with
ensure that relation (3.11) is positive.
It follows from the previous step that the matrices
and
have respectively
and
as strictly positive eigenvalues. So, we have
(3.12)
The equality holds in Equation (3.12) if and only if
and
. Thus, the positive definiteness of the matrix
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
covered with a primary mesh
whose grid size is
, where
is a given strictly positive integer. We denote by
the primary grid block given by
where
,
for
.
We also consider a second grid block
centered in
and called dual grid block and defined by
where
,
for
For any cell along the boundary of the domain, we adopt the convention
,
and
,
. We now focus our attention on finding for the unknowns
and
which are reasonable approximate solutions of Equation (1.1)-(1.2), where
and
. 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
and
respectively, applying Ostrogradski’s theorem leads to compute fluxes through the boundary of
and
as illustrated by Figure 7. The integration in primary cell
is a direct result of taking the interface flux values over
and
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).
(4.1)
Likewise the integration in primary cell
is a direct result of taking the flux values over
,
,
and
as you can see in the following formulas.
(4.2)
4.1. Computation of Fluxes
Let us consider the segment
delimited by points
and
(see Figure 7), le flux the edge
seen as element of the primal cell
and denoted by
is calculated as follows.
where
is the unit normal vector exterior from
and
the midpoint or interface point of segment
. We now use suitable gradient operators to compute the flux
as follows
(4.3)
represents the truncation error so that
, 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
and
we have that,
where,
represents the flux over
. We therefore obtain that the edge midpoint potential
is given by
(4.4)
Substituting the edge midpoint potential
in the flux equation
we obtain that
If we perform similar calculations on the neighboring primal cells of
that is on the cells,
,
,
. We obtain the following balance equation in internal primary cell.
(4.5)
We develop in order to close system 4.1, the balance equations over the interface of the interior dual cell
(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
and the neighboring cells
,
,
and
, we obtain the balance equation.
(4.6)
4.2. DDFV Flux Approximation along the Boundary Cells
It clearly results in Equations (4.1) and (4.2) that the case
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
,
,
and
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
and
?. Recall from equation (1.2) that:
It follows by integration of both sides of the previous equation that:
(4.7)
where
(4.8)
By combining the two previous equations, we obtain edgepoint pressure on the boundary
, that is:
Therefore the fluxes
and
are given by the following formulas:
(4.9)
(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
(4.11)
(4.12)
(4.13)
(4.14)
(4.15)
(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
such that
(4.17)
(4.18)
where,
Which can be written for
as
(4.19)
(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
and
. It is clear that the total number of unknows is
. 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
) from primal cell points, left to right, bottom to top, to dual cell points left to right and bottom to top.
With,
where,
is a
symmetric and positive define matrix,
is a
,
is a
symmetric and positive define matrix and
the transpose of
.
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
for
such that given the node indices
and his eigth neighbors
,
,
,
,
,
,
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
(15)
where
indicates summation overall neighboring nodes (
),
are the neighboring coefficients
and
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
. 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
(
), we select a diffusion tensor
and the exact solution
. 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
-norm or energy norm
(5.1)
-norm or energy norm
(5.2)
and
(5.3)
which is the relative discrete
-norm of the error for the exact potential. Defined by analogy,
is the relative discrete
-norm of the error on the exact potential gradient. We denote by
(resp.
) the relative discrete
-norm (resp.
) of the error on the exact potential (resp. exact potential gradient) corresponding to a level
(integer
) of refinement for a given mesh. Let us set for all integers
(5.4)
We define
, for all integers
, with the same relation as for
, except that
is replaced by
.
We denote by
(resp.
) the order of convergence of the approximate potential (gradient of potential) in
-norm.
is given by the formula
(5.5)
where
is the maximum level of refinement of a given mesh and
the corresponding mesh size.
is defined by the same formula as for
except that
is replaced by
.
5.2. Numerical Results
Test 1: Heterogeneous rotating anisotropy. We consider a case: Where
,
,
and
, the diffusion operator
is given by
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
,
and
operator
is given by
and
It is important to note that in this special case the exact solution must satisfies the following null average condition
and the following compatibility condition to ensure the uniqueness of the solution
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
) 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.