Efficient and reliable hierarchical error estimates for an elliptic obstacle problem (Q624982)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5850235
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient and reliable hierarchical error estimates for an elliptic obstacle problem |
scientific article; zbMATH DE number 5850235 |
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
0 references
0 references
0.953514039516449
0 references
0.9061456918716432
0 references
0.9007296562194824
0 references
0.8907967805862427
0 references
0.8808107376098633
0 references
