Non-uniform spline recovery from small degree polynomial approximation
From MaRDI portal
Publication:2352871
DOI10.1016/j.jmaa.2015.05.034zbMath1357.94031arXiv1402.5662OpenAlexW1710463105MaRDI QIDQ2352871
Yohann de Castro, Guillaume Mijoule
Publication date: 6 July 2015
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1402.5662
Numerical computation using splines (65D07) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Spline approximation (41A15)
Related Items
Robust recovery of stream of pulses using convex optimization ⋮ Adapting to unknown noise level in sparse deconvolution ⋮ Super-resolution of point sources via convex programming
Cites Work
- Unnamed Item
- Exact reconstruction using Beurling minimal extrapolation
- Super-resolution from noisy data
- Exact support recovery for sparse spikes deconvolution
- A general expression for the distribution of the maximum of a Gaussian field and the approximation of the tail
- Exact recovery of non-uniform splines from the projection onto spaces of algebraic polynomials
- Spike detection from inaccurate samplings
- Superresolution via Sparsity Constraints
- Chebyshev Polynomials and Markov-Bernstein Type Inequalities for Rational Spaces
- Convergence rates of convex variational regularization
- Inverse problems in spaces of measures
- Towards a Mathematical Theory of Super‐resolution
- Positive trigonometric polynomials and signal processing applications