A quasi-interpolation operator yielding fully computable error bounds

We design a quasi-interpolation operator from the Sobolev space $ H_0^1(\omega) $ to its finite-dimensional finite element subspace formed by piecewise polynomials on a simplicial mesh with a computable approximation constant. The operator (1) is defined on the entire $ H_0^1(\omega) $, no additional regularity is needed; (2) allows for an arbitrary polynomial degree; (3) works in any space dimension; (4) is defined locally, in vertex patches of mesh elements; (5) yields estimates optimal in the mesh size h for both the H1 seminorm and the L2 norm error; (6) yields estimates that bound the error in each computational mesh element by the best-approximation error in the element and in its vertex neighbors; (7) gives a computable constant for both the H1 seminorm and the L2 norm error; (8) leads to the equivalence of global-best and local-best errors; (9) possesses the projection property. Its construction follows the so-called potential reconstruction from a posteriori error analysis. Numerical experiments illustrate that our quasi-interpolation operator systematically gives the correct convergence rates in both the H1 seminorm and the L2 norm and its certified overestimation factor is rather sharp and stable in all tested situations.

Publication Details

Journal
Springer Link (Chiba Institute of Technology)
Published
2026-01-30
DOI
https://doi.org/10.1051/m2an/2025091/pdf
Primary Topic
Advanced Numerical Methods in Computational Mathematics
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A quasi-interpolation operator yielding fully computable error bounds

Springer Link (Chiba Institute of Technology)
Advanced Numerical Methods in Computational Mathematics
article

A quasi-interpolation operator yielding fully computable error bounds

article en

Abstract

We design a quasi-interpolation operator from the Sobolev space $ H_0^1(\omega) $ to its finite-dimensional finite element subspace formed by piecewise polynomials on a simplicial mesh with a computable approximation constant. The operator (1) is defined on the entire $ H_0^1(\omega) $, no additional regularity is needed; (2) allows for an arbitrary polynomial degree; (3) works in any space dimension; (4) is defined locally, in vertex patches of mesh elements; (5) yields estimates optimal in the mesh size h for both the H1 seminorm and the L2 norm error; (6) yields estimates that bound the error in each computational mesh element by the best-approximation error in the element and in its vertex neighbors; (7) gives a computable constant for both the H1 seminorm and the L2 norm error; (8) leads to the equivalence of global-best and local-best errors; (9) possesses the projection property. Its construction follows the so-called potential reconstruction from a posteriori error analysis. Numerical experiments illustrate that our quasi-interpolation operator systematically gives the correct convergence rates in both the H1 seminorm and the L2 norm and its certified overestimation factor is rather sharp and stable in all tested situations.

Springer Link (Chiba Institute of Technology)
Reduced inequalities
Openalex Percentile: Top 99%
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.

A quasi-interpolation operator yielding fully computable error bounds · Springer Link (Chiba Institute of Technology) (2026) | TGRS Research Map | TGRS