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
Print ISSN: 1570-2820
Volume: 14, 12/2006
Pages: 295 - 303