Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-12T18:45:22.883Z Has data issue: false hasContentIssue false

Convergence and quasi-optimal complexityof a simple adaptive finite element method

Published online by Cambridge University Press:  21 August 2009

Roland Becker
Affiliation:
Laboratoire de Mathématiques Appliquées and INRIA Bordeaux Sud-Ouest Concha, Université de Pau, 64013 Pau Cedex, France. roland.becker@univ-pau.fr; beckerroland@me.com
Shipeng Mao
Affiliation:
Institute of Computational Mathematics and INRIA Bordeaux Sud-Ouest Concha, Chinese Academy of Sciences (CAS), Beijing, 100190, P. R. China. maosp@lsec.cc.ac.cn
Get access

Abstract

We prove convergence and quasi-optimal complexity of an adaptive finite element algorithm on triangular meshes with standard mesh refinement. Our algorithm is based on an adaptive marking strategy. In each iteration, a simple edge estimator is compared to an oscillation term and the marking of cells for refinement is done according to the dominant contribution only. In addition, we introduce an adaptive stopping criterion for iterative solution which compares an estimator for the iteration error with the estimator for the discretization error.

Information

Type
Research Article
Copyright
© EDP Sciences, SMAI, 2009

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable