Gradient discretisation method

Uses your system voice; voice and rate in settings.

Snapshot

≈ 10 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

[[Image:Plaplacien4.svg|thumb|right|400px|Exact solution \overline{u}(x) = \frac 3 4 \left({0.5}^{4/3}- |x - 0.5|^{4/3}\right) of the p-Laplace problem -( |\overline{u}'|^2 \overline{u}')'(x) = 1 on the domain [0,1] with \overline{u}(0) = \overline{u}(1) = 0 (black line) and approximate one (blue line) computed with the first degree discontinuous Galerkin method plugged into the GDM (uniform mesh with 6 elements). In numerical mathematics, the gradient discretisation method (GDM) is a framework which contains classical and recent numerical schemes for diffusion problems of various 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 (or may even be meshless). Some core properties are required to prove the convergence of a GDM. These core properties enable complete proofs of convergence of the GDM for elliptic and parabolic problems, linear or non-linear. For linear problems, stationary or transient, error estimates can be established based on three indicators specific to the GDM (the quantities C_{D} , S_{D} and W_{D} , see below). For non-linear problems, the proofs are based on compactness techniques and do not require any non-physical strong regularity assumption on the solution or the model data.…

[[Image:Plaplacien4.svg|thumb|right|400px|Exact solution \overline{u}(x) = \frac 3 4 \left({0.5}^{4/3}- |x - 0.5|^{4/3}\right) of the p-Laplace problem -( |\overline{u}'|^2 \overline{u}')'(x) = 1 on the domain [0,1] with \overline{u}(0) = \overline{u}(1) = 0 (black line) and approximate one (blue line) computed with the first degree discontinuous Galerkin method plugged into the GDM (uniform mesh with 6 elements). In numerical mathematics, the gradient discretisation method (GDM) is a framework which contains classical and recent numerical schemes for diffusion problems of various 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 (or may even be meshless). Some core properties are required to prove the convergence of a GDM. These core properties enable complete proofs of convergence of the GDM for elliptic and parabolic problems, linear or non-linear. For linear problems, stationary or transient, error estimates can be established based on three indicators specific to the GDM (the quantities C_{D} , S_{D} and W_{D} , see below). For non-linear problems, the proofs are based on compactness techniques and do not require any non-physical strong regularity assumption on the solution or the model data. Non-linear models for which such convergence proof of the GDM have been carried out comprise: the Stefan problem which is modelling a melting material, two-phase flows in porous media, the Richards equation of underground water flow, the fully non-linear Leray—Lions equations. Any scheme entering the GDM framework is then known to converge on all these problems. This applies in particular to conforming Finite Elements, Mixed Finite Elements, nonconforming Finite Elements, and, in the case of more recent schemes, the Discontinuous Galerkin method, 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

Consider Poisson's equation in a bounded open domain \Omega\subset \mathbb{R}^d , with homogeneous Dirichlet boundary condition where f\in L^2(\Omega) . The usual sense of weak solution to this model is: In a nutshell, the GDM for such a model consists in selecting a finite-dimensional space and two reconstruction operators (one for the functions, one for the gradients) and to substitute these discrete elements in lieu of the continuous elements in (2). More precisely, the GDM starts by defining a Gradient Discretization (GD), which is a triplet D = (X_{D,0},\Pi_D,\nabla_D) , where: the set of discrete unknowns X_{D,0} is a finite dimensional real vector space, the function reconstruction \Pi_D~:~X_{D,0}\to L^2(\Omega) is a linear mapping that reconstructs, from an element of X_{D,0} , a function over \Omega , the gradient reconstruction \nabla_D~:~X_{D,0}\to L^2(\Omega)^d is a linear mapping which reconstructs, from an element of X_{D,0} , a "gradient" (vector-valued function) over \Omega . This gradient reconstruction must be chosen such that \Vert \nabla_D \cdot \Vert_{L^2(\Omega)^d} is a norm on X_{D,0} . The related Gradient Scheme for the approximation of (2) is given by: find u\in X_{D,0} such that The GDM is then in this case a nonconforming method for the approximation of (2), which includes the nonconforming finite element method. Note that the converse is not true, in the sense that the GDM framework includes methods such that the function \nabla_D u cannot be computed from the function \Pi_D u . The following error estimate, inspired by G. Strang's second lemma, holds and defining: {{NumBlk|:| C_D = \max_{v\in X_{D,0}\setminus\{0\}}\frac {\Vert \Pi_D v\Vert_{L^2(\Omega)}} {\Vert \nabla_D v \Vert_{L^2(\Omega)^d}}, | }} which measures the coercivity (discrete Poincaré constant), {{NumBlk|:| \forall \varphi\in H^1_0(\Omega),\, S_{D}(\varphi) = \min_{v\in X_{D,0}}\left(\Vert\Pi_D v - \varphi\Vert_{L^2(\Omega)} + \Vert\nabla_D v -\nabla\varphi\Vert_{L^2(\Omega)^d}\right), | }} which measures the interpolation error, {{NumBlk|:| \forall \varphi\in H_\operatorname{div}(\Omega),\, W_D(\varphi) = \max_{v\in X_{D,0}\setminus\{0\}}\frac{ \left|\int_\Omega \left(\nabla_D v(x)\cdot\varphi(x) + \Pi_D v(x) \operatorname{div}\varphi(x)\right) \, dx \right|}{\Vert \nabla_D v \Vert_{L^2(\Omega)^d}}, | }} which measures the defect of conformity. Note that the following upper and lower bounds of the approximation error can be derived: Then the core properties which are necessary and sufficient for the convergence of the method are, for a family of GDs, the coercivity, the GD-consistency and the limit-conformity properties, as defined in the next section. More generally, these three core properties are sufficient to prove the convergence of the GDM for linear problems and for some nonlinear problems like the p -Laplace problem. For nonlinear problems such as nonlinear diffusion, degenerate parabolic problems..., we add in the next section two other core properties which may be required.

The core properties allowing for the convergence of a GDM

Let (D_m)_{m\in\mathbb{N}} be a family of GDs, defined as above (generally associated with a sequence of regular meshes whose size tends to 0). For all \varphi\in H^1_0(\Omega) , \lim_{m\to\infty} S_{D_m} (\varphi) = 0 (defined by ( )). For all \varphi\in H_\operatorname{div}(\Omega) , \lim_{m\to\infty} W_{D_m}(\varphi) = 0 (defined by ( )). This property implies the coercivity property.

Compactness (needed for some nonlinear problems)

For all sequence (u_m)_{m\in\mathbb{N}} such that u_m \in X_{D_m,0} for all m\in\mathbb{N} and (\Vert u_m \Vert_{D_m})_{m\in\mathbb{N}} is bounded, then the sequence (\Pi_{D_m} u_m)_{m\in\mathbb{N}} is relatively compact in L^2(\Omega) (this property implies the coercivity property).

Piecewise constant reconstruction (needed for some nonlinear problems)

Let D = (X_{D,0}, \Pi_D,\nabla_D) be a gradient discretisation as defined above. The operator \Pi_D is a piecewise constant reconstruction if there exists a basis (e_i)_{i\in B} of X_{D,0} and a family of disjoint subsets (\Omega_i)_{i\in B} of \Omega such that \Pi_D u = \sum_{i\in B}u_i\chi_{\Omega_i} for all u=\sum_{i\in B} u_i e_i\in X_{D,0} , where \chi_{\Omega_i} is the characteristic function of \Omega_i .

Some non-linear problems with complete convergence proofs of the GDM

We review some problems for which the GDM can be proved to converge when the above core properties are satisfied. -\operatorname{div}(\Lambda(\overline{u})\nabla \overline{u}) = f In this case, the GDM converges under the coercivity, GD-consistency, limit-conformity and compactness properties.

p-Laplace problem for p > 1

-\operatorname{div}\left(|\nabla \overline{u}|^{p-2}\nabla \overline{u}\right) = f In this case, the core properties must be written, replacing L^2(\Omega) by L^p(\Omega) , H^1_0(\Omega) by W^{1,p}_0(\Omega) and H_\operatorname{div}(\Omega) by W_\operatorname{div}^{p'}(\Omega) with \frac 1 p +\frac 1 {p'}=1 , and the GDM converges only under the coercivity, GD-consistency and limit-conformity properties. \partial_t \overline{u}- \operatorname{div}(\Lambda (\overline{u}) \nabla \overline{u}) = f In this case, the GDM converges under the coercivity, GD-consistency (adapted to space-time problems), limit-conformity and compactness (for the nonlinear case) properties. \partial_t \beta(\overline{u})-\Delta \zeta(\overline{u}) = f Note that, for this problem, the piecewise constant reconstruction property is needed, in addition to the coercivity, GD-consistency (adapted to space-time problems), 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 the fifth one (piecewise constant reconstruction).

Galerkin methods and conforming finite element methods

Let V_h\subset H^1_0(\Omega) be spanned by the finite basis (\psi_i)_{i\in I} . The Galerkin method in V_h is identical to the GDM where one defines X_{D,0} = \{ u = (u_i)_{i\in I} \} = \mathbb{R}^I, \Pi_D u = \sum_{i\in I} u_i \psi_i \nabla_D u = \sum_{i\in I} u_i \nabla\psi_i. In this case, C_D is the constant involved in the continuous Poincaré inequality, and, for all \varphi\in H_\operatorname{div}(\Omega) , W_{D}(\varphi) = 0 (defined by ( )). Then ( ) and ( ) are implied by Céa's lemma. The "mass-lumped" P^1 finite element case enters the framework of the GDM, replacing \Pi_D u by \widetilde{\Pi}_D u = \sum_{i\in I} u_i \chi_{\Omega_i} , where \Omega_i is a dual cell centred on the vertex indexed by i\in I . Using mass lumping allows to get the piecewise constant reconstruction property.

See also

Finite element method

References

Text derived from https://en.wikipedia.org/w/index.php?oldid=1375676268 under CC BY-SA 4.0; modifications have been made.

Provenance

snapshot enwiki-001375676268 · captured 1789798009.0 · version history

Cite this page as: encyclopegia.org, “Gradient discretisation method”, snapshot enwiki-001375676268. https://encyclopegia.org/a/gradient-discretisation-method

Sources cited in this revision

No external citation was extracted for this revision. That is a statement about the source, not a claim that none exists.