NANAFeb 4, 2010

Convergence and Optimal Complexity of Adaptive Finite Element Methods

arXiv:1002.088711 citations

Analysis pending

In this paper, we study adaptive finite element approximations in a perturbation framework, which makes use of the existing adaptive finite element analysis of a linear symmetric elliptic problem. We prove the convergence and complexity of adaptive finite element methods for a class of elliptic partial differential equations. For illustration, we apply the general approach to obtain the convergence and complexity of adaptive finite element methods for a nonsymmetric problem, a nonlinear problem as well as an unbounded coefficient eigenvalue problem.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes