Convergence of Adaptive Finite Element Methods

Abstract

Adaptive finite element methods (FEM) have been widely used in applications for over 20 years now. In practice, they converge starting from coarse grids, although no mathematical theory has been able to prove this assertion. Ensuring an error reduction rate based on a posteriori error estimators, together with a reduction rate of data oscillation (information missed by the underlying averaging process), we construct a simple and efficient adaptive FEM for elliptic partial differential equations. We prove that this algorithm converges with linear rate without any preliminary mesh adaptation nor explicit knowledge of constants. Any prescribed error tolerance is thus achieved in a finite number of steps. A number of numerical experiments in two and three dimensions yield quasi-optimal meshes along with a competitive performance. Extensions to higher order elements and applications to saddle point problems are discussed as well.

Keywords: A posteriori error estimators, data oscillation, adaptive mesh refinement, convergence, Stokes, Uzawa

AMS Subject Classifications: 65N12, 65N15, 65N30, 65N50, 65Y20


Published: SIAM Review, 44 (2002) 631--658.