The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
Accelerating the Nonuniform Fast Fourier Transform
Abstract
The nonequispaced Fourier transform arises in a variety of application areas, from medical imaging to radio astronomy to the numerical solution of partial differential equations. In a typical problem, one is given an irregular sampling of N data in the frequency domain and one is interested in reconstructing the corresponding function in the physical domain. When the sampling is uniform, the fast Fourier transform (FFT) allows this calculation to be computed in $O(N \log N)$ operations rather than $O(N^2)$ operations. Unfortunately, when the sampling is nonuniform, the FFT does not apply. Over the last few years, a number of algorithms have been developed to overcome this limitation and are often referred to as {\em nonuniform FFTs} (NUFFTs). These rely on a mixture of interpolation and the judicious use of the FFT on an oversampled grid [A. Dutt and V. Rokhlin, {\em SIAM J.\ Sci.\ Comput.}, 14 (1993), pp. 1368--1383].\\ \indent% In this paper, we observe that one of the standard interpolation or ``gridding" schemes, based on Gaussians, can be accelerated by a significant factor without precomputation and storage of the interpolation weights. This is of particular value in two- and three-dimensional settings, saving either $10^d N$ in storage in d dimensions or a factor of about 5--10 in CPU time (independent of dimension).
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Nonuniform fast fourier transforms using min-max interpolation
Fessler, J. A., & Sutton, B. P. (2003) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2002.807005 · Cited by 1,337
Jackson, J. I., Meyer, C. H., Nishimura, D. G., & Macovski, A. (1991) · IEEE Transactions on Medical Imaging · doi:10.1109/42.97598 · Cited by 1,059
Fast Fourier Transforms for Nonequispaced Data
Dutt, A., & Rokhlin, V. (1993) · SIAM Journal on Scientific Computing · doi:10.1137/0914081 · Cited by 918
A Fast Sinc Function Gridding Algorithm for Fourier Inversion in Computer Tomography
O'Sullivan, J. D. (1985) · IEEE Transactions on Medical Imaging · doi:10.1109/tmi.1985.4307723 · Cited by 482
On the Fast Fourier Transform of Functions with Singularities
Beylkin, G. (1995) · Applied and Computational Harmonic Analysis · doi:10.1006/acha.1995.1026 · Cited by 334
An accurate algorithm for nonuniform fast Fourier transforms (NUFFT's)
Liu, Q. H., & Nguyen, N. (1998) · IEEE Microwave and Guided Wave Letters · doi:10.1109/75.650975 · Cited by 261
The Regular Fourier Matrices and Nonuniform Fast Fourier Transforms
Nguyen, N., & Liu, Q. H. (1999) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827597325712 · Cited by 137
Fast Approximate Fourier Transforms for Irregularly Spaced Data
Ware, A. F. (1998) · SIAM Review · doi:10.1137/s003614459731533x · Cited by 113
Spectral Approximation of the Free-Space Heat Kernel
Greengard, L., & Lin, P. (2000) · Applied and Computational Harmonic Analysis · doi:10.1006/acha.2000.0310 · Cited by 76
Self-citationRapid Computation of the Discrete Fourier Transform
Anderson, C., & Dahleh, M. D. (1996) · SIAM Journal on Scientific Computing · doi:10.1137/0917059 · Cited by 61
Cited by
Computational multiheterodyne spectroscopy
Burghoff, D., Yang, Y., & Hu, Q. (2016) · Science Advances · doi:10.1126/sciadv.1601227 · Cited by 114
Juchem, C., Umesh Rudrapatna, S., Nixon, T. W., & de Graaf, R. A. (2015) · NeuroImage · doi:10.1016/j.neuroimage.2014.11.011 · Cited by 74
Metadata
- Authors
- Greengard, L., & Lee, J.-Y.
- Venue
- SIAM Review
- Published
- 2004-01
- Volume
- 46
- Issue
- 3
- Pages
- 443-454
- ISSN
- 0036-1445 (ISSN-L)
- 1095-7200
- OpenAlex
- W2012300893
- Cited by
- 727
- References
- 11
- FWCI
- 10.89
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Accelerating the Nonuniform Fast Fourier Transform. https://app.cochat.ai/papers/10.1137/s003614450343200x
- The paper
- Greengard, L., & Lee, J.-Y. (2004). Accelerating the Nonuniform Fast Fourier Transform. SIAM Review. https://doi.org/10.1137/s003614450343200x
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.