… the fast Fourier transform to the case of noninteger frequencies and nonequispaced nodes
… considerations with the classical fast Fourier transform and generalize both the forward and …

… the fast Fourier transform to the case of noninteger frequencies and nonequispaced nodes
… combination of the classical fast Fourier transform with a version of the fast multipole method, …

… for the fast computation of multivariate discrete Fourier transforms for nonequispaced data
(… to roundoff errors and apply NDFTalgorithms for the fast computation of Bessel transforms. …

… are concerned with fast Fourier transforms for nonequispaced grids. We propose a general
efficient method for the fast evaluation of trigonometric polynomials at nonequispaced nodes …

… In this article we describe a non-equispaced fast Fourier transform. It is similar to the
algorithms of Dutt and Rokhlin [4] and Beylkin [2] but is based on an exact Fourier series …

… nodes (NDCT) and for the discrete sine transform at nonequispaced nodes (NDST). Our
approach is based on the fast Fourier transform at nonequispaced nodes (NFFT) proposed by …

… Having introduced the fast methods for nonequispaced data, we aim to find an inversion
for these algorithms encouraged by the fact that for equispaced data the inversion is well-known…

… The nonequispaced Fourier transform arises in a variety of application areas, from medical
imaging to radio astronomy to the numerical solution of partial differential equations. In a …

… The name “non-equispaced fast Fourier transform” stems from our CPU … fast Fourier transform
[11], the generalized fast Fourier transform [12], the unequallyspaced fast Fourier transform …

… 1995, 2, 85–100) for fast Fourier transforms of non equispaced data. Examples of 1H)15N
HSQC spectra are shown, where crowded correlation peaks can be resolved using non-linear …