Error Localization of Best $L_{1}$ Polynomial Approximants
From MaRDI portal
Publication:5151924
DOI10.1137/19M1242860zbMath1461.65018arXiv1902.02664OpenAlexW3126900556MaRDI QIDQ5151924
Yuji Nakatsukasa, Alex Townsend
Publication date: 23 February 2021
Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1902.02664
Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Eigenvalues, singular values, and eigenvectors (15A18) Algorithms for approximation of functions (65D15) Matrix pencils (15A22)
Related Items
Existence, uniqueness, and stability of best and near-best approximations ⋮ Extended best \(L^p\)-approximation is near-best approximation in \(L^q, p - 1 \leq q < p\)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A mathematical introduction to compressive sensing
- Über die genaue Berechnung von besten \(L^1\)-Approximierenden
- Best \(L^ 1\)-approximation by polynomials. II
- A remark on best \(L^ 1\)-approximation by polynomials
- On the Bernstein conjecture in approximation theory
- \(L^{1}\)-approximation and finding solutions with small support
- Sharp RIP bound for sparse signal and low-rank matrix recovery
- Correcting for unknown errors in sparse high-dimensional function approximation
- Correcting Data Corruption Errors for Multivariate Function Approximation
- Piecewise-smooth chebfuns
- Near-best Lp Approximations by Real and Complex Chebyshev Series
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Decoding by Linear Programming
- Probing the Pareto Frontier for Basis Pursuit Solutions
- An Algorithm for Linear L1 Approximation of Continuous Functions
- An Extension of MATLAB to Continuous Functions and Operators
- Computing Zeros on a Real Interval through Chebyshev Expansion and Polynomial Rootfinding
- Approximation of high-dimensional parametric PDEs
- Dense Error Correction Via $\ell^1$-Minimization
- Stable signal recovery from incomplete and inaccurate measurements
- Implementing Clenshaw-Curtis quadrature, I methodology and experience
- Compressed sensing
