6 citations · 6 across the 2 of their papers we have counts for
3 papers
math.NA2017
A Deterministic Sparse FFT for Functions with Structured Fourier Sparsity
Sina Bittens, Ruochuan Zhang, Mark A. Iwen
In this paper a deterministic sparse Fourier transform algorithm is presented which breaks the quadratic-in-sparsity runtime bottleneck for a large class of periodic functions exhi…
math.NA2011
On the Design of Deterministic Matrices for Fast Recovery of Fourier Compressible Functions
J. Bailey, M. A. Iwen, C. V. Spencer
We present a general class of compressed sensing matrices which are then demonstrated to have associated sublinear-time sparse approximation algorithms. We then develop methods for…
math.NA2010★ 6 cited
Improved Approximation Guarantees for Sublinear-Time Fourier Algorithms
M. A. Iwen
In this paper modified variants of the sparse Fourier transform algorithms from [14] are presented which improve on the approximation error bounds of the original algorithms. In ad…