Using NFFT 3---A Software Library for Various Nonequispaced Fast Fourier Transforms

By Jens Keiner, Stefan Kunis, Daniel Potts. TOMS, 2009

381 citations recorded by the source corpus.

Subfields: Applied Mathematics, Computer Vision and Pattern Recognition, Geophysics

View Paper: https://www.semanticscholar.org/paper/43689b700e1ab5ee9affcef15899c04250b490fc

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Applied Mathematics

1. Götz E. Pfander
2. J. Vanderplas

In Computer Vision and Pattern Recognition

1. Götz E. Pfander
2. J. Vanderplas

In Geophysics

1. Götz E. Pfander
2. J. Vanderplas

Citations in the corpus

• Gabor Frames in Finite Dimensions (2013, methodology): “The fast Fourier transform (FFT) provides an efficient algorithm to compute matrix vector products of the form WNx [14, 22, 57, 78].”
• Understanding the Lomb–Scargle Periodogram (2017, methodology): “…qualitatively similar approach to the Press & Rybicki (1989) algorithm is presented by Leroy (2012): It makes use of the Non-equispaced Fast Fourier Transform (NFFT, see Keiner et al. 2009) to compute the Lomb-Scargle periodogram about a factor of 10 faster than the Press & Rybicki (1989) approach.”