Sparse sampling recovery in integral norms on some function classes
- Authors: Temlyakov V.N.1,2,3,4
-
Affiliations:
- Steklov Mathematical Institute of Russian Academy of Sciences
- Lomonosov Moscow State University
- Moscow Center for Fundamental and Applied Mathematics
- University of South Carolina
- Issue: Vol 215, No 10 (2024)
- Pages: 146-166
- Section: Articles
- URL: https://journal-vniispk.ru/0368-8666/article/view/265606
- DOI: https://doi.org/10.4213/sm10086
- ID: 265606
Cite item
Abstract
About the authors
Vladimir Nikolaevich Temlyakov
Steklov Mathematical Institute of Russian Academy of Sciences; Lomonosov Moscow State University; Moscow Center for Fundamental and Applied Mathematics; University of South Carolina
Email: temlyak@math.sc.edu
Doctor of physico-mathematical sciences, Professor
References
- J. Bourgain, “An improved estimate in the restricted isometry problem”, Geometric aspects of functional analysis, Lecture Notes in Math., 2116, Springer, Cham, 2014, 65–70
- Ф. Дай, А. Примак, В. Н. Темляков, С. Ю. Тихонов, “Дискретизация интегральной нормы и близкие задачи”, УМН, 74:4(448) (2019), 3–58
- F. Dai, V. Temlyakov, “Universal sampling discretization”, Constr. Approx., 58:3 (2023), 589–613
- F. Dai, V. Temlyakov, “Random points are good for universal discretization”, J. Math. Anal. Appl., 529:1 (2024), 127570, 28 pp.
- F. Dai, V. Temlyakov, Lebesgue-type inequalities in sparse sampling recovery
- R. A. DeVore, V. N. Temlyakov, “Some remarks on greedy algorithms”, Adv. Comput. Math., 5:2-3 (1996), 173–187
- Dinh Dũng, V. Temlyakov, T. Ullrich, Hyperbolic cross approximation, Adv. Courses Math. CRM Barcelona, Birkhäuser/Springer, Cham, 2018, xi+218 pp.
- I. Haviv, O. Regev, “The restricted isometry property of subsampled Fourier matrices”, Geometric aspects of functional analysis, Lecture Notes in Math., 2169, Springer, Cham, 2017, 163–179
- T. Jahn, T. Ullrich, F. Voigtlaender, Sampling numbers of smoothness classes via $ell^1$-minimization
- B. Kashin, E. Kosov, I. Limonova, V. Temlyakov, “Sampling discretization and related problems”, J. Complexity, 71 (2022), 101653, 55 pp.
- E. D. Livshitz, V. N. Temlyakov, “Sparse approximation and recovery by greedy algorithms”, IEEE Trans. Inform. Theory, 60:7 (2014), 3989–4000
- G. Pisier, “Remarques sur un resultat non publie de B. Maurey”, Seminaire d'analyse fonctionalle, Exp. No. V, v. 1980–1981, Ecole Polytechnique, Centre de Mathematiques, Palaiseau, 1981, 12 pp.
- С. Б. Стечкин, “Об абсолютной сходимости ортогональных рядов”, Докл. АН СССР, 102 (1955), 37–40
- V. N. Temlyakov, “On approximate recovery of functions with bounded mixed derivative”, J. Complexity, 9:1 (1993), 41–59
- V. Temlyakov, Greedy approximation, Cambridge Monogr. Appl. Comput. Math., 20, Cambridge Univ. Press, Cambridge, 2011, xiv+418 pp.
- В. Н. Темляков, “Конструктивные разреженные тригонометрические приближения и другие задачи для функций смешанной гладкости”, Матем. сб., 206:11 (2015), 131–160
- V. Temlyakov, Multivariate approximation, Cambridge Monogr. Appl. Comput. Math., 32, Cambridge Univ. Press, Cambridge, 2018, xvi+534 pp.
- V. Temlyakov, Sparse sampling recovery by greedy algorithms
- J. F. Traub, G. W. Wasilkowski, H. Wozniakowski, Information-based complexity, Comput. Sci. Sci. Comput., Academic Press, Inc., Boston, MA, 1988, xiv+523 pp.
Supplementary files
