The DOI matches its Crossref record; 34 of the 34 references it cites were found in a registry or an index.
Using NFFT 3---A Software Library for Various Nonequispaced Fast Fourier Transforms
Abstract
NFFT 3 is a software library that implements the nonequispaced fast Fourier transform (NFFT) and a number of related algorithms, for example, nonequispaced fast Fourier transforms on the sphere and iterative schemes for inversion. This article provides a survey on the mathematical concepts behind the NFFT and its variants, as well as a general guideline for using the library. Numerical examples for a number of applications are given.
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
Handbook of Mathematical Functions
McQuarrie, D. A. (1966) · American Journal of Physics · doi:10.1119/1.1972842 · Cited by 40,433
An algorithm for the machine calculation of complex Fourier series
Cooley, J. W., & Tukey, J. W. (1965) · Mathematics of Computation · doi:10.1090/s0025-5718-1965-0178586-1 · Cited by 13,154
The Design and Implementation of FFTW3
Frigo, M., & Johnson, S. G. (2005) · Proceedings of the IEEE · doi:10.1109/jproc.2004.840301 · Cited by 5,086
Numerical Methods for Least Squares Problems
Björck, Å. (1996) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611971484 · Cited by 3,257
Numerical methods for least squares problems
(1996) · Choice Reviews Online · doi:10.5860/choice.34-1602 · Cited by 3,007
Fast Discrete Curvelet Transforms
Candès, E., Demanet, L., Donoho, D., & Ying, L. (2006) · Multiscale Modeling & Simulation · doi:10.1137/05064182x · Cited by 2,573
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
Computational Frameworks for the Fast Fourier Transform
Van Loan, C. (1992) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970999 · Cited by 1,283
Bungartz, H.-J., & Griebel, M. (2004) · Acta Numerica · doi:10.1017/s0962492904000182 · Cited by 1,063
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
Cited by
Understanding the Lomb–Scargle Periodogram
VanderPlas, J. T. (2018) · The Astrophysical Journal Supplement Series · doi:10.3847/1538-4365/aab766 · Cited by 1,248
Andrade, X., Strubbe, D., De Giovannini, U., Larsen, A. H., Oliveira, M. J. T., Alberdi-Rodriguez, J., Varas, A., Theophilou, I., Helbig, N., Verstraete, M. J., et al. (2015) · Physical Chemistry Chemical Physics · doi:10.1039/c5cp00351b · Cited by 526
The Kepler characterization of the variability among A- and F-type stars: I. General overview
Uytterhoeven, K., Moya, A., Grigahcène, A., Guzik, J. A., Gutiérrez-Soto, J., Smalley, B., Handler, G., Balona, L. A., Niemczura, E., Fox Machado, L., et al. (2011) · Astronomy & Astrophysics · doi:10.1051/0004-6361/201117368 · Cited by 341
Metadata
- Authors
- Keiner, J., Kunis, S., & Potts, D.
- Venue
- ACM Transactions on Mathematical Software
- Published
- 2009-08
- Volume
- 36
- Issue
- 4
- Pages
- 1-30
- ISSN
- 0098-3500 (ISSN-L)
- 1557-7295
- OpenAlex
- W2131768055
- Cited by
- 367
- References
- 34
- FWCI
- 23.60
- 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: Using NFFT 3---A Software Library for Various Nonequispaced Fast Fourier Transforms. https://app.cochat.ai/papers/10.1145/1555386.1555388
- The paper
- Keiner, J., Kunis, S., & Potts, D. (2009). Using NFFT 3---A Software Library for Various Nonequispaced Fast Fourier Transforms. ACM Transactions on Mathematical Software. https://doi.org/10.1145/1555386.1555388
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.