Review of numerical inversion of Laplace transforms using Fourier analysis, fast Fourier transform and orthogonal polynomials (Q2920923)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Review of numerical inversion of Laplace transforms using Fourier analysis, fast Fourier transform and orthogonal polynomials |
scientific article; zbMATH DE number 6349109
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Review of numerical inversion of Laplace transforms using Fourier analysis, fast Fourier transform and orthogonal polynomials |
scientific article; zbMATH DE number 6349109 |
Statements
29 September 2014
0 references
Laplace transform
0 references
Fourier transform
0 references
orthogonal polynomials
0 references
Poisson summation formula
0 references
fast Fourier transform
0 references
Review of numerical inversion of Laplace transforms using Fourier analysis, fast Fourier transform and orthogonal polynomials (English)
0 references
We may call this paper a very well composed and viable survey article. In fact it is. The title of the paper is so engrossing and is saturated in mathematical analysis. This survey has discussed series methods for numerically inverting Laplace transform. Methods discussed are due to Euler, due to Post-Widder and then the connection between the Euler and Post-Widder methods is given. Some other methods are also discussed in Section 5.2. It is mentioned that for functions with step first derivatives, these methods do not yield accurate results. The methods also include fast Fourier transform, Laguerre, Legendre and Chebyshev polynomials methods. References are exciting.
0 references