Random points are good for universal discretization

DOI10.1016/j.jmaa.2023.127570zbMath1528.41024arXiv2301.12536MaRDI QIDQ6074492

Feng Dai, Vladimir N. Temlyakov

Publication date: 19 September 2023

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2301.12536

zbMATH Keywords

universalityrecoverysampling discretization

Mathematics Subject Classification ID

Asymptotic approximations, asymptotic expansions (steepest descent, etc.) (41A60) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Inequalities in approximation (Bernstein, Jackson, Nikol'ski?-type inequalities) (41A17)

Related Items

On universal sampling recovery in the uniform norm, Universal sampling discretization

Cites Work

• A mathematical introduction to compressive sensing
• An inequality for the entropy numbers and its application
• Diophantine approximation
• Approximation of zonoids by zonotopes
• Weak greedy algorithms
• Sampling discretization and related problems
• Greedy approximation with regard to non-greedy bases
• Constructive sparse trigonometric approximation and other problems for functions with mixed smoothness
• Sparse Approximation and Recovery by Greedy Algorithms
• Multivariate Approximation
• Optimal weighted least-squares methods
• Integral norm discretization and related problems
• An Improved Estimate in the Restricted Isometry Problem
• The Restricted Isometry Property of Subsampled Fourier Matrices
• Some improved bounds in sampling discretization of integral norms