# A parallel non-uniform fast Fourier transform library based on an "exponential of semicircle" kernel

@article{Barnett2019APN,
title={A parallel non-uniform fast Fourier transform library based on an "exponential of semicircle" kernel},
author={Alex H. Barnett and Jeremy F. Magland and Ludvig af Klinteberg},
journal={SIAM J. Sci. Comput.},
year={2019},
volume={41},
pages={C479-C504}
}
• Published 21 August 2018
• Computer Science, Mathematics
• SIAM J. Sci. Comput.
The nonuniform fast Fourier transform (NUFFT) generalizes the FFT to off-grid data. Its many applications include image reconstruction, data analysis, and the numerical solution of differential equations. We present FINUFFT, an efficient parallel library for type 1 (nonuiform to uniform), type 2 (uniform to nonuniform), or type 3 (nonuniform to nonuniform) transforms, in dimensions 1, 2, or 3. It uses minimal RAM, requires no precomputation or plan steps, and has a simple interface to several…
Aliasing error of the exp(β√(1-z2)) kernel in the nonuniform fast Fourier transform
An aliasing error estimate is proved which bounds the error of the one-dimensional NUFFT of types 1 and 2 in exact arithmetic and new connections are drawn between the above kernel, Kaiser–Bessel, and prolate spheroidal wavefunctions of order zero, which all appear to share an optimal exponential convergence rate.
A fast Petrov-Galerkin spectral method for the multi-dimensional Boltzmann equation using mapped Chebyshev functions
• Computer Science, Mathematics
ArXiv
• 2021
A Petrov-Galerkin spectral method for the Boltzmann equation in the unbounded domain is introduced and is able to construct a fast algorithm with the help of the non-uniform fast Fourier transform (NUFFT).
Fast Ewald summation for electrostatic potentials with arbitrary periodicity.
• Medicine, Mathematics
The Journal of chemical physics
• 2021
It is shown that removing periodic boundary conditions from one or two directions out of three will only moderately increase the total runtime, and in the free-space case, the runtime is around four times that of the triply periodic case.
A high-order integral equation-based solver for the time-dependent Schrodinger equation
• Computer Science, Mathematics
ArXiv
• 2020
A numerical method is introduced for the solution of the time-dependent Schrodinger equation with a smooth potential, based on its reformulation as a Volterra integral equation, which avoids the need for artificial boundary conditions, admits simple, inexpensive high-order implicit time marching schemes, and naturally includes time- dependent potentials.
Periodic Fast Multipole Method
• Computer Science, Mathematics
ArXiv
• 2021
The approach extends to the oscillatory equations of mathematical physics, including the Helmholtz and Maxwell equations, but will address these in a companion paper, since the nature of the problem is somewhat different and includes the consideration of quasiperiodic boundary conditions and resonances.
Factorization of the translation kernel for fast rigid image alignment
• Mathematics, Computer Science
• 2019