Fast Fourier Transforms for Nonequispaced Data: A Tutorial
In this chapter we consider approximativemethods for the fast computation of multivariate discrete Fourier transforms for nonequispaced data (NDFT) in the time domain and in the frequency domain. In particularwe are interested in the approximation error as function of the arithmetic complexity of the algorithm. We discuss the robustness of NDFT¡ªalgorithms with respect to roundoff errors and applyNDFTalgorithms for the fast computation of Besseltransforms.
Unable to display preview. Download preview PDF.