Sampling recovery in 𝐿₂ and other norms
Mathematics of Computation · 06.10.2025 · 96 (363) · 223-253
DOI: 10.1090/mcom/4148 ↗Kurz gefasst
Fachartikel in der Zeitschrift Mathematics of Computation, online erschienen am 06.10.2025. Verfasst von David Krieg und 3 weiteren Autor:innen. Die Arbeit wurde bisher 5-mal zitiert (Crossref) und nennt 65 Literaturangaben. Gefördert von: Austrian Science Fund, Österreichische Forschungsförderungsgesellschaft.
Abstract (Originalsprache)
We study the recovery of functions in various norms, including L p L_p with 1 ≤ p ≤ ∞ 1\le p\le \infty , based on function evaluations. We obtain worst case error bounds for general classes of functions in terms of the best L 2 L_2 -approximation from a given nested sequence of subspaces and the Christoffel function of these subspaces. In the case p = ∞ p=\infty , our results imply that linear sampling algorithms are optimal up to a constant factor for many reproducing kernel Hilbert spaces.
Förderung
- Austrian Science Fund
- Österreichische Forschungsförderungsgesellschaft
Zitieren
APA
Krieg, D., Pozharska, K., Ullrich, M., & Ullrich, T. (2025). Sampling recovery in 𝐿₂ and other norms. Mathematics of Computation, 96(363), 223-253. https://doi.org/10.1090/mcom/4148
Vancouver
Krieg D, Pozharska K, Ullrich M, Ullrich T. Sampling recovery in 𝐿₂ and other norms. Mathematics of Computation. 2025;96(363):223-253. doi:10.1090/mcom/4148
BibTeX
@article{Krieg2025,
author = {Krieg, David and Pozharska, Kateryna and Ullrich, Mario and Ullrich, Tino},
title = {Sampling recovery in 𝐿₂ and other norms},
journal = {Mathematics of Computation},
year = {2025},
volume = {96},
number = {363},
pages = {223--253},
doi = {10.1090/mcom/4148}
}
EUVIMED