The numerical performance of Tricomi's formula for inverting the Laplace transform (Q1082055): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 03:07, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The numerical performance of Tricomi's formula for inverting the Laplace transform |
scientific article |
Statements
The numerical performance of Tricomi's formula for inverting the Laplace transform (English)
0 references
1987
0 references
A method for inverting the Laplace transform which uses an expansion into Laguerre polynomials is considered. By means of a recently established generalization of the Euler-Knopp transformation the rate of convergence of the series of Laguerre polynomials is accelerated. For computing the transformed series a recursive algorithm is given. Results of theoretical and practical nature make the usefulness of the new transformation evident.
0 references
Tricomi's formula
0 references
Euler-Knopp transformation
0 references
rate of convergence
0 references
series of Laguerre polynomials
0 references
recursive algorithm
0 references
Laplace transform inversion
0 references
convergence acceleration
0 references
