Deterministic sampling of sparse trigonometric polynomials
From MaRDI portal
Publication:2431334
DOI10.1016/j.jco.2011.01.007zbMath1216.65012arXiv1006.2221OpenAlexW2963868272MaRDI QIDQ2431334
Publication date: 13 April 2011
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1006.2221
Numerical methods for trigonometric approximation and interpolation (65T40) Complexity and performance of numerical algorithms (65Y20) Sampling theory in information and communication theory (94A20) Trigonometric polynomials, inequalities, extremal problems (42A05)
Related Items
Signal recovery under cumulative coherence, The Recovery Guarantee for Orthogonal Matching Pursuit Method to Reconstruct Sparse Polynomials, Stochastic Collocation vial1-Minimisation on Low Discrepancy Point Sets with Application to Uncertainty Quantification, Robust recovery of signals with partially known support information using weighted BPDN, A Gradient-Enhanced L1 Approach for the Recovery of Sparse Trigonometric Polynomials
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Explicit constructions of RIP matrices and related problems
- Random sampling of sparse trigonometric polynomials
- Combinatorial sublinear-time Fourier algorithms
- Chirp sensing codes: Deterministic compressed sensing measurements for fast recovery
- Random sampling of sparse trigonometric polynomials. II: Orthogonal matching pursuit versus basis pursuit
- Gabor analysis and algorithms. Theory and applications
- Grassmannian frames with applications to coding and communication
- Deterministic constructions of compressed sensing matrices
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Bounds on crosscorrelation and autocorrelation of sequences (Corresp.)
- Lower bounds on the maximum cross correlation of signals (Corresp.)
- On Some Exponential Sums
