Convergence and Quasi-Optimality of Adaptive FEM with Inhomogeneous Dirichlet Data

Abstract

We consider the solution of a second order elliptic PDE with inhomogeneous Dirichlet data by means of adaptive lowest-order FEM. As is usually done in practice, the given Dirichlet data are discretized by nodal interpolation. As model example serves the Poisson equation with mixed Dirichlet-Neumann boundary conditions. For error estimation, we use an edge-based residual error estimator which replaces the volume residual contributions by edge oscillations. For 2D, we prove convergence of the adaptive algorithm even with quasi-optimal convergence rate. For 2D and 3D, we show convergence if the nodal interpolation operator is replaced by the L^2-projection or the Scott-Zhang quasi-interpolation operator. As a byproduct of the proof, we show that the Scott-Zhang operator converges pointwise to a limiting operator as the mesh is locally refined. This property might be of independent interest besides the current application. Finally, numerical experiments conclude the work.

31 pages, 7 figures

Cited by in corpus (9)

• Axioms of Adaptivity
• Adaptive FEM with coarse initial mesh guarantees optimal convergence rates for compactly perturbed elliptic problems
• An abstract analysis of optimal goal-oriented adaptivity
• Adaptive Boundary Element Methods
• MooAFEM: An object oriented Matlab code for higher-order adaptive FEM for (nonlinear) elliptic PDEs
• Optimal operator preconditioning for pseudodifferential boundary problems
• On full linear convergence and optimal complexity of adaptive FEM with inexact solver
• On Some Quasi-Variational Inequalities and Other Problems with Moving Sets
• Smoother-type a posteriori error estimates for finite element methods