Efficient and reliable hierarchical error estimates for an elliptic obstacle problem (Q624982): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.apnum.2010.10.010 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2077272871 / rank | |||
Normal rank |
Revision as of 00:16, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Efficient and reliable hierarchical error estimates for an elliptic obstacle problem |
scientific article |
Statements
Efficient and reliable hierarchical error estimates for an elliptic obstacle problem (English)
0 references
11 February 2011
0 references
The author presents and analyzes novel hierarchical a posteriori error estimates for a self-adjoint elliptic obstacle problem. Efficiency and reliability of hierarchical estimates are proved under a suitable saturation assumption. The proof is based on some new observations on the efficiency of some hierarchical error estimates. Numerical computations confirm the theoretical findings. The paper contains a large amount of results launching a broad coverage of the subject matter. The results of the paper are very interesting.
0 references
hierarchical error estimates
0 references
variational inequalities
0 references
numerical examples
0 references
a posteriori error estimates
0 references
self-adjoint elliptic obstacle problem
0 references