Nonuniform fast Fourier transform (NUFFT) algorithm and its applications

Based on a class of regular Fourier matrices, a new nonuniform fast Fourier transform (NUFFT) algorithm is developed for unequally spaced data. With a comparable complexity of O(N log/sub 2/N), this algorithm is much more accurate than previously reported results since it is optimal in the least squares sense. The algorithm is useful for computational electromagnetics and other fields of applied mathematics.