Showing a limited preview of this publication:
We construct a fast algorithm for the computation of discrete Gauss transforms with complex parameters, capable of dealing with non equispaced points. Our algorithm is based on the fast Fourier transform at non equispaced knots and requires only 
(N) arithmetic operations.
Key Words: Gauss transform,; unequally spaced Fourier transforms,; fast algorithms,; chirped Gaussian,; NFFT
Published Online: 2006-12-01
Published in Print: 2006-12-01
Copyright 2006, Walter de Gruyter
