Jump to content

Gradient discretisation method

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Cyclotourist (talk | contribs) at 18:27, 5 November 2016 (Created page with '{{Differential equations}} The '''Gradient Discretisation Method''' (GDM) is a framework which contains classical and recent discretisation schemes for diffusion...'). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

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 then be known to converge on these problems; this occurs in the case of the conforming Finite Elements, the Raviart--Thomas Mixed Finite Elements, or the $\Pfe_1$ 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 example of a linear diffusion problem

Consider a simple Poisson problem in a domain , with homogeneous Dirichlet boundary conditionspartial differential equation

where , and the solution is such that



The GDM is defined by , where:

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 $\Omega$,

the gradient reconstruction , a ``gradient (vector-valued function) over $\Omega$. 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 [1]:

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 forall , tends to 0.


See also

References

  • 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.

  1. ^ Strang