Fast and direct inversion methods for the multivariate nonequispaced fast Fourier transform
Fast and direct inversion methods for the multivariate nonequispaced fast Fourier transform
The well-known discrete Fourier transform (DFT) can easily be generalized to arbitrary nodes in the spatial domain. The fast procedure for this generalization is referred to as nonequispaced fast Fourier transform (NFFT). Various applications such as MRI and solution of PDEs are interested in the inverse problem, i.e., computing Fourier …