Sparse sampling recovery by greedy algorithms
IMA Journal of Numerical Analysis · 29.07.2026 · 46 (4) · 2107-2138
DOI: 10.1093/imanum/draf054 ↗Kurz gefasst
Fachartikel in der Zeitschrift IMA Journal of Numerical Analysis, online erschienen am 20.07.2025. Verfasst von V Temlyakov. Die Arbeit wurde bisher 7-mal zitiert (Crossref) und nennt 52 Literaturangaben. Gefördert von: Russian Science Foundation.
Abstract (Originalsprache)
In this paper we analyse approximation and recovery properties with respect to systems satisfying universal sampling discretization property and a special incoherence property. We apply a powerful nonlinear approximation method—the Weak Chebyshev Greedy Algorithm (WCGA). We establish that the WCGA based on good points for the $L_{p}$-universal discretization provides good recovery in the $L_{p}$ norm. For our recovery algorithms we obtain both the Lebesgue-type inequalities for individual functions and the error bounds for special classes of multivariate functions. The main point of the paper is that we combine here two deep and powerful techniques—Lebesgue-type inequalities for the WCGA and theory of the universal sampling dicretization—in order to obtain new results in sampling recovery.
Förderung
- Russian Science Foundation
Zitieren
APA
Temlyakov, V. (2026). Sparse sampling recovery by greedy algorithms. IMA Journal of Numerical Analysis, 46(4), 2107-2138. https://doi.org/10.1093/imanum/draf054
Vancouver
Temlyakov V. Sparse sampling recovery by greedy algorithms. IMA Journal of Numerical Analysis. 2026;46(4):2107-2138. doi:10.1093/imanum/draf054
BibTeX
@article{Temlyakov2026,
author = {Temlyakov, V},
title = {Sparse sampling recovery by greedy algorithms},
journal = {IMA Journal of Numerical Analysis},
year = {2026},
volume = {46},
number = {4},
pages = {2107--2138},
doi = {10.1093/imanum/draf054}
}
EUVIMED