Algorithms for unequally spaced fast Laplace transforms

DOI10.1016/j.acha.2012.11.005zbMath1294.65109OpenAlexW2066099890MaRDI QIDQ2252164

Fredrik Andersson

Publication date: 16 July 2014

Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.acha.2012.11.005

zbMATH Keywords

computational complexityfast Fourier transformsfast algorithmsdiscrete Fourier transformsnumerical experimentdiscrete Laplace transformsfast application of complex Vandermonde matrices

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) Laplace transform (44A10) Numerical methods for integral transforms (65R10)

Related Items (1)

Fast Laplace transforms for the exponential Radon transform

Cites Work

• The fast Gauss transform with complex parameters
• A fast algorithm for the discrete Laplace transformation
• On the fast Fourier transform of functions with singularities
• On approximation of functions by exponential sums
• A Fast Laplace Transform Based on Laguerre Functions
• Fast Fourier Transforms for Nonequispaced Data
• Accelerating the Nonuniform Fast Fourier Transform
• Unnamed Item

This page was built for publication: Algorithms for unequally spaced fast Laplace transforms