Algorithms for unequally spaced fast Laplace transforms

We develop fast algorithms for unequally spaced discrete Laplace transforms with complex parameters, which are approximate up to prescribed choice of computa-tional precision. The algorithms are based on modifications of algorithms for unequally spaced fast Fourier transforms using Gaussians. Various configurations of sums with equally and unequally spaced points cant be dealt with. Numeri-cal experiments show that the computational time is similar to that for computing ordinary discrete Fourier transforms by means of FFT. Results are given for the one-dimensional case, but it is straightforward to generalize them to arbitrary di-mensions