Deterministic Sparse Fourier Approximation Via Approximating Arithmetic Progressions

DOI10.1109/TIT.2013.2290027MaRDI QIDQ2986494zbMATH OpenFDO

Authors Adi Akavia

Publication date 16 May 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Mathematics Subject Classification ID

Application of orthogonal and other special functions (94A11)

Cited in

(12)

• A multiscale sub-linear time Fourier algorithm for noisy data
• Sparse fast DCT for vectors with one-block support
• Nonlinear approximation in bounded orthonormal product bases
• Explicit small sets with \(\varepsilon\)-discrepancy on Bohr sets
• Deterministic sparse FFT for M-sparse vectors
• Improved sparse Fourier approximation results: Faster implementations and stronger guarantees
• Deterministic sparse sublinear FFT with improved numerical stability
• Deterministic sparse Fourier transform with an _ guarantee
• Real sparse fast DCT for vectors with short support
• A deterministic sparse FFT algorithm for vectors with small support
• A sparse fast Fourier algorithm for real non-negative vectors
• Coset decision trees and the Fourier algebra

This page was built for publication: Deterministic Sparse Fourier Approximation Via Approximating Arithmetic Progressions

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