Small data oscillation implies the saturation assumption (Q1597696): Difference between revisions
From MaRDI portal
Set profile property. |
Normalize DOI. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s002110100321 / rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s002110100321 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2063899632 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S002110100321 / rank | |||
Normal rank | |||
Latest revision as of 22:16, 10 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Small data oscillation implies the saturation assumption |
scientific article |
Statements
Small data oscillation implies the saturation assumption (English)
0 references
30 May 2002
0 references
The saturation assumption asserts that the best approximation error in \(H_0^1\) with piecewise quadratic finite elements is strictly smaller than that of piecewise linear finite elements. The main result in this paper states that the saturation assumption holds provided the data oscillation is controlled by the approximation error with linear finite elements. The technique used by the authors comes from a posteriori error analysis.
0 references
small data oscillation
0 references
saturation assumption
0 references
piecewise quadratic finite elements
0 references
a posteriori error analysis
0 references
