In numerical mathematics, the gradient discretisation method (GDM) is a framework which contains classical and recent discretisation schemes for diffusion problems of different kinds: linear or non linear, steady-state or time-dependent. The schemes may be conforming or non conforming and may rely on very general polygonal or polyhedral meshes.
Some core properties are required to prove the convergence of a GDM. Owing to these core properties, it is possible to prove the convergence of a GDM for standard elliptic and parabolic problems, linear or non-linear. Then any scheme entering the GDM framework is known to converge on these problems; this occurs in the case of the conforming Finite Elements, the Raviart—Thomas Mixed Finite Elements, or the non-conforming Finite Elements, or in the case of more recent schemes, such as the Hybrid Mixed Mimetic or Nodal Mimetic methods, some Discrete Duality Finite Volume schemes, and some Multi-Point Flux Approximation schemes.
the set of discrete unknowns is a finite dimensional real vector space,
the function reconstruction is a linear mapping that reconstructs, from an element of , a function over ,
the gradient reconstruction is a linear mapping which reconstructs, from an element of , a "gradient" (vector-valued function) over . This gradient reconstruction must be chosen such that is a norm on .
The Gradient Scheme for the approximation of (2) is given by: find such that
Then there holds the following error estimate, inspired by [Strang,1972]
and
defining:
Then the core properties which are sufficient for the convergence of the method are, for a family of GDM, that remains bounded, that, for all , tends to 0, and that for all , tends to 0. These core properties are not sufficient for proving the convergence of the GDM when applied to some nonlinear problems (nonlinear diffusion, degenerate parabolic problems...),
and we detail in the next section the set of core properties which are required for covering a larger range of problems.
The core properties allowing for the convergence of a GDM
These properties are defined for a family of GDM defined as above (generally associated with a sequence of regular meshes whose size tends to 0).
Coercivity
The sequence (defined by (6)) remains bounded.
GD-consistency
For all , (defined by (7)).
Limit-conformity
For all , (defined by (8)).
Compactness (needed for some nonlinear problems)
For all sequence such that for all and is bounded, then the sequence is relatively compact in .
Piecewise constant reconstruction (needed for some nonlinear problems)
Let be a gradient discretisation as defined above.
The operator is a piecewise constant reconstruction if there exists a basis of and a family of disjoint subsets of such that for all , where is the characteristic function of .
Review of some problems which may be approximated by a GDM
We pass into review a few problems for which the GDM can be proved to converge when the above core properties are satisfied.
Nonlinear stationnary diffusion problems
In this case, the GDM converges under the coercivity, GD-consistency, limit-conformity and compactness properties.
-Laplace problem for
In this case, the core properties must be written, replacing by , by and by with , and the GDM converges only under the coercivity, GD-consistency and limit-conformity properties.
Linear and nonlinear heat equation
In this case, the GDM converges under the coercivity, GD-consistency, limit-conformity and compactness (for the nonlinear case) properties.
Degenerate parabolic problems
Assume that and are nondecreasing Lipschitz continuous functions:
Note that, for this problem, the piecewise constant reconstruction property is needed, in addition to the coercivity, GD-consistency, limit-conformity and compactness properties.
Review of some numerical methods which are GDM
All the methods below satisfy the first four core properties of GDM (coercivity, GD-consistency, limit-conformity, compactness), and in some cases piecewise constant reconstruction.
Galerkin methods and conforming Finite Element methods
Let be spanned by the finite basis . The Galerkin method in is identical to the GDM where one defines
,
.
In this case, is the constant involved in the continuous Poincaré's inequality, and, for all , (defined by (8)).
The "mass-lumped" finite element case enters in the framework of the GDM: it suffices to replace by , where is a dual cell centred on the vertex indexed by . Using mass lumping allows to get the piecewise constant reconstruction property.
Nonconforming finite element
On a mesh which is a conforming set of simplices of , the nonconforming finite elements are defined by the basis of the functions which are affine in any , and whose value at the centre of gravity of one given face of the mesh is 1 and 0 at all the others. Then the method enters into the GDM framework with the same definition as in the case of the Galerkin method, except the fact that must be understood as the "broken gradient" of , in the sense that it is the piecewise constant function equal in each simplex to the gradient of the affine function in the simplex.
Mixed Finite Element
The Mixed Finite Element method consists in defining two discrete spaces, one for the approximation of and another one for .
It suffices to use the discrete relations between these approximations for defining a GDM. Using the low degree Raviart-Thomas mixed finite elements allows to get the piecewise constant reconstruction property.
Mimetic Finite Difference method and nodal Mimetic Finite Difference method
Strang, G.. (1972) "Variational crimes in the finite element method" The mathematical foundations of the finite element method with applications to partial differential equations, p. 689–710.