Rate optimality of AFEM with maximum marking

For Poisson's equation, we prove optimal algebraic convergence rates for adaptive conforming finite element methods driven by standard maximum marking in arbitrary space dimension, for every marking parameter in $(0,1]$. Previously, instance optimality of a modified maximum marking was proved in [L. Diening, C. Kreuzer, and R. Stevenson, Instance optimality of the adaptive maximum strategy, Found. Comput. Math., 16 (2016), pp. 33--68]. The basic ingredients of our anlaysis consists of discrete reliability, discrete efficiency, overlay and closure estimates of local mesh refinement. The discrete efficiency requires a facet-interior node property of simplicial mesh refinement. The novel part of the optimality analysis is an elementary integral-sum argument that converts energy decrease into a cumulative cardinality bound of marked elements, yielding rate optimality without a contraction argument.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-02
DOI
https://doi.org/10.48550/arxiv.2611.03387
Primary Topic
Advanced Numerical Methods in Computational Mathematics
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

Rate optimality of AFEM with maximum marking

Yuwen Li
arXiv (Cornell University)
Advanced Numerical Methods in Computational Mathematics
preprint

Rate optimality of AFEM with maximum marking

Yuwen Li
preprint en

Abstract

For Poisson's equation, we prove optimal algebraic convergence rates for adaptive conforming finite element methods driven by standard maximum marking in arbitrary space dimension, for every marking parameter in $(0,1]$. Previously, instance optimality of a modified maximum marking was proved in [L. Diening, C. Kreuzer, and R. Stevenson, Instance optimality of the adaptive maximum strategy, Found. Comput. Math., 16 (2016), pp. 33--68]. The basic ingredients of our anlaysis consists of discrete reliability, discrete efficiency, overlay and closure estimates of local mesh refinement. The discrete efficiency requires a facet-interior node property of simplicial mesh refinement. The novel part of the optimality analysis is an elementary integral-sum argument that converts energy decrease into a cumulative cardinality bound of marked elements, yielding rate optimality without a contraction argument.

arXiv (Cornell University)
Advanced Numerical Methods in Computational Mathematics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon