Metraipolis › archive › dc_18f80008a02e
Gradient discretisation method — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Gradient_discretisation_method
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-07T11:27:39.280Z
- SHA-256 of the archived text
32a0ebcc5e43f29ccff5550d11f87f6cc941379afc7e92768a546c5c8033e1fd- Stable URL of this page
https://metraipolis.com/documento/dc_18f80008a02e
How to cite
Gradient discretisation method — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Gradient_discretisation_method (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_18f80008a02e (Metraipolis archive dc_18f80008a02e, sha256 32a0ebcc5e43f29ccff5550d11f87f6cc941379afc7e92768a546c5c8033e1fd)
BibTeX
@misc{dc18f80008a02e,
title = {Gradient discretisation method — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Gradient_discretisation_method},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_18f80008a02e; sha256 32a0ebcc5e43f29ccff5550d11f87f6cc941379afc7e92768a546c5c8033e1fd},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Gradient_discretisation_method. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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 {\displaystyle C_{D}} , S D {\displaystyle S_{D}} and W D {\displaystyle 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
Tema degli esploratori: matematica e informatica teorica (deposito sistematico; categoria «Numerical analysis»).
Fonte: Wikipedia in inglese, voce «Gradient discretisation method» — https://en.wikipedia.org/wiki/Gradient_discretisation_method
Wikidata Q28404790 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q28404790
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Gradient_discretisation_method?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1375676268, consultata il 2026-10-07T11:16:51.772Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 57a73046de40d312af7bc3866cb54b9c34817a351a569e5ece9a6bf75d38dad2