A Note on the Quasi-Best Approximation Constant

Abstract The solution operator in a Petrov Galerkin scheme in Hilbert spaces is an oblique projection with quasi-best approximation property. The latter estimate involves a multiplicative constant and the best-possible of those is the target of the note: We present a new direct proof of the formula of the quasi-best approximation constant and avoid the direct application of the Kato lemma. In fact, our characterisation leads to another proof of the Kato oblique projection lemma. The abstract result in Hilbert spaces is embedded in the setting of the best-approximation of conforming Petrov Galerkin schemes with a rich history that eventually led to the Tantardini–Veeser formula. A final application discusses the classical nonconforming schemes with a smoother in this framework.

Authors

Institutions

Publication Details

Journal
Computational Methods in Applied Mathematics
Published
2025-05-29
DOI
https://doi.org/10.1515/cmam-2025-0025
Citations
2
Primary Topic
Advanced Numerical Methods in Computational Mathematics
Type
article
Field-Weighted Citation Impact
2.67
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Note on the Quasi-Best Approximation Constant

Carsten Carstensen
2 citations
Computational Methods in Applied Mathematics
Advanced Numerical Methods in Computational Mathematics
2.67
article

A Note on the Quasi-Best Approximation Constant

Carsten Carstensen
article en
2 citations

Abstract

Abstract The solution operator in a Petrov Galerkin scheme in Hilbert spaces is an oblique projection with quasi-best approximation property. The latter estimate involves a multiplicative constant and the best-possible of those is the target of the note: We present a new direct proof of the formula of the quasi-best approximation constant and avoid the direct application of the Kato lemma. In fact, our characterisation leads to another proof of the Kato oblique projection lemma. The abstract result in Hilbert spaces is embedded in the setting of the best-approximation of conforming Petrov Galerkin schemes with a rich history that eventually led to the Tantardini–Veeser formula. A final application discusses the classical nonconforming schemes with a smoother in this framework.

Computational Methods in Applied MathematicsVol. 25(3)
Humboldt-Universität zu Berlin (DE)
Openalex Percentile: Top 12%
Advanced Numerical Methods in Computational Mathematics
2.67
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.