Justification of the saturation assumption
The saturation assumption is widely used in computational science and engineering, usually without any rigorous theoretical justification and even despite of counterexamples for some coarse meshes known in the mathematical literature. On the other hand, there is overwhelming numerical evidence at le...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article (Journal) |
| Language: | English |
| Published: |
2016
|
| In: |
Numerische Mathematik
Year: 2015, Volume: 134, Issue: 1, Pages: 1-25 |
| ISSN: | 0945-3245 |
| DOI: | 10.1007/s00211-015-0769-7 |
| Online Access: | Verlag, lizenzpflichtig, Volltext: https://doi.org/10.1007/s00211-015-0769-7
|
| Author Notes: | C. Carstensen, D. Gallistl and J. Gedicke |
| Summary: | The saturation assumption is widely used in computational science and engineering, usually without any rigorous theoretical justification and even despite of counterexamples for some coarse meshes known in the mathematical literature. On the other hand, there is overwhelming numerical evidence at least in an asymptotic regime for the validity of the saturation. In particular, the strong saturation assumption holds for all triangulations with more than one degree of freedom. The weak saturation test (WS) is only required for zero or one degree of freedom and gives a definite outcome with O(1) operations. The only counterexamples known so far are regular n-polygons. The paper also discusses a generalization to linear elliptic second-order PDEs with small convection to prove that saturation is somehow generic and fails only in very particular situations characterised by (WS). |
|---|---|
| Item Description: | Published 28 October 2015 Gesehen am 29.04.2020 |
| Physical Description: | Online Resource |
| ISSN: | 0945-3245 |
| DOI: | 10.1007/s00211-015-0769-7 |