Lesson plan
Gradient discretisation method
[[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.…
Article summary
[[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.…
Key claims
No claims recorded.
Discussion questions
- Summarise the article in your own words. Which single claim would you verify first, and why?
- Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
- If two sources disagreed about one of these facts, what would you need in order to trust one over the other?
Bibliography
No sources recorded.
Key claims and bibliography are generated from the same tracked claims and sources as the article page.