Full recovery from point values: an optimal algorithm for Chebyshev approximability prior
From MaRDI portal
Publication:6171716
DOI10.1007/s10444-023-10063-xzbMath1525.41001arXiv2209.04985OpenAlexW4385220209MaRDI QIDQ6171716
Publication date: 14 August 2023
Published in: Advances in Computational Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2209.04985
Linear programming (90C05) Best approximation, Chebyshev systems (41A50) Interpolation in approximation theory (41A05) Approximation by polynomials (41A10)
Cites Work
- Unnamed Item
- Bounds for polynomials with a unit discrete norm
- A characterization of the Lagrange interpolating projection with minimal Tchebycheff norm
- Proof of the conjectures of Bernstein and Erdős concerning the optimal nodes for polynomial interpolation
- Instances of computational optimal recovery: refined approximability models
- Disconjugacy
- Computing a quantity of interest from observational data
- A sharp upper bound for sampling numbers in \(L_2\)
- Do Linear Problems Have Linear Optimal Algorithms?
- The Growth of Polynomials Bounded at Equally Spaced Points
- Basc: constrained approximation by semidefinite programming
- Exactness of Quadrature Formulas
- Optimal sampling rates for approximating analytic functions from pointwise samples
- Mathematical Pictures at a Data Science Exhibition
This page was built for publication: Full recovery from point values: an optimal algorithm for Chebyshev approximability prior