We present and analyze novel hierarchical a posteriori error estimates for a self-adjoint elliptic obstacle problem. Under a suitable saturation assumption, we prove the efficiency and reliability of our hierarchical estimates. The proof is based upon some new observations on the efficiency of some hierarchical error indicators. These new observations allow us to remove an additional regularity condition on the underlying grid required in the previous analysis. Numerical computations confirm our theoretical findings.
© 2001-2024 Fundación Dialnet · Todos los derechos reservados