Convergence and Optimal Complexity of Adaptive Finite Element Methods

From MaRDI portal




Abstract: 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.




Cited in
(32)


Describes a project that uses

Uses Software





This page was built for publication: Convergence and Optimal Complexity of Adaptive Finite Element Methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4913888)