Global Information Lookup Global Information

Gradient discretisation method information


Exact solution

of the p-Laplace problem on the domain [0,1] with (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 [1] (the quantities , and , 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.[2] 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.[3]

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

  1. ^ R. Eymard, C. Guichard, and R. Herbin. Small-stencil 3d schemes for diffusive flows in porous media. M2AN, 46:265–290, 2012.
  2. ^ J. Droniou, R. Eymard, T. Gallouët, and R. Herbin. Gradient schemes: a generic framework for the discretisation of linear, nonlinear and nonlocal elliptic and parabolic equations. Math. Models Methods Appl. Sci. (M3AS), 23(13):2395–2432, 2013.
  3. ^ J. Leray and J. Lions. Quelques résultats de Višik sur les problèmes elliptiques non linéaires par les méthodes de Minty-Browder. Bull. Soc. Math. France, 93:97–107, 1965.

and 11 Related for: Gradient discretisation method information

Request time (Page generated in 0.7795 seconds.)

Gradient discretisation method

Last Update:

In numerical mathematics, the gradient discretisation method (GDM) is a framework which contains classical and recent numerical schemes for diffusion problems...

Word Count : 2302

List of numerical analysis topics

Last Update:

of solutions gradient discretisation method — based on both the discretization of the solution and of its gradient Finite element method in structural...

Word Count : 8344

GDM

Last Update:

Manager Gold Decoration for Merit, an honour of South Africa Gradient discretisation method Grassroots Development Movement, a political party in Liberia...

Word Count : 88

Material point method

Last Update:

the deformation gradient. Unlike other mesh-based methods like the finite element method, finite volume method or finite difference method, the MPM is not...

Word Count : 3481

Boundary element method

Last Update:

element methods are significantly less efficient than volume-discretisation methods (finite element method, finite difference method, finite volume method)....

Word Count : 2071

Verlet integration

Last Update:

Verlet integration (French pronunciation: [vɛʁˈlɛ]) is a numerical method used to integrate Newton's equations of motion. It is frequently used to calculate...

Word Count : 5520

Schwarz alternating method

Last Update:

In mathematics, the Schwarz alternating method or alternating process is an iterative method introduced in 1869–1870 by Hermann Schwarz in the theory of...

Word Count : 980

Computational fluid dynamics

Last Update:

visualization of the resulting solution. The stability of the selected discretisation is generally established numerically rather than analytically as with...

Word Count : 8513

Flux limiter

Last Update:

robust upwind discretisation method for advection, diffusion and source terms", in Vreugdenhil, C.B.; Koren, B. (eds.), Numerical Methods for Advection–Diffusion...

Word Count : 2521

Normal distributions transform

Last Update:

with gradient-based methods (in the original formulation, the authors use Newton's method). In order to reduce the effect of cell discretisation, a technique...

Word Count : 808

MUSCL scheme

Last Update:

constant approximations for each cell, and results in a first-order upwind discretisation of the above problem with cell centres indexed as i {\displaystyle i}...

Word Count : 4484

PDF Search Engine © AllGlobal.net