Efficient and reliable hierarchical error estimates for an elliptic obstacle problem (Q624982): Difference between revisions

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.