Convergence of simple adaptive Galerkin schemes based on h - h/2 error estimators

31Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We discuss several adaptive mesh-refinement strategies based on (h - h/2)-error estimation. This class of adaptive methods is particularly popular in practise since it is problem independent and requires virtually no implementational overhead. We prove that, under the saturation assumption, these adaptive algorithms are convergent. Our framework applies not only to finite element methods, but also yields a first convergence proof for adaptive boundary element schemes. For a finite element model problem, we extend the proposed adaptive scheme and prove convergence even if the saturation assumption fails to hold in general. © The Author(s) 2010.

Cite

CITATION STYLE

APA

Ferraz-Leite, S., Ortner, C., & Praetorius, D. (2010). Convergence of simple adaptive Galerkin schemes based on h - h/2 error estimators. Numerische Mathematik, 116(2), 291–316. https://doi.org/10.1007/s00211-010-0292-9

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