pith. sign in

arxiv: 1002.0887 · v1 · pith:RPKV6P2Nnew · submitted 2010-02-04 · 🧮 math.NA · cs.NA

Convergence and Optimal Complexity of Adaptive Finite Element Methods

classification 🧮 math.NA cs.NA
keywords adaptiveelementfiniteproblemcomplexityconvergencemethodselliptic
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.