Algorithms for unequally spaced fast Laplace transforms

Applied and Computational Harmonic Analysis - Tập 35 - Trang 419-432 - 2013
Fredrik Andersson1
1Centre for Mathematical Sciences, Lund University, Box 118, SE 22100 Lund, Sweden

Tài liệu tham khảo

Beylkin, 1995, On the fast Fourier transform of functions with singularities, Appl. Comput. Harmon. Anal., 2, 363, 10.1006/acha.1995.1026 Dutt, 1993, Fast Fourier transforms for nonequispaced data, SIAM J. Sci. Comput., 14, 1368, 10.1137/0914081 Rokhlin, 1988, A fast algorithm for the discrete Laplace transformation, J. Complex., 4, 12, 10.1016/0885-064X(88)90007-6 Strain, 1992, A fast Laplace transform based on Laguerre functions, Math. Comput., 58, 275, 10.1090/S0025-5718-1992-1106983-2 Andersson, 2005, The fast Gauss transform with complex parameters, J. Comput. Phys., 203, 274, 10.1016/j.jcp.2004.07.020 Greengard, 2004, Accelerating the nonuniform fast Fourier transform, SIAM Rev., 46, 443, 10.1137/S003614450343200X Beylkin, 2005, On approximation of functions by exponential sums, Appl. Comput. Harmon. Anal., 19, 17, 10.1016/j.acha.2005.01.003 1992