Content deleted Content added
Cyclotourist (talk | contribs) |
m Re-worked the introduction, and the start of the linear section |
||
Line 1:
{{Differential equations}}
In numerical mathematics, the '''gradient discretisation method (GDM)''' is a framework which contains classical and recent
Some core properties are required to prove the convergence of a GDM.
Any scheme entering the GDM framework is then known to converge on all these problems. This applies in particular to conforming Finite Elements, Raviart—Thomas Mixed Finite Elements, the <math>P^1</math> non-conforming Finite Elements, and, in the case of more recent schemes, the Hybrid Mixed Mimetic method, the Nodal Mimetic Finite Difference method, some Discrete Duality Finite Volume schemes, and some Multi-Point Flux Approximation schemes.
==The example of a linear diffusion problem==
Line 10 ⟶ 12:
:<math>\quad (1) \qquad \qquad -\Delta \overline{u} = f,</math>
where <math>f\in L^2(\Omega)</math>
:<math>\quad (2) \qquad\mbox{Find
* the set of discrete unknowns <math>X_{D,0}</math> is a finite dimensional real vector space,
Line 73 ⟶ 75:
The operator <math>\Pi_D</math> is a piecewise constant reconstruction if there exists a basis <math>(e_i)_{i\in B}</math> of <math>X_{D,0}</math> and a family of disjoint subsets <math>(\Omega_i)_{i\in B}</math> of <math>\Omega</math> such that <math>\Pi_D u = \sum_{i\in B}u_i\chi_{\Omega_i}</math> for all <math>u=\sum_{i\in B} u_i e_i\in X_{D,0}</math>, where <math>\chi_{\Omega_i}</math> is the characteristic function of <math>\Omega_i</math>.
==
We review some problems for which the GDM can be proved to converge when the above core properties are satisfied.
|