Fast Approximate Fourier Transforms for Irregularly Spaced Data
Antony F. Ware · SIAM Review · 1998
Several algorithms for efficiently evaluating trigonometric polynomials at irregularly spaced points are presented and analyzed. The algorithms can be viewed as approximate generalizations of the fast Fourier transform (FFT), and they are compared with regard to their accuracy and their computational efficiency.