Deterministic Sparse Fourier Approximation Via Approximating Arithmetic Progressions
From MaRDI portal
Publication:2986494
DOI10.1109/TIT.2013.2290027zbMath1360.94051MaRDI QIDQ2986494
Publication date: 16 May 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Related Items (11)
A deterministic sparse FFT algorithm for vectors with small support ⋮ Improved sparse Fourier approximation results: Faster implementations and stronger guarantees ⋮ Nonlinear approximation in bounded orthonormal product bases ⋮ Deterministic sparse FFT for \(M\)-sparse vectors ⋮ Explicit small sets with \(\varepsilon\)-discrepancy on Bohr sets ⋮ Sparse fast DCT for vectors with one-block support ⋮ Deterministic sparse sublinear FFT with improved numerical stability ⋮ Coset decision trees and the Fourier algebra ⋮ Real sparse fast DCT for vectors with short support ⋮ A multiscale sub-linear time Fourier algorithm for noisy data ⋮ A sparse fast Fourier algorithm for real non-negative vectors
This page was built for publication: Deterministic Sparse Fourier Approximation Via Approximating Arithmetic Progressions
