Quasi-monotonicity and Robust Localization with Continuous Piecewise Polynomials
Francesca Tantardini, R\"udiger Verf\"urth

TL;DR
This paper investigates the approximation errors in elliptic problems with discontinuous diffusion coefficients, establishing conditions for robust localization using continuous piecewise polynomials and highlighting limitations when quasi-monotonicity fails.
Contribution
It proves the equivalence of approximation errors under quasi-monotonicity and demonstrates the failure of robust localization without this property.
Findings
Best approximation error is equivalent to element-wise errors under quasi-monotonicity.
Counterexamples show localization fails without quasi-monotonicity.
Robust localization is limited to cases satisfying the quasi-monotonicity condition.
Abstract
We consider the energy norm arising from elliptic problems with discontinuous piecewise constant diffusion. We prove that under the quasi-monotonicity property on the diffusion coefficient, the best approximation error with continuous piecewise polynomials is equivalent to the -sum of best errors on elements, in the spirit of A. Veeser for the -seminorm. If the quasi-monotonicity is violated, counterexamples show that a robust localization does not hold in general, neither on elements, nor on pairs of adjacent elements, nor on stars of elements sharing a common vertex.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMatrix Theory and Algorithms · Advanced Optimization Algorithms Research · Optimization and Variational Analysis
