A simple equilibration procedure leading to polynomial-degree-robust a posteriori error estimators for the curl-curl problem

From MaRDI portal
Publication:6133433

DOI10.1090/MCOM/3817zbMATH Open1522.65202arXiv2108.07552OpenAlexW3193331928MaRDI QIDQ6133433FDOQ6133433

T. Chaumont-Frelet

Publication date: 18 August 2023

Published in: Mathematics of Computation (Search for Journal in Brave)

Abstract: We introduce two a posteriori error estimators for N'ed'elec finite element discretizations of the curl-curl problem. These estimators pertain to a new Prager-Synge identity and an associated equilibration procedure. They are reliable and efficient, and the error estimates are polynomial-degree-robust. In addition, when the domain is convex, the reliability constants are fully computable. The proposed error estimators are also cheap and easy to implement, as they are computed by solving divergence-constrained minimization problems over edge patches. Numerical examples highlight our key findings, and show that both estimators are suited to drive adaptive refinement algorithms. Besides, these examples seem to indicate that guaranteed upper bounds can be achieved even in non-convex domains.


Full work available at URL: https://arxiv.org/abs/2108.07552





Cites Work


Cited In (2)


   Recommendations





This page was built for publication: A simple equilibration procedure leading to polynomial-degree-robust a posteriori error estimators for the curl-curl problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6133433)