Documentation

Manuals

NFFT tutorial
NFFT 3.5 Doxygen documentation (pdf), which gives detailed information on more advanced options and parameter settings for each routine.

The general paper that we recommend if you wish to cite the NFFT is:

Keiner, J., Kunis, S., and Potts, D.
Using NFFT 3 – a software library for various nonequispaced fast Fourier transforms.
ACM Trans. Math. Software 36, Article 19, 1–30, 2009. pdf ps

The technical report OpenMP parallelization in the NFFT software library was written by Toni Volkmer.
A tutorial on the NFFT was published in 2001 in: Modern Sampling Theory: Mathematics and Applications, J. J. Benedetto and P. Ferreira (Eds.), Chapter 12, pages 249–274, with the title “Fast Fourier transforms for nonequispaced data: A tutorial” by D. Potts, G. Steidl, and M. Tasche. pdf ps.Z
Or the appendix in Potts, D. and Steidl, G.: Fast summation at nonequispaced knots by NFFTs. SIAM J. Sci. Comput. 24, 2013–2037, 2003. pdf ps
The inverse NFFT is considered by S. Kunis and D. Potts in Stability results for scattered data interpolation by trigonometric polynomials. SIAM J. Sci. Comput. 29, 1403–1419. pdf ps
Detailed information on the NFFT is given by S. Kunis and D. Potts in Time and memory requirements of the nonequispaced FFT. Sampling Theory in Signal and Image Processing 7, 77–100. pdf ps
The thesis by S. Kunis: Nonequispaced FFT – generalisation and inversion.
An overview of the discrete Fourier transform and its generalizations is provided in the textbook by G. Plonka, D. Potts, G. Steidl, and M. Tasche: Numerical Fourier Analysis. ANHA, Birkhäuser, 2019, ISBN 978-3-030-04305-6. doi

Further papers about the NFFT are available on the publication page of Daniel Potts.