The gradient discretisation method (Q1649994)

From MaRDI portal
scientific article
Language Label Description Also known as
English
The gradient discretisation method
scientific article

    Statements

    The gradient discretisation method (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    29 June 2018
    0 references
    This monograph focuses on the Gradient Discretisation Method, which is introduced as a unified convergence analysis framework for numerical methods for elliptic and parabolic partial differential equations. Several examples of numerical methods are shown to fall into the range of the discrete gradient discretization methods: The GDM applies e.g. to both classical (conforming, non-conforming, mixed finite elements, discontinuous Galerkin) and modern (mimetic finite differences, hybrid and mixed finite volume) discretization methods. The convergence results are obtained by the GDM for both stationary and transient models. An error estimates are provided for linear equations, and several nonlinear equations are investigated as well. The convergence is established for a wide range of fully non-linear models as Leray-Lions equations and degenerate parabolic equations such as the Stefan or Richards model.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    gradient discretisation method
    0 references
    gradient schemes
    0 references
    elliptic partial differential equations
    0 references
    parabolic partial differential equations
    0 references
    unified convergence analysis
    0 references
    discrete Aubin-Simon compactness theorems
    0 references
    convergence by compactness
    0 references
    error estimates
    0 references
    0 references