Algorithms for unequally spaced fast Laplace transforms

DOI10.1016/J.ACHA.2012.11.005MaRDI QIDQ2252164zbMATH OpenOpenAlexFDO

Authors 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 complexitydiscrete Fourier transformsdiscrete Laplace transformsfast algorithmsfast application of complex Vandermonde matricesfast Fourier transformsnumerical experiment

Mathematics Subject Classification ID

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

Recommendations

• A Fast Laplace Transform Based on Laguerre Functions
• Fast and approximate computation of Laplace and Fourier transforms
• scientific article; zbMATH DE number 1329498
• Fast Fourier transforms for nonequispaced data. II
• Fast Fourier Transforms for Nonequispaced Data

Cites work

• A fast algorithm for the discrete Laplace transformation
• A Fast Laplace Transform Based on Laguerre Functions
• Accelerating the Nonuniform Fast Fourier Transform
• Fast Fourier Transforms for Nonequispaced Data
• scientific article; zbMATH DE number 3863589 (Why is no real title available?)
• On approximation of functions by exponential sums
• On the fast Fourier transform of functions with singularities
• The fast Gauss transform with complex parameters

Cited in

(4)

• A fast algorithm for the discrete Laplace transformation
• Fast Laplace transforms for the exponential Radon transform
• Rapid ``algebraic Fourier transforms on uniformly distributed meshes
• A Fast Laplace Transform Based on Laguerre Functions

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2252164)