The fast Gauss transform with complex parameters

Authors:
Fredrik Andersson;Gregory Beylkin
Affiliations:
Centre for Mathematical Sciences, Lund University/LTH, Solvegatan 18, P.O. Box 118, SE-22100 Lund, Sweden;Department of Applied Mathematics, University of Colorado, 526 UCB, Boulder, CO 80309-0526, USA
Venue:
Journal of Computational Physics
Year:
2005

Citing 3
Cited 2

The fast Gauss transform

SIAM Journal on Scientific and Statistical Computing
The fast Gauss transform with variable scales

SIAM Journal on Scientific and Statistical Computing
Fast Fourier transforms for nonequispaced data

SIAM Journal on Scientific Computing

Complex Valued Spectral Hermite Approximations for the Actively Mode-Locked Laser

Journal of Scientific Computing
Using NFFT 3---A Software Library for Various Nonequispaced Fast Fourier Transforms

ACM Transactions on Mathematical Software (TOMS)

Quantified Score

Hi-index	31.45

Visualization

Abstract

We construct a fast method, O(NlogN), for the computation of discrete Gauss transforms with complex parameters, capable of dealing with unequally spaced grid points. The method is based on Fourier techniques, and in particular it makes use of a modified unequally spaced fast Fourier transform algorithm, in combination with previously suggested divide and conquer strategies for ordinary fast Gauss transform methods.