A Fast Laplace Transform Based on Laguerre Functions (Q3987934)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 31890
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Fast Laplace Transform Based on Laguerre Functions |
scientific article; zbMATH DE number 31890 |
Statements
28 June 1992
0 references
geometric divide and conquer strategy
0 references
Laguerre expansions
0 references
fast algorithm
0 references
discrete Laplace transform
0 references
Laguerre polynomials
0 references
convolution
0 references
A Fast Laplace Transform Based on Laguerre Functions (English)
0 references
0.8551492691040039
0 references
0.807275116443634
0 references
0.8060449957847595
0 references
0.8026779294013977
0 references
This paper deals with a fast algorithm which can be used effectively to evaluate a discrete Laplace transform \(\hat f_ i=\sum_{j=1}^ N f_ j\exp(-t_ j s_ j)\), where \(i=1,2,\dots,M\). This algorithm is based upon certain properties of Laguerre polynomials and the convolution formula of the Laplace transform. The algorithm is tested numerically for randomly generated points uniformly distributed on the interval \([0,5]\). It is shown that the fast algorithm is better than direct evaluation consistently for \(N=M\geq 20\). For \(N=M=10240\), this algorithm is about a thousand times faster than direct evaluation. However, the algorithm breaks even at \(N=M=20\) and achieves a speedup of \(10^ 3\) at \(N=M=10240\). It is also shown that a generalization of the algorithm allows the application of any multiplicative convolution at \(\mathbb{R}^ +\) with a smooth kernel in optimal time. This work is interesting and has some useful applications.
0 references