A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Efficient and reliable hierarchical error estimates for the discretization error of elliptic obstacle problems
2010
Mathematics of Computation
Preserved Fulltext
We present and analyze novel hierarchical a posteriori error estimates for self-adjoint elliptic obstacle problems. Our approach differs from straightforward, but nonreliable estimators by an additional extra term accounting for the deviation of the discrete free boundary in the localization step. We prove efficiency and reliability on a saturation assumption and a regularity condition on the underlying grid. Heuristic arguments suggest that the extra term is of higher order and preserves full
doi:10.1090/s0025-5718-2010-02394-4
fatcat:dld43klgnvcnzdt56p7etmv2ty