3 citations · 5 across the 2 of their papers we have counts for
2 papers
math.NA2017★ 3 cited
A New Class of Fully Discrete Sparse Fourier Transforms: Faster Stable Implementations with Guarantees
Sami Merhi, Ruochuan Zhang, Mark A. Iwen +1
In this paper we consider Sparse Fourier Transform (SFT) algorithms for approximately computing the best -term approximation of the Discrete Fourier Transform (DFT) $\mathbf{\ha…
math.NA2017★ 2 cited
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…