Aliasing error of the exp(β1− z2) kernel in the nonuniform fast Fourier transform
AH Barnett - Applied and Computational Harmonic Analysis, 2021 - Elsevier
The most popular algorithm for the nonuniform fast Fourier transform (NUFFT) uses the
dilation of a kernel ϕ to spread (or interpolate) between given nonuniform points and a …
dilation of a kernel ϕ to spread (or interpolate) between given nonuniform points and a …
Aliasing error of the exp kernel in the nonuniform fast Fourier transform
AH Barnett - arXiv e-prints, 2020 - ui.adsabs.harvard.edu
The most popular algorithm for the nonuniform fast Fourier transform (NUFFT) uses the
dilation of a kernel $\phi $ to spread (or interpolate) between given nonuniform points and a …
dilation of a kernel $\phi $ to spread (or interpolate) between given nonuniform points and a …
Aliasing error of the exp kernel in the nonuniform fast Fourier transform
AH Barnett - arXiv preprint arXiv:2001.09405, 2020 - arxiv.org
The most popular algorithm for the nonuniform fast Fourier transform (NUFFT) uses the
dilation of a kernel $\phi $ to spread (or interpolate) between given nonuniform points and a …
dilation of a kernel $\phi $ to spread (or interpolate) between given nonuniform points and a …