Skip to content
DraconiticResearch
Search Sources API
190,851 studies31 sourcesUpdated 5 min ago
PreprintCC BY 4.0HAL

On p-robust convergence and optimality of adaptive FEM driven by equilibrated-flux estimators

Abstract

Building on existing hp-adaptive algorithms driven by equilibrated-flux estimators from [ESAIM Math. Model. Numer. Anal. 57 (2023), 329--366] and the references therein, we propose a novel h-adaptive algorithm for a fixed polynomial degree p. We consider a conforming finite element discretization of the Poisson equation in two or three space dimensions. Supposing piecewise polynomial right-hand side of degree p−1, we show that the algorithm yields error contraction at each step, with a contraction factor that is independent of p provided that a certain {\sl a posteriori} verifiable criterion is satisfied. We further show that this algorithm converges at optimal algebraic rate s if the D\"orfler marking parameter is chosen below some specified p-independent upper threshold. The constants involved here are p-robust, although they may depend on the rate s. The theoretical results are supported by numerical experiments, in which the {\sl a posteriori} criterion is always satisfied for one or a few local mesh refinement steps by newest-vertex bisection.

Related

  1. Uniform Strong Convergence of Kernel-Type Estimators for m-LENQD Sequences with Applications
    Panpan Ba, Zhicheng Feng, Jianhua Shia +1
    arXivPreprintarXiv licenceFull textStatisticsarXiv
  2. Differentially Private Distributed Optimization via the Intrinsic Randomness of Zeroth-Order Estimators: Sampling Geometry, Convergence, and Privacy Guarantees
    Jiajun Wang, Yujie Tang
    arXivPreprintarXiv licenceFull textOptimisation & controlarXiv
  3. Locally computable error estimators for conforming approximations of interface problems cannot be robust
    Yuwen Li
    arXivPreprintarXiv licenceFull textNumerical analysis & scientific computingarXiv
  4. qx-Bass Martingales: Optimality, Existence and Convergence
    Antonio Marini
    arXivPreprintarXiv licenceFull textProbabilityarXiv
  5. Harmonizable Multifractional Stable Motion: estimators for the Hurst function and the stability parameter from discrete-time observations, their rates of convergence and the associated central limit theorems
    Antoine Ayache, Christophe Louckx
    HALPreprintCC BY-NC-ND 4.0Full textGeneral mathematicsHAL
BibTeX
@misc{chaumontfrelet2026probust,
  title = {{On $p$-robust convergence and optimality of adaptive FEM driven by equilibrated-flux estimators}},
  author = {Théophile Chaumont-Frelet and Zhaonan Dong and Gregor Gantner and Martin Vohralík},
  howpublished = {HAL},
  year = {2026},
  month = sep,
  url = {https://inria.hal.science/hal-05544956v2},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - On p-robust convergence and optimality of adaptive FEM driven by equilibrated-flux estimators
AU  - Théophile Chaumont-Frelet
AU  - Zhaonan Dong
AU  - Gregor Gantner
AU  - Martin Vohralík
PY  - 2026
DA  - 2026/09/10
PB  - HAL
UR  - https://inria.hal.science/hal-05544956v2
AB  - Building on existing hp-adaptive algorithms driven by equilibrated-flux estimators from [ESAIM Math. Model. Numer. Anal. 57 (2023), 329--366] and the references therein, we propose a novel h-adaptive algorithm for a fixed polynomial degree p. We consider a conforming finite element discretization of the Poisson equation in two or three space dimensions. Supposing piecewise polynomial right-hand side of degree p−1, we show that the algorithm yields error contraction at each step, with a contraction factor that is independent of p provided that a certain {\sl a posteriori} verifiable criterion is satisfied. We further show that this algorithm converges at optimal algebraic rate s if the D\"orfler marking parameter is chosen below some specified p-independent upper threshold. The constants involved here are p-robust, although they may depend on the rate s. The theoretical results are supported by numerical experiments, in which the {\sl a posteriori} criterion is always satisfied for one or a few local mesh refinement steps by newest-vertex bisection.
ER  -