scientific article; zbMATH DE number 5764870

MaRDI QIDQ3579463zbMATH OpenFDO

Authors M. A. Iwen

Publication date 6 August 2010

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Numerical methods for discrete and fast Fourier transforms (65T50) Nontrigonometric harmonic analysis (42C99)

Cited in

(7)

• Combinatorial sublinear-time Fourier algorithms
• A sample efficient sparse FFT for arbitrary frequency candidate sets in high dimensions
• A note on compressed sensing and the complexity of matrix multiplication
• Sparse harmonic transforms. II: Best \(s\)-term approximation guarantees for bounded orthonormal product bases in sublinear-time
• Sparse harmonic transforms: a new class of sublinear-time algorithms for learning functions of many variables
• CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
• A new class of fully discrete sparse Fourier transforms: faster stable implementations with guarantees

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3579463)