Skip to content
DraconiticResearch
Search Sources API
179,152 studies31 sourcesUpdated 11 min ago
PreprintarXiv licencearXiv

Rate optimality of AFEM with maximum marking

  • Yuwen Li
Open at sourcePDFDOICite

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.

Related

  1. On the minimax-rate optimality of approximate Bayesian computation in nonparametric problems
    Hien Duy Nguyen
    arXivPreprintCC BY 4.0Full textStatisticsarXiv
  2. Optimal AFEM convergence for any bulk parameter smaller than one
    Lars Diening, Johannes Storn
    arXivPreprintarXiv licenceFull textNumerical analysis & scientific computingarXiv
  3. Marking-based load balancing Weighted Clustering Framework for Mobile ADHOC Network
    Prashant Dixit, Sonia Setia, Ramesh Chandra Sahoo +2
    PLOS OnePeer-reviewedCC BY 4.0Full textStatisticsPhysiologyPLOS
  4. Optimality of finite field dimension expanders
    Urban Jezernik, Markus Reineke
    arXivPreprintCC BY 4.0Full textAlgebra & number theoryProbabilityarXiv
  5. Pareto optimality under nondegeneracy at infinity
    Liguo Jiao, Jae Hyoung Lee, Tien-Son Pham
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv

Cite

BibTeXRIS
BibTeX
@misc{li2026rate,
  title = {{Rate optimality of AFEM with maximum marking}},
  author = {Yuwen Li},
  howpublished = {arXiv},
  year = {2026},
  month = nov,
  doi = {10.48550/arxiv.2611.03387},
  eprint = {2611.03387},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2611.03387},
}
RIS
TY  - UNPB
TI  - Rate optimality of AFEM with maximum marking
AU  - Yuwen Li
PY  - 2026
DA  - 2026/11/02
PB  - arXiv
DO  - 10.48550/arxiv.2611.03387
UR  - https://arxiv.org/abs/2611.03387
AB  - 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.
ER  -