×

A convergent adaptive finite element method with optimal complexity. (English) Zbl 1171.65073

Summary: In this paper, we introduce and analyze a simple adaptive finite element method for second order elliptic partial differential equations. The marking strategy depends on whether the data oscillation is sufficiently small compared to the error estimator in the current mesh. If the oscillation is small compared to the error estimator, we mark as many edges such that their contributions to the local estimator are at least a fixed proportion of the global error estimator (bulk criterion for the estimator). Otherwise, we reduce the oscillation by marking sufficiently many elements, such that the oscillations of the marked cells are at least a fixed proportion of the global oscillation (bulk criterion for the oscillation). This marking strategy guarantees a strict reduction of the error augmented by the oscillation term. Both convergence rates and optimal complexity of the adaptive finite element method are established, with an explicit expression of the constants in the estimates.

MSC:

65N12 Stability and convergence of numerical methods for boundary value problems involving PDEs
65N15 Error bounds for boundary value problems involving PDEs
65N30 Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs
65N50 Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs
35J25 Boundary value problems for second-order elliptic equations
65Y20 Complexity and performance of numerical algorithms
PDFBibTeX XMLCite
Full Text: EuDML EMIS