This notebook contains programs to compute the Nonequispaced Fourier Transform (NFFT) and its transpose as described in Potts, D., Steidl G., and Tasche M., "Fast Fourier transforms for nonequispaced data: A tutorial" in Modern Sampling Theory: Mathematics and Applications, J.J. Benedetto and P. Ferreira (Eds.), Chapter 12, pages 249-274.
For the newest resources, visit Wolfram Repositories and Archives »
