On The Weak Consistency of Finite Volumes Schemes for Conservation Laws on General Meshes
Thierry Gallou\"et (LATP), R. Herbin (LATP), J.-C Latch\'e (IRSN)

TL;DR
This paper develops tools to establish weak consistency of finite volume schemes for multi-dimensional conservation laws on general meshes, extending classical results under minimal regularity assumptions.
Contribution
It introduces a discrete integration by parts approach to prove weak consistency, generalizing the Lax-Wendroff theorem to complex meshes and minimal regularity.
Findings
Establishes weak consistency of finite volume schemes on general meshes
Extends Lax-Wendroff theorem to multi-dimensional, irregular meshes
Demonstrates convergence of discrete gradients in L-infinity weak topology
Abstract
The aim of this paper is to develop some tools in order to obtain the weak consistency of (in other words, analogues of the Lax-Wendroff theorem for) finite volume schemes for balance laws in the multi-dimensional case and under minimal regularity assumptions for the mesh. As in the seminal Lax-Wendroff paper, our approach relies on a discrete integration by parts of the weak formulation of the scheme. This makes a discrete gradient of the test function appear, and the central argument for the scheme consistency is to remark that this discrete gradient is convergent in L weak .
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
TopicsNavier-Stokes equation solutions · Advanced Numerical Methods in Computational Mathematics · Computational Fluid Dynamics and Aerodynamics
On the weak consistency of finite volumes schemes for conservation laws on general meshes
T. Gallouët Université d’Aix-Marseille ([email protected])
R. Herbin Université d’Aix-Marseille ([email protected])
J.-C. Latché Institut de Radioprotection et de Sûreté Nucléaire (IRSN), PSN-RES/SA2I, Cadarache, St-Paul-lez-Durance, 13115, France ([email protected])
Abstract
The aim of this paper is to develop some tools in order to obtain the weak consistency of (in other words, an analogue of the Lax-Wendroff theorem for) finite volume schemes for balance laws in the multi-dimensional case and under minimal regularity assumptions for the mesh. As in the seminal Lax-Wendroff paper, our approach relies on a discrete integration by parts of the weak formulation of the scheme. Doing so, a discrete gradient of the test function appears; the central argument for the scheme consistency is to remark that this discrete gradient is convergent in weak .
keywords:
finite volumes, consistency
1 Introduction
In the early sixties, P.D. Lax and B. Wendroff established that, on uniform 1D grids, a flux-consistent and conservative cell-centered finite-volume scheme for a conservation law is weakly consistent, in the sense that the limit of any a.e. convergent sequence of -bounded numerical solutions, obtained with a sequence of grids with mesh and time steps tending to zero, is a weak solution of the conservation law [11]; this result is known as the Lax-Wendroff theorem, and is reported in many textbooks with some variants: see e.g. [12, Section 12.10] with a BV bound assumption on the scheme, and [7, Theorem 21.2] for a generalisation to non-uniform meshes. However, convergence proofs on unstructured meshes which were obtained for nonlinear scalar conservation laws in the 90’s do not use the Lax-Wendroff theorem; indeed, finite volume schemes on unstructured meshes are known to be in general not TVD (see e.g. an example in [4]), so that a compactness property in is not easy to obtain, although it does hold in fact but results from the proof of uniqueness of the so-called entropy process solution, see e.g. [7, chapter VI] and references therein.
Nevertheless, from a practical point of view, the Lax-Wendroff theorem, even if weaker than a full convergence proof, may be fundamental for the design of numerical schemes. In particular, for many hyperbolic systems (especially in the multi-dimensional case), it represents the essential part of the theoretical foundations, since provable estimates on numerical solutions are too weak to provide sufficient compactness to undertake any convergence study.
The seminal Lax-Wendroff paper has been the starting point for several research works, aimed at relaxing the original assumptions: for instance, an extension to schemes which do not admit a local conservative formulation may be found in [3, 2, 1, 14]; the derivation of analogue consistency results for non-conservative hyperbolic systems is presented in [8, 13]. In the multi-dimensional case and for standard finite volumes schemes, Lax-Wendroff type results have been progressively extended to general (and, in particular, unstructured) discretizations [10], in [9, Section 4.2.2] for two-dimensional simplicial meshes and in [5] for multi-dimensional meshes.
The present paper follows the same route, in the sense that we still extend the application range of the Lax-Wendroff theorem in terms on constraints on the mesh, in particular relaxing the quasi-uniformity assumption. However, compared to [5], the assumptions and the technique of proof are different; we consider general meshes with only a regularity assumption linked to the definition of a discrete gradient, but require the flux function to be Lipschitz continuous or at least “lip-diag”, while in [5] the space-time grid is assumed quasi-uniform but the flux is only required to be continuous, and we return to a strategy close to the original work: the scheme is multiplied by a test function and integrated over space and time, and a discrete integration by parts of the convection term yields the integral of the product of the numerical flux by a discrete gradient of the test function (this latter seems to appear first in [6], where its convergence properties are shown for specific meshes and norms). Then the passage to the limit of vanishing space and time steps in the scheme requires two ingredients:
a convergence result for the discrete gradient; contrary to what happens in the 1D case or for Cartesian grids, this convergence is only weak, namely in weak , which is however sufficient to conclude,
- -
the control of some residual terms, which basically consists in the difference between the numerical solution and a space or time translate of this latter; the difficulty here lies in the fact that the translation amplitude is (locally) mesh-dependent (for instance, the function is translated from one cell to its neighbour), so that standard results for converging sequences of functions in may no longer be applied.
The presentation is organized as follows: after a definition of the considered space discretizations (Section 2), we address successively the two above-mentioned issues (Section 3 and 4 respectively), carefully clarifying in these two sections the regularity requirements for the mesh. Then we show in Section 5 how to use the obtained results to obtain a weak consistency result for a standard finite volume discretization of a balance law; consistency requirements for the numerical flux appear in this step.
2 Space discretization
Let be an open bounded polyhedral set of , . A polyhedral partition of is a finite partition of such that each element of this partition is measurable and has a boundary that is composed of a finite union of part of hyperplanes (the faces of ) denoted by , so that where is the set of the faces of . Such a polyhedral partition is called a “mesh”. We denote by the set of all the faces, namely . If is a face of this partition, then one denotes by the -Lebesgue measure of . We denote by the set of elements of such that there exist and in () such that ; such a face is denoted by . The set of faces located on the boundary of , i.e. , is denoted by . For we denote by the diameter of . The size of the mesh is . For and , we denote by the normal vector of outward .
We also introduce now a dual mesh, that is a new partition of indexed by the elements of , namely . For , the set is supposed to be a subset of and we define , so (see Figure 1).
If is a measurable set of , we denote by the Lebesgue measure of .
3 A weakly convergent discrete gradient
Let and, for , let be a point of and . For , let
[TABLE]
We characterize the regularity of the mesh by the following parameter:
[TABLE]
Note that for Cartesian meshes, With this definition, we get for ,
[TABLE]
where is the piecewise constant function equal to over , for .
Lemma 1**.**
Let be a sequence of meshes such that the mesh step tends to zero when tends to . We suppose that the mesh parameters defined by (2) are uniformly bounded with respect to , i.e.:
[TABLE]
Let and, for , let be defined by (1). Then the sequence is bounded in uniformly with respect to and converges to in weak .
Proof.
The fact that the sequence is bounded in is a straightforward consequence of Inequality (3) and the assumption for . Let . For and , let and be defined by the mean value of over and respectively. Since is piecewise constant over the dual cells , we have
[TABLE]
with
[TABLE]
We first consider . Since has a compact support in , the quantity vanishes for any . We thus get, using the definition (1) of the discrete gradient and reordering the sums:
[TABLE]
Hence,
[TABLE]
with
[TABLE]
The remainder term may be bounded as follows
[TABLE]
and thus
[TABLE]
The term reads, once again thanks to the definition (1) of the discrete gradient:
[TABLE]
Since is regular, there exists and such that and respectively. Hence, since , we have thanks to (3):
[TABLE]
and thus
[TABLE]
The conclusion of the proof is obtained by invoking the density of the functions of in .
∎
Remark 3.1**.**
Estimates (5) and (6), show that the difference defined by
[TABLE]
can be bounded by a parameter depending only on the sequence of meshes and on , and . This point is used hereafter to extend the present convergence result to time depending functions.
Remark 3.2** (Choice of and ).**
Note that, apart from the need to ensure the regularity of the sequence of meshes (i.e. for ), there is almost no constraint on the choice of in and on , which is just a volume associated to the face which, for the proof of Lemma 1, does not even need to contain itself.
Remark 3.3** (On the mesh regularity assumption).**
Some regularity constraints for the sequence of meshes may be shown to be strong enough to control the parameter . First, let us suppose that the cells are not allowed to be too flat, i.e. that there exists such that
[TABLE]
Then, let us denote by the parameter:
[TABLE]
Since the definition of is almost arbitrary, may be kept bounded away from zero for any sequence of meshes, provided that the number of faces of the cells is bounded; for instance, in Section 5, we choose is such a way that is equal to the inverse of the maximum number of cell faces. We then have:
[TABLE]
The case of ”flat cells” is more intricate. However, let us suppose that, for and , ,
* and may be chosen such that and are star-shaped with respect to and respectively,*
- -
we choose for and the cones of basis and vertex and respectively,
- -
there exists such that (which may be referred to as a ”uniform orthogonality condition”).
Then (see Fig. 2).
The analysis of finite volume schemes for (systems of) conservation laws necessitates the extension of Lemma 1 to time-dependent functions. Let and a time discretization of the interval , i.e. a sequence with , be given; we define and . Let ; then the piecewise function is defined by:
[TABLE]
where, for and , , and for a given set , is the characteristic function of , that is if and otherwise. Then the following weak convergence result holds.
Lemma 2**.**
Let be a sequence of meshes such that the mesh step tends to zero when tends to and satisfies the assumption (4). For , we suppose given a time discretization , and suppose that also tends to zero when tends to .
Let and, for , be defined by (8). Then the sequence is bounded in uniformly with respect to and converges to in weak .
Proof.
Let , and let us define, for , the following functions of time:
[TABLE]
Thanks to remark 3.1 and the regularity of and , converges to uniformly with respect to , with . The integral
[TABLE]
where is a remainder term tending to zero as thanks to the regularity of . We have
[TABLE]
The second term tends to zero when tends to thanks to the uniform convergence of to . By the regularity of , the first one converges to
[TABLE]
The conclusion follows by density of in .
∎
4 Convergence of “discrete translations” of functions of
The proof of the original Lax-Wendroff theorem (extended to non uniform meshes in [7, Theorem 21.2]) relies on the mean continuity of integrable functions, which is used to prove that for a sequence of converging functions in ,
[TABLE]
This proof may be extended to Cartesian meshes; however, on an unstructured mesh, the notion of translation is no longer clear and the problem must be reformulated as follows. For and , we denote by the mean value of and we set for , , . We now introduce the quantity
[TABLE]
The objective of this section is to prove that, for a sequence of functions of and a sequence of increasingly refined meshes , supposed to be regular in a sense to be defined, the quantity tends to zero as uniformly with respect to . Note that in the case of a uniform 1D mesh such that for any , this is equivalent to showing (9).
The proof of this result is split in two steps; we first consider a fixed function and prove a generalisation of the mean continuity in Lemma 3; we then address the case of a converging sequence in in Lemma 5. The technique used here is reminiscent of underlying arguments invoked in [9, Section 4.2.2] for two-dimensional triangular meshes; we consider here general meshes, paying a special attention to mesh regularity requirements.
To formulate the regularity assumption of the sequence of meshes considered in this section, we introduce the following parameter:
[TABLE]
By definition, we thus have , for , .
Lemma 3**.**
Let and be a sequence of meshes such that for all and . We suppose that the number of faces of a cell is bounded by , for any . Let , let denote the mean value of on a cell , and let be defined by (10). Then,
[TABLE]
Proof.
We first note that for and a mesh ,
[TABLE]
Then, for any ,
[TABLE]
Let . Since is dense in , there exists such that . Then, with this choice of ,
[TABLE]
We now use only the fact that is Lipschitz continuous. There exists such that for all . Then, for any , using ,
[TABLE]
This yields
[TABLE]
Since , there exists such that for and then, with (14),
[TABLE]
∎
The convergence result which constitutes the aim of this section is stated in the following lemma.
Lemma 4**.**
*Let and be a sequence of meshes such that for all and . We suppose that the number of faces of a cell is bounded by , for any . Let and be a sequence of functions of such that in as . Let be defined by (10).
Then tends to zero when tends to uniformly with respect to .*
Proof.
Using (13) with and , we obtain
[TABLE]
Let . Since in , as , there exists such that for , and then
[TABLE]
We use now Lemma 3. There exists such that for and then, for and ,
[TABLE]
Using again Lemma 3 for gives such for and ,
[TABLE]
∎
Remark 4.1**.**
The underlying ideas of the proofs of this section may be summed up as follows. Let be a sequence of semi-norms acting on a Banach space to satisfying two properties:
uniform boundedness: there exists such that for any and ,
- -
convergence to zero on a dense subspace: there exists and dense in such that, for any , .
Then, for any converging sequence in , tends to zero uniformly with respect to .
This result extends to time depending functions as follows. Let and be a time discretization of the interval , as defined in the previous section. For , and , let be the mean value of over . For , and for , let ; for and , we set . We define the following quantity:
[TABLE]
Then the following lemma results from easy extensions (in fact, reasoning in instead of ) of the previous proofs of this section.
Lemma 5**.**
*Let and be a sequence of meshes such that for all and . We suppose that the number of faces of a cell is bounded by , for any . For , we suppose given a time discretization , and suppose that also tends to zero when tends to . Let and be a sequence of functions of such that in as .
Then tends to zero when tends to uniformly with respect to .*
Note that the results of this section allow to show the weak consistency of conservative finite volume schemes without the boundedness assumptions that are found in e.g. [12, chapter 12], [14]; indeed, the limit on the translates (9) is shown directly from the convergence assumption thanks to the above lemmas. In fact, finite volume schemes are known to be non TVD on non-structured meshes, so that these boundedness assumptions are difficult to satisfy in this case. The two above lemmas are used in Theorem 6 below to show the weak consistency of finite volume schemes, so that the sequences of functions which are considered are piecewise constant. But in fact, these lemmas could also be used for other types of functions for instance in the case of higher order schemes.
5 Weak consistency of conservative finite volumes discretizations of conservation laws
Let us consider the following conservation law posed over :
[TABLE]
where is a regular flux function. This equation is complemented with the initial condition for a.e. , where is a given function of , and convenient boundary conditions on the boundary , see remark 5.1. For a given mesh and time discretization , a finite volume approximation of Equation (16) reads
[TABLE]
where is the numerical flux. Equation (17) is complemented by the initial condition:
[TABLE]
and convenient boundary fluxes. The discrete unknowns are associated to a function of as follows:
[TABLE]
where and stand for the characteristic function of and the interval respectively.
We now suppose given a sequence of meshes and time discretizations , with and tending to zero as tends to , and, for , denote by the function obtained with and . Let us suppose that the sequence converges in to a function . The aim of this section is to determine sufficient conditions for to satisfy the weak formulation of Equation (16), i.e.
[TABLE]
This is obtained by letting the space and time step tend to zero and passing to the limit in the scheme, and this issue is referred to as a weak consistency property of the scheme.
Remark 5.1** (Weak formulation and boundary conditions).**
Note that the weak formulation (20) is incomplete, in the sense that it does not imply anything on boundary conditions, since test functions are supposed to have a support compact in ; in fact, weak formulation of boundary conditions is a difficult problem for hyperbolic problems, still essentially open for systems, and out of scope of the present paper.
Theorem 6** (An extension of the Lax-Wendroff theorem).**
Let and time discretizations , with and tending to zero as tends to , and, for , denote by the function obtained with and . Assume that the sequence converges to in to a function . Assume furthermore that
- * the sequence converges in to ,*
- * the sequence of meshes satisfies the regularity assumptions of Lemma 2*
- * there exists a real number depending only on , such that*
[TABLE]
- * the regularity assumptions for the mesh of Lemma 5 are satisfied.*
Then satisfies (20) i.e. it is a weak solution of Equation (16).
Proof.
To this purpose, let ; then if the distance from to the boundary is such that , and similarly if where . For a given mesh whose size is such that and time discretisation such that , let us define by
[TABLE]
where stands for a point of . Let us multiply Equation (17) by and sum over the cells and time steps, to obtain , with
[TABLE]
where the notation means that the summation is performed over the internal faces of the cell , each internal face separating from an adjacent cell denoted by . Reordering the sums (this may be seen as a discrete integration by parts with respect to time), the term may be recast as , with
[TABLE]
Let us denote by the following time discrete derivative of :
[TABLE]
Thanks to the regularity of , tends to when tends to in . Since
[TABLE]
we thus get
[TABLE]
Thanks to Equation (18) and the regularity of , we also get
[TABLE]
Finally,
[TABLE]
with the Lipschitz-continuity constant of , and tends to zero thanks to Lemma 5.
Let us now turn to term . Reordering the sums (which, now, may be seen as a discrete integration by part with respect to space), we get:
[TABLE]
For , , we must now define a volume , and this choice may be to some extent tuned according to the mesh at hand (see Remark 3.2). Let us for instance suppose here that , with (respectively ) and , where stands for the number of edges of (it is easy to check that such a partition exists, noting that needs not be a polyhedron). With this definition, we may write with
[TABLE]
We identify
[TABLE]
with the definition (8) of . Thanks to the assumptions and of the theorem, we get that
[TABLE]
Thanks to the assumption and owing to the regularity of which implies that is bounded in under the mesh regularity assumptions of Lemma 2, we obtain that
[TABLE]
where depends only on , and thus, thanks to the assumption , tends to zero as tends to . ∎
Let us now comment on the assumptions used in the theorem
Assumptions and are regularity assumptions for the sequence of meshes. Hypothesis amounts to suppose that the number of cell faces is bounded and, with the definition of the volumes chosen in this section, that the ratio , for any pair of neighbouring cells, is bounded. The constraints associated to Assumption are discussed in Remark 3.3 (for instance, we may assume that the cells do not becomes too flat, in the sense of Inequality (7)).
- -
Assumption states the convergence of the sequence to in . It is just a consequence of the convergence of to in if the function is bounded (thanks to the Lebesgue dominated convergence theorem); in the other cases, it demands stronger convergence assumptions (for instance, with , convergence in is required).
- -
Assumption (i.e. Inequalities (21)) is a constraint over the numerical flux. For instance, with a two-point flux , it is implied by the usual assumptions:
[TABLE]
Remark 5.2** (On the Lipschitz assumption on the flux).**
The Lipschitz continuity assumption on the flux may in fact be replaced by the following weaker “Lip-diag” condition:
[TABLE]
In the case of a MUSCL scheme for the convection equation by a regular velocity , the discretization of the flux on is given by with depending on and but also on another upwind cell; however, if the flux is assumed to be Lip-diag with respect to the value , is always a convex combination of and and Assumption holds.
It seems impossible to relax this assumption to the case of a merely continuous flux without additional conditions: indeed in [5], a counterexample is given for non space-time quasi-uniform grids; in this counter-example, the space mesh is quasi-uniform, so that the assumptions of Theorem 6 are clearly satisfied apart from the Lipschitz assumption on the flux.
Moreover, the Lip-diag framework seems interesting for a number of schemes; for instance when replacing the Roe flux by the Rusanov flux when an entropy correction is needed, the continuity of the flux is lost but not the Lip-diag property.
Finally, let us conclude by mentioning a possible generalization of for multiple point fluxes. For instance, if, on , with a neighbour of , we may replace the first inequality of (21) by
[TABLE]
and then use . We obtain that still reads as a summation of jumps across the faces; however, the weight of is now more complex, and its control by needs a stronger regularity assumption on the mesh. Such a situation is faced, for instance, when using a second order Runge-Kutta scheme for the time discretization instead of the Euler scheme.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] R. Abgrall and F. Marpeau. Residual distribution schemes on quadrilateral meshes. Journal of Scientific Computing , 30:131–175, 2006.
- 2[2] R. Abgrall and P.L. Roe. High order fluctuation schemes on triangular meshes. Journal of Scientific Computing , 19:3–36, 2003.
- 3[3] M.H. Carpenter, D. Gottlieb, and C.-W. Shu. On the conservation and convergence to weak solutions of global schemes. Journal of Scientific Computing , 18:111–132, 2003.
- 4[4] 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.
- 5[5] V. Elling. A Lax-Wendroff type theorem for unstructured quasi-uniform grids. Mathematics of Computation , 76:251–272, 2007.
- 6[6] R. Eymard and T. Gallouët. H-convergence and numerical schemes for elliptic equations. SIAM Journal on Numerical Analysis , 41:539–562, 2000.
- 7[7] R. Eymard, T. Gallouët, and R. Herbin. Finite volume methods. In P. Ciarlet and J.L. Lions, editors, Handbook of Numerical Analysis, Volume VII , pages 713–1020. North Holland, 2000, https://hal.archives-ouvertes.fr/.
- 8[8] R.P. Fedkiw, B. Merriman, and S. Osher. Simplified discretization of systems of hyperbolic conservation laws containing advection equations. Journal of Computational Physics , 157:302–326, 2000.
