scientific article; zbMATH DE number 5681265

zbMath1182.94026MaRDI QIDQ5190161

Holger Rauhut

Publication date: 12 March 2010

Full work available at URL: http://stsip.org/vol07/no2/vol07no2pp197-215.html

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

trigonometric polynomialsthresholdingrandom samplinggreedy algorithmssparse recoverycompressed sensingorthogonal matching pursuit

Mathematics Subject Classification ID

Sampling theory in information and communication theory (94A20) Trigonometric polynomials, inequalities, extremal problems (42A05)

Related Items

Two Algorithms for Compressed Sensing of Sparse Tensors, Sparse high-dimensional FFT based on rank-1 lattice sampling, Sparse Legendre expansions via \(\ell_1\)-minimization, Deterministic sampling of sparse trigonometric polynomials, Sparse polynomial interpolation in Chebyshev bases, CoSaMP: Iterative signal recovery from incomplete and inaccurate samples, Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit, Stability and Robustness of Weak Orthogonal Matching Pursuits