The gradient discretisation method for linear advection problems
J\'er\^ome Droniou, Robert Eymard (LAMA), T. Gallou\"et (I2M), R., Herbin (I2M)

TL;DR
This paper extends the Gradient Discretisation Method (GDM) to linear hyperbolic equations, unifying and analyzing various numerical schemes like finite elements and finite volumes for scalar advection problems.
Contribution
It adapts GDM to hyperbolic equations, enabling unified design and convergence analysis of multiple numerical schemes for scalar advection.
Findings
Convergence of the adapted GDM scheme is established.
Numerical tests confirm the effectiveness of the method.
The scheme accommodates various discretisation techniques.
Abstract
We adapt the Gradient Discretisation Method (GDM), originally designed for elliptic and parabolic partial differential equations, to the case of a linear scalar hyperbolic equations. This enables the simultaneous design and convergence analysis of various numerical schemes, corresponding to the methods known to be GDMs, such as finite elements (conforming or non-conforming, standard or mass-lumped), finite volumes on rectangular or simplicial grids, and other recent methods developed for general polytopal meshes. The scheme is of centred type, with added linear or non-linear numerical diffusion. We complement the convergence analysis with numerical tests based on the mass-lumped P1 conforming and non conforming finite element and on the hybrid finite volume method.
| errl2 | rate | errl1 | rate | umin | umax | |
| 0.250 | 2.95E-01 | - | 1.95E-01 | - | 0.108 | 0.137 |
| 0.125 | 2.55E-01 | 0.212 | 1.37E-01 | 0.504 | 0.014 | 0.174 |
| 0.062 | 2.32E-01 | 0.136 | 1.23E-01 | 0.158 | 0.000 | 0.344 |
| 0.031 | 1.77E-01 | 0.394 | 8.55E-02 | 0.525 | -0.001 | 0.734 |
| 0.016 | 1.23E-01 | 0.524 | 4.73E-02 | 0.853 | -0.013 | 1.003 |
| errl2 | rate | errl1 | rate | umin | umax | |
| 0.250 | 2.52E-1 | - | 1.10E-1 | - | 0.043 | 0.054 |
| 0.125 | 2.65E-1 | -0.076 | 1.51E-1 | -0.457 | 0.016 | 0.194 |
| 0.062 | 2.37E-1 | 0.165 | 1.31E-1 | 0.208 | 0.000 | 0.361 |
| 0.031 | 1.82E-1 | 0.381 | 8.64E-2 | 0.597 | 0.000 | 0.687 |
| 0.016 | 1.33E-1 | 0.456 | 5.34E-2 | 0.694 | 0.000 | 0.960 |
| h | errl2 | rate | errl1 | rate | umin | umax |
| 0.35 | 2.80E-1 | - | 2.08E-1 | - | 0.152 | 0.155 |
| 0.18 | 2.79E-1 | 0.001 | 1.54E-1 | 0.436 | 0.044 | 0.124 |
| 0.09 | 2.59E-1 | 0.111 | 1.30E-1 | 0.236 | 0.001 | 0.220 |
| 0.04 | 2.10E-1 | 0.300 | 1.08E-1 | 0.276 | 0.000 | 0.499 |
| 0.02 | 1.47E-1 | 0.520 | 6.57E-2 | 0.713 | 0.000 | 0.906 |
| errl2 | rate | errl1 | rate | umin | umax | |
| 0.250 | 2.59E-01 | - | 1.65E-01 | - | 0.005 | 0.313 |
| 0.125 | 2.32E-01 | 0.159 | 1.19E-01 | 0.462 | 0.000 | 0.286 |
| 0.062 | 2.13E-01 | 0.122 | 1.10E-01 | 0.122 | 0.000 | 0.454 |
| 0.031 | 1.85E-01 | 0.205 | 9.13E-02 | 0.266 | 0.000 | 0.672 |
| 0.016 | 1.53E-01 | 0.270 | 6.93E-02 | 0.398 | 0.000 | 0.868 |
| errl2 | rate | errl1 | rate | errl | rate | |
| 0.250 | 4.96E-02 | - | 4.34E-02 | - | 0.138 | - |
| 0.125 | 1.82E-02 | 1.44 | 1.42E-02 | 1.61 | 7.17E-02 | 0.94 |
| 0.062 | 5.89E-03 | 1.62 | 4.26E-03 | 1.73 | 3.59E-02 | 0.99 |
| 0.031 | 1.81E-03 | 1.70 | 1.16E-03 | 1.87 | 1.78E-02 | 1.01 |
| 0.016 | 5.51E-04 | 1.71 | 3.06E-04 | 1.92 | 8.86E-03 | 1.01 |
| errl2 | rate | errl1 | rate | errl | rate | |
| 0.250 | 5.37E-02 | - | 5.01E-02 | - | 9.25E-02 | - |
| 0.125 | 2.88E-02 | 0.90 | 2.59E-02 | 0.95 | 5.85E-02 | 0.66 |
| 0.062 | 1.57E-02 | 0.87 | 1.35E-02 | 0.94 | 3.36E-02 | 0.80 |
| 0.031 | 8.55E-03 | 0.88 | 6.94E-03 | 0.96 | 2.21E-02 | 0.60 |
| 0.016 | 4.57E-03 | 0.90 | 3.53E-03 | 0.98 | 1.50E-02 | 0.55 |
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Numerical Methods in Computational Mathematics · Computational Fluid Dynamics and Aerodynamics · Advanced Mathematical Modeling in Engineering
\savesymbol
hyperpage \restoresymbolHRhyperpage
\newconstantfamilyctrcstsymbol=C
\newconstantfamilyctrtermsymbol=T
The gradient discretisation method for linear advection problems
J. Droniou, R. Eymard, T. Gallouët and R. Herbin
Abstract
We adapt the Gradient Discretisation Method (GDM), originally designed for elliptic and parabolic partial differential equations, to the case of a linear scalar hyperbolic equations. This enables the simultaneous design and convergence analysis of various numerical schemes, corresponding to the methods known to be GDMs, such as finite elements (conforming or non-conforming, standard or mass-lumped), finite volumes on rectangular or simplicial grids, and other recent methods developed for general polytopal meshes. The scheme is of centred type, with added linear or non-linear numerical diffusion. We complement the convergence analysis with numerical tests based on the mass-lumped conforming and non conforming finite element and on the hybrid finite volume method.
Keywords: linear scalar hyperbolic equation, Gradient Discretisation Method, convergence analysis, numerical tests.
AMS subject classification: 65N12, 65N30
1 Introduction
We are interested here in designing and analysing an approximation of , solution to the linear advection problem stated in its strong form as
[TABLE]
with the following assumptions on the data:
[TABLE]
where is the outer normal to . Since the normal boundary value of vanishes, there is no need for a boundary condition on (1a).
The model (1) typically arises in oil recovery from underground reservoirs [1, 15] or in underground water resources management [24], in which case and may represent the injection and production wells and is the concentration of injected solvent or pollutant. The problem (1) is often discretised by the upstream weighting finite volume scheme (see, for example, [16, Chapters 5 and 6] and references therein), which is easy to implement even on unstructured meshes since the problem is first order. There are also numerous papers studying Galerkin methods for this type of problems, which are based on the following weak formulation: a function is said to be a weak solution of Problem (1) if:
[TABLE]
where is the set of the restrictions of functions of to .
Let be a discretisation of the time interval, and let . We recall that, for a finite dimensional space and , the -scheme takes the following form: being a chosen interpolate of , the scheme consists in finding, for all ,
[TABLE]
with suitable time approximations of the data indexed by . This scheme is stable provided that , which is proved letting and following the calculus formula
[TABLE]
Weak convergence properties are then obtained for the approximate solution, which generally displays oscillations. See [14] for a complete study of the particular case of Finite element methods, and [7] for a comparison of different Galerkin schemes. A convergence result is proved in [13] under strong regularity hypotheses on the solution and with a constant velocity field.
This paper is focused on the case where the approximation of is no longer done in a subspace of . In a number of situations, coupled problems including terms of different nature (e.g. diffusive, advective…) must be solved in an industrial context where the discretisation method, imposed by the use of an existing code, is based on non conforming finite element, discontinuous Galerkin or hybrid methods (with face and cell unknowns), for example.
In order to handle such a situation, we use the Gradient Discretisation Method (GDM) framework, which gives a unified formulation of a large class of conforming and nonconforming methods; we refer the reader to the monograph [12] for details. The idea of the GDM is to replace, in a weak formulation of the continuous problem, the continuous space by the vector space of the degrees of freedom of the method , the functions and by their reconstruction and , and the gradient by the reconstruction of a discrete gradient . For conforming methods, is a subspace of and, for , ; for non-conforming finite element methods, is a space of piecewise polynomial functions and, for all , is the broken gradient of . Discontinuous Galerkin methods, which are popular in the framework of hyperbolic problems, can also be embedded in the GDM; for these methods, is again a space of piecewise polynomial functions, the expression of takes into account both the broken gradient of and the jump terms, and no additional stabilisation term has to be introduced in the formulation of the scheme (see [12, Chapter 11]). Note that for fully discrete methods or mass-lumped versions of the previous schemes, is a genuine function reconstruction (see the schemes used in Section 5).
A natural scheme would then be: given an interpolate of , solve for ,
[TABLE]
Unfortunately, it does not seem possible to establish the stability (and thus the convergence) of (6) due to the absence of the equivalent of the calculus chain (5) in this fully discrete setting involving function and gradient reconstructions and instead of the classical differential operators. To obtain a scheme amenable to a convergence analysis, we thus consider an alternative formulation, using a skew-symmetric reformulation of the advective term.
If , owing to the relation
[TABLE]
a function is a solution to (3) if and only if it satisfies
[TABLE]
The idea to discretise (1a) is then to mimick the formulation (7) instead of (3) in the discrete setting (this idea is in the same line as the weak formulation chosen in [4, Hypothesis (A1)]). Indeed, similarly to the standard skew-symmetric formulation of the convective term in the Navier-Stokes equations, the advection component in (7) vanishes when the solution is taken as a test function. The GDM scheme based on (7) is thus: take and interpolant of and, for all ,
[TABLE]
Letting in (8) leads to an estimate on , which entails a weak convergence property for the reconstruction of the function. However a new difficulty arises: the scheme (8) does not yield any estimate on ; this prevents us from obtaining any limit (even weak) for this term, and thus from passing to the limit to recover the continuous problem.
This issue is solved by introducing a stabilisation term that yields a weak bound on . Several versions of such a stabilisation term can be found [22, 19], such as the symmetric linear stabilisation of [4], or the Streamline-Upwind/Petrov-Galerkin (SUPG) stabilisation [3, 23, 21, 10]. The latter is equivalent to replacing, in the term of (1a), by (this is a kind of continuous upstream weighting for a mesh with size ). This leads to the term
[TABLE]
It is then numerically more stable to complete the SUPG scheme by modifying into
[TABLE]
for a small value . This choice of stabilisation term can be generalised into
[TABLE]
for some and , and symmetric positive definite with uniformly bounded eigenvalues. An obvious and easy choice is and , which leads to the classical Laplace operator. However, using may lead to a smaller numerical diffusion, see Section 5; let us note that in this case, the linear model (1) is approximated by a non-linear problem, which is not in general much of a problem, since the complete coupled physical model usually involves other non-linear terms. In this paper, we stabilise the scheme (8) by introducing the discrete version of the stabilisation term (9), which leads to Scheme (21). Since the GDM method also includes meshless schemes, the stabilisation term depends on a parameter which is an adaptation to the hyperbolic setting of the space size of gradient discretisation for elliptic problems, see Definition 3.4 below.
In addition to providing a generic formulation that applies to a large variety of schemes, this paper presents the following original features:
The analysis applies to mesh-based as well as meshless schemes, owing to Definition 3.4 of the size of gradient discretisation which gives us a way to introduce an intrinsic vanishing viscosity without referring to any mesh size. 2. 2.
We study and compare, for different values of , the effect of the stabilisation of a hyperbolic scheme by -Laplace vanishing diffusion. Numerical examples show that in some cases, values of different from 2 lead to more accurate solutions. 3. 3.
The strong convergence of the stabilised scheme is obtained through an energy estimate, proved in the framework by regularisation as in [9]; this energy estimate is also used for the proof of uniqueness of the solution. 4. 4.
Convergence is established without assuming additional regularity on the solution or the velocity field, and a uniform-in-time weak convergence is proved.
This paper is organised as follows. The continuous problem and the energy estimate are studied in Section 2. We then apply in Section 3 the gradient discretisation tools to Problem (3), and derive some estimates which are used in Section 4 to establish the convergence of the scheme; as a by-product of this convergence, we also obtain an existence result for the solution to (3). In Section 5 some numerical results are provided, using three different schemes that fit into the GDM framework.
2 The continuous problem
Since the flux is null on the boundary , the problem (3) may be reformulated on the whole space by extending , and to : we first choose an extension , and then set and outside . We also extend , and by the value [math] outside and respectively. With these extensions and assuming (2), the problem (3) is equivalent to the following problem, posed on the whole space:
[TABLE]
Lemma 2.1** (Weak continuity with respect to time).**
Assuming (2), let be a solution of (3), or to (10) after extending by 0 outside of . Let . Then the function satisfies and . Hence, , where stands for the space of functions that are continuous weakly in .
Proof.
Let . Taking in (10) yields
[TABLE]
Restricting to this shows that, in the weak derivative sense,
[TABLE]
Since the right hand side of the above equation belongs to , this concludes the proof that . The relation is proved taking such that in (11), integrating-by-parts in time and using (12). ∎
Lemma 2.2** (Energy estimate).**
Assuming (2), any solution of (3) satisfies:
[TABLE]
Proof.
By density of in , we can consider functions in (10). Letting be a mollifier on , and for all and , we choose the function defined by
[TABLE]
which satisfies owing to Lemma 2.1. Using an integration by parts with respect to , we notice that
[TABLE]
With this choice of in (10) leads to , with
[TABLE]
Introducing the function , which converges to in as and satisfies and (see Lemma 2.1), we have
[TABLE]
and, using an integration-by-parts,
[TABLE]
Gathering these results leads to
[TABLE]
and therefore
[TABLE]
Turning to we write, using the divergence formula and ,
[TABLE]
Hence,
[TABLE]
We then easily see that, as ,
[TABLE]
and
[TABLE]
The proof is completed by gathering all the above convergence results and by proving that
[TABLE]
In order to do so, we follow the technique of [9, Lemma II.1] and [17, Lemma B.4]. An integration-by-parts gives
[TABLE]
with
[TABLE]
Since the function converges to in as , the proof of (15) is complete if we can show that weakly in . We have
[TABLE]
By Lipschitz continuity of , there exists depending only on such that . Noting that the sequence of functions is bounded in , Young’s inequality for convolution shows that the first term in the right-hand side of (16) is bounded in . The same Young inequality also easily shows that the second term in this right-hand side is also bounded in the same space, which proves that itself remains bounded in . The weak convergence of therefore only needs to be assessed for smooth functions. Taking , we have
[TABLE]
Hence, using the Lipschitz continuity of and the fact that is supported in the ball centred at [math] and of radius , there exists depending only on and such that
[TABLE]
Hence converges to [math] weakly in , which concludes the proof of (15) and of the lemma. ∎
Corollary 2.3** (Uniqueness).**
Assuming (2), there exists at most one solution to (3).
Proof.
The difference of two solutions to (3) is a solution for the same problem with right-hand-side and initial condition . The energy estimate (13) shows that this difference is a.e. equal to 0. ∎
3 The gradient discretisation method for the linear advection equation
The gradient discretisation method (GDM) is a general framework for nonconforming approximations of elliptic or parabolic problems, see [12] for a general presentation of the method and of some models and schemes it applies to.
The principle of the GDM is to design a set of discrete elements (space, operators) called a gradient discretisation (GD), which is substituted in the weak formulation of the PDE in lieu of the related continuous elements leading to a discretisation scheme.
Definition 3.1** (Gradient discretisation).**
Let be given and let with . A gradient discretisation is defined by where:
the set of discrete unknowns is a finite dimensional vector space on , 2. 2.
the linear mapping reconstructs functions, 3. 3.
the linear mapping reconstructs approximations of their gradients, 4. 4.
the quantity defines a norm on .
Remark 3.2**.**
In the above definition, the definition of the norm is not standard in the GDM setting (in the sense of [12, Definition 2.1]), because of the simultaneous use of the , and norms.
This notion is extended to evolution problems in the following definition.
Definition 3.3** (Space-time gradient discretisation).**
A family is a space-time gradient discretisation if
- •
* is a gradient discretisation of , in the sense of Definition 3.1,*
- •
* is an interpolation operator,*
- •
.
We then set , for , and .
The properties of GDs are assessed through the two following functions and . The first one measures an interpolation error:
[TABLE]
whilst the second one is a measure of a conformity defect (i.e. the defect in a discrete integration-by-parts formula): letting be the set of elements of with zero normal trace on ,
[TABLE]
Let us now define the space size of a GD relative to some regularity spaces. This definition, which holds for both mesh-based and meshless methods, is a measure of the approximation properties of a given GD (this notion is defined in the framework of elliptic problems with homogeneous boundary conditions in [12, Definition 2.22]).
Definition 3.4** (Space size of a GD).**
Let be a gradient discretisation. The space-size of is defined by
[TABLE]
Remark 3.5** (Link between and the size of the mesh for mesh-based GDs).**
In the case of the mesh-based GDs detailed in [12, Chapters 8-14], is related to the size of the mesh by (see, e.g., [12, Remark 2.24]).
Definition 3.6** (Consistent and limit-conforming sequence of space-time gradient discretisation).**
A sequence of space-time gradient discretisations is said to be consistent and limit-conforming if , and, for all , tend to 0 as .
Remark 3.7** (Link with the core properties of a GD in the framework of elliptic or parabolic problems).**
An adaptation of [12, Lemma 2.25] to elliptic problems with homogeneous Neumann boundary conditions yields an equivalence between Definition 3.6 and [12, Definitions 3.4 and 3.5] of consistent and limit-conforming sequences of gradient discretisations, assuming that the sequence is compact (this holds true for the GDs detailed in [12, Chapters 8-14]).
Given a space–time gradient discretisation (in the sense of Definition 3.3), we now describe the gradient scheme defined from this GD. For and a given space-time function with , or ( could be , , , or ), set, for a.e. and for all ,
[TABLE]
Let and . The (-implicit) scheme for Problem (3) is defined by replacing the continuous space and operators in (7) with their discrete counterparts given by , as follows: find such that
[TABLE]
denoting for short
[TABLE]
We introduce the following notations and for reconstructed space-time functions: given in , we set
[TABLE]
We extend these definitions to by setting and .
4 Convergence analysis
Our main convergence result is stated in the following theorem. We recall (see [11, Definition 2.11]) that a sequence of bounded functions is said to converge uniformly on weakly in towards a function if for all , the sequence of functions converges uniformly on towards the function .
Theorem 4.1** (Convergence of the GDM).**
Assuming (2), let be a consistent and limit-conforming sequence of space-time gradient discretisations in the sense of Definition 3.6. Let , and be given. Then, for any , there exists a unique solution to Scheme (21) with .
Moreover, as , converges in , and uniformly on weakly in , to the unique solution of Problem (3).
Remark 4.2** (Theoretical order of convergence).**
Assuming sufficient smoothness of the continuous solution and the velocity field, and letting , it seems possible to derive a theoretical error estimate in norm with order . This provides a maximal order 1 if . However, in the numerical tests with a regular solution (see Section 5.3), much better numerical orders of convergence are obtained, even letting . The question of the theoretical derivation of these better rates remains open.
The uniqueness component of this theorem is the most straightforward part, and the purpose of the following lemma.
Lemma 4.3** (Uniqueness of a discrete solution).**
Assuming (2), let be a space-time gradient discretisation in the sense of Definition 3.3. Let , and be given. Then there exists at most one solution to Scheme (21).
Proof.
The scheme defines exactly one approximation . Let us assume that, for a given and for a given , there exist two solutions and to Scheme (21). Let us create the difference of the two equations (21), and let us choose in the resulting equation. We obtain
[TABLE]
It is classical (see for instance [12, Lemma 2.40] or [2, Lemma 2.1]), that
[TABLE]
Applying this inequality in (24) with and (in which the left hand side is therefore the sum of non-negative terms), we get that a.e., and therefore as well as . Hence, thanks to the property of the norm assumed in Definition 3.1, , which concludes the proof of uniqueness by induction.
∎
The proof of Theorem 4.1 hinges on a priori estimates stated in the following lemma.
Lemma 4.4** ( and discrete estimates, existence of a discrete solution).**
Assuming (2), let be a space-time gradient discretisation in the sense of Definition 3.3. Let , and be given. Then there exists one and only one solution to Scheme (21). Moreover, this solution satisfies, for all ,
[TABLE]
and there exists , depending only on , , and such that
[TABLE]
and
[TABLE]
Remark 4.5** (Weak estimate).**
The estimate (27) is the adaptation in the GDM framework of the classical weak estimate used for finite volumes see [5] for the seminal paper and [16, chapters 5 & 6] for more general results. This estimate is used in two occasions: first to pass to the limit in the skew-symmetric term, and second to show that the stabilisation term vanishes at the limit.
Proof.
Before establishing the existence of at least one discrete solution to Scheme (21), let us first prove that any solution to this scheme satisfies (25)–(27). We first notice that for all ,
[TABLE]
Hence, letting in (21) and applying the estimate above with and , we obtain
[TABLE]
Taking and summing this inequality over proves (25).
The Young inequality and the property yield
[TABLE]
Plugging this into (25) leads to
[TABLE]
where we have used the Jensen inequality to bound the -norm of by the -norm of . Estimate (27) directly follows from (28) with . Estimate (26) is also a consequence of (28), once we notice that for a.e. , all and all .
We can now prove the existence of a solution to Scheme (21) (the uniqueness is proved in Lemma 4.3). If then, at each time step, (21) describes a linear square system on (after substituting ). The estimates (26) and (27) show that any solution to this system satisfies a priori bounds. The kernel of the matrix of this linear system is therefore reduced to , and the matrix is invertible, which establishes the existence of a unique solution (and thus of ) to the system at time step .
If we use the topological degree [8]. Let us assume the existence of . Let us substitute the term of the scheme by for . It is clear that the above estimates still hold (again after substituting ) so that and remain bounded independently of . We infer from this latter estimate a bound on that is uniform with respect to . Hence, all solutions to the scheme with the above substitution remain bounded independently of . This shows that, on a large enough ball, the topological degree of the non-linear mapping defining the scheme is independent of . For this mapping is linear and the arguments developed in the case show that its topological degree is non-zero. The degree for the original scheme (corresponding to ) is therefore also non-zero, proving that this scheme has at least one solution. ∎
We can now prove our convergence results, starting with the uniform-in-time weak-in-space convergence.
Proof of Theorem 4.1: uniform-in-time weak-in-space convergence.
Owing to (26) there is and a subsequence of such that converges to in weak- as . Let , and let us denote (belonging to the above subsequence); we drop some indices to simplify the notations.
Let and , and let that realises the minimum in . We denote by the function equal to , on , for all .
For and , let , and notice that and . By definition (18) of and (19) of , since we have, for a.e. , recalling the definition (19) of ,
[TABLE]
Thanks to (26)–(27), there is depending only on and such that
[TABLE]
This right-hand side tends to [math] as (remember that ) and thus, since is bounded in ,
[TABLE]
By strong convergence of to in and weak convergence of to in we infer
[TABLE]
A Cauchy–Schwarz inequality yields
[TABLE]
and, by definition of , and ,
[TABLE]
Therefore, using (27) again,
[TABLE]
We take as test function in (21) and sum the resulting equation over . This gives
[TABLE]
with
[TABLE]
The summation-by-parts formula [12, Eq. (D.17)] reads
[TABLE]
Using this relation to transform, in the sum appearing in , the term into , we see that
[TABLE]
and so, since weakly in , strongly in , and in ,
[TABLE]
Noticing that
[TABLE]
the relation (29) yields
[TABLE]
Moreover, since
[TABLE]
weakly converges to in , strongly converges in , and strongly converges to in , we have
[TABLE]
The Hölder inequality and (27) show that
[TABLE]
The boundedness of in (since this sequence converges in this space) and then yield .
Finally, using (31) again,
[TABLE]
Passing to the limit in (30) shows that satisfies (3) for any test function of the form , and thus for sums of such test functions. Since the set is dense in the set of the restrictions to of the elements of , we conclude that is a solution of (3).
It now suffices to prove the uniform-in-time weak- convergence of to . Let and define as before. For , writing as the sum of its jumps at each (see [12, Proof of Theorem 4.19] for details), Scheme (21) and the estimates in Lemma 4.4 give the existence of , depending only on the data introduced in 2, such that
[TABLE]
Hence, introducing , and using (26) again,
[TABLE]
Using , we get
[TABLE]
with , and . We then may apply [12, Theorem C.11] or [11, Theorem 6.2] to deduce that weakly tends to in uniformly on . ∎
Proof of Theorem 4.1: strong convergence.
The proof makes use of the continuous energy estimate (13) and a discrete version thereof, in a similar way as in the proof of [11, Theorem 2.16]. Let us first establish this discrete energy estimate. We remark that for all ,
[TABLE]
Setting , letting in (21), applying the above relation with , , , , , and dropping the last addend (which is positive), we obtain
[TABLE]
Summing the obtained inequality on , and denoting by the function equal to for all , we get
[TABLE]
Taking the superior limit as of the above inequality for , we get
[TABLE]
We then use (13) to substitute the right-hand side of this inequality and find
[TABLE]
Developing the square we have
[TABLE]
The limit of the second (resp. third) term in the right-hand side is obtained by weak/strong (resp. strong) convergence:
[TABLE]
and
[TABLE]
Hence, using (35) to deal with the first term in the right-hand side of (36) we find
[TABLE]
and therefore, since ,
[TABLE]
which concludes the proof of the convergence of to in .
∎
5 Numerical results
Let and consider meshes as per [12, Definition 7.2]: is the set of polygonal/polyhedral cells , is the set of faces , is a set of points with star-shaped with respect to for all , and is the set of vertices . Let us define two test cases.
Case 1.
This test case is divergence free (it corresponds to the pure transport of a tracer). We choose , if and elsewhere, and is given by
[TABLE]
Case 2.
This test case includes source terms. We choose , , is given by
[TABLE]
and , . Then the solution to (1) can be analytically calculated. Find first by solving the differential equation , letting for any (this is easy owing to the expression of ); set then , which leads to with . This requires to compute such that , since for . Finally, we get that , when is chosen such that , and we have if . Denoting by , this leads to the following expressions.
[TABLE]
5.1 Case 1, different schemes with
We apply Scheme (21) with three different gradient discretisations, corresponding respectively to the mass-lumped conforming finite element method (or CVFE method, see [18] for the seminal paper and [12, Chapter 8] for the study in the GDM framework), to the mass-lumped non-conforming (MLNC– for short) finite element method [12, Chapter 9], and to (a variant of) the Hybrid Finite Volume method (HFV), a member of the family of Hybrid Mimetic Mixed methods [12, chapter 13]. For the sake of completeness we briefly recall the definition of these gradient discretisations.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] K. Aziz and A. Settari. Petroleum Reservoir Simulation . Applied Science Publishers, 1979.
- 2[2] J. W. Barrett and W. B. Liu. Finite element approximation of the p 𝑝 p -Laplacian. Math. Comp. , 61(204):523–537, 1993.
- 3[3] P. B. Bochev, M. D. Gunzburger, and J. N. Shadid. Stability of the SUPG finite element method for transient advection-diffusion problems. Comput. Methods Appl. Mech. Engrg. , 193(23-26):2301–2323, 2004.
- 4[4] E. Burman, A. Ern, and M. A. Fernández. Explicit Runge-Kutta schemes and finite elements with symmetric stabilization for first-order linear PDE systems. SIAM J. Numer. Anal. , 48(6):2019–2042, 2010.
- 5[5] S. Champier and T. Gallouët. Convergence d’un schéma décentré amont sur un maillage triangulaire pour un problème hyperbolique linéaire. Modélisation mathématique et analyse numérique , 26(7):835–853, 1992.
- 6[6] Z. Chen, G. Huan, and Y. Ma. Computational methods for multiphase flows in porous media , volume 2 of Computational Science & Engineering . Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, 2006.
- 7[7] R. Codina. Comparison of some finite element methods for solving the diffusion-convection-reaction equation. Comput. Methods Appl. Mech. Engrg. , 156(1-4):185–210, 1998.
- 8[8] K. Deimling. Nonlinear functional analysis . Springer-Verlag, Berlin, 1985.
