On the convergence of generalized kernel-based interpolation by greedy data selection algorithms
BIT Numerical Mathematics · 2025-03 · 65 (1)
DOI: 10.1007/s10543-024-01048-3 ↗Kurz gefasst
Fachartikel in der Zeitschrift BIT Numerical Mathematics, online erschienen am 27.12.2024. Verfasst von Kristof Albrecht und 1 weiteren Autor:innen. Die Arbeit wurde bisher 7-mal zitiert (Crossref) und nennt 26 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Universität Hamburg.
Abstract (Originalsprache)
We analyze the convergence of generalized kernel-based interpolation methods. This is done under minimalistic assumptions on both the kernel and the target function. On these grounds, we further prove convergence of popular greedy data selection algorithms for totally bounded sets of sampling functionals. Supporting numerical results concerning computerized tomography are provided for illustration.
Förderung
- Universität Hamburg
Zitieren
APA
Albrecht, K., & Iske, A. (2025). On the convergence of generalized kernel-based interpolation by greedy data selection algorithms. BIT Numerical Mathematics, 65(1). https://doi.org/10.1007/s10543-024-01048-3
Vancouver
Albrecht K, Iske A. On the convergence of generalized kernel-based interpolation by greedy data selection algorithms. BIT Numerical Mathematics. 2025;65(1). doi:10.1007/s10543-024-01048-3
BibTeX
@article{Albrecht2025,
author = {Albrecht, Kristof and Iske, Armin},
title = {On the convergence of generalized kernel-based interpolation by greedy data selection algorithms},
journal = {BIT Numerical Mathematics},
year = {2025},
volume = {65},
number = {1},
doi = {10.1007/s10543-024-01048-3}
}
EUVIMED