Estimator reduction and convergence of adaptive BEM

25Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

A posteriori error estimation and related adaptive mesh-refining algorithms have themselves proven to be powerful tools in nowadays scientific computing. Contrary to adaptive finite element methods, convergence of adaptive boundary element schemes is, however, widely open. We propose a relaxed notion of convergence of adaptive boundary element schemes. Instead of asking for convergence of the error to zero, we only aim to prove estimator convergence in the sense that the adaptive algorithm drives the underlying error estimator to zero. We observe that certain error estimators satisfy an estimator reduction property which is sufficient for estimator convergence. The elementary analysis is only based on Dörfler marking and inverse estimates, but not on reliability and efficiency of the error estimator at hand. In particular, our approach gives a first mathematical justification for the proposed steering of anisotropic mesh-refinements, which is mandatory for optimal convergence behavior in 3D boundary element computations. © 2011 IMACS. Published by Elsevier B.V. All rights reserved.

Cite

CITATION STYLE

APA

Aurada, M., Ferraz-Leite, S., & Praetorius, D. (2012). Estimator reduction and convergence of adaptive BEM. Applied Numerical Mathematics, 62(6), 787–801. https://doi.org/10.1016/j.apnum.2011.06.014

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free