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.
No takes yet. Share an insight, caveat, or question.
Antony F. Ware (1998) studied this question.
Synapse has enriched 4 closely related papers on similar clinical questions. Consider them for comparative context: