A technique for increasing the accuracy of the FFT-based method of numerical inversion of Laplace transforms
From MaRDI portal
Publication:1324403
Recommendations
- scientific article; zbMATH DE number 1061890
- Improved FFT-based numerical inversion of Laplace transforms via fast Hartley transform algorithm
- Review of numerical inversion of Laplace transforms using Fourier analysis, fast Fourier transform and orthogonal polynomials
- An implementation of a Fourier series method for the numerical inversion of the Laplace transform
Cites work
- scientific article; zbMATH DE number 3154182 (Why is no real title available?)
- scientific article; zbMATH DE number 3329470 (Why is no real title available?)
- Improved FFT-based numerical inversion of Laplace transforms via fast Hartley transform algorithm
- Numerical Inversion of Laplace Transforms Using a Fourier Series Approximation
- Numerical inversion of the Laplace transform: a survey and comparison of methods
Cited in
(4)- Improved FFT-based numerical inversion of Laplace transforms via fast Hartley transform algorithm
- Laplace transform inversion using Bernstein operational matrix of integration and its application to differential and integral equations
- Accelerations of Zhao's methods for the numerical inversion of Laplace transform
- scientific article; zbMATH DE number 1061890 (Why is no real title available?)
This page was built for publication: A technique for increasing the accuracy of the FFT-based method of numerical inversion of Laplace transforms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1324403)