Repository: Freie Universit├Ąt Berlin, Math Department

Efficient and reliable hierarchical error estimates for the discretization error of elliptic obstacle problems

Kornhuber, R. and Zou, Q. (2011) Efficient and reliable hierarchical error estimates for the discretization error of elliptic obstacle problems. Mathematics of Computation, 80 . pp. 69-88. ISSN 0025-5718

[img]
Preview
PDF
250kB

Official URL: http://dx.doi.org/10.1090/S0025-5718-2010-02394-4#...

Abstract

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 locality. Numerical computations confirm our theoretical findings.

Item Type:Article
Subjects:Mathematical and Computer Sciences > Mathematics > Numerical Analysis
Divisions:Department of Mathematics and Computer Science > Institute of Mathematics
ID Code:1798
Deposited By: Ekaterina Engel
Deposited On:18 Feb 2016 09:49
Last Modified:03 Mar 2017 14:41

Repository Staff Only: item control page