Numerical Inversion of Laplace Transforms by Relating Them to the Finite Fourier Cosine Transform
Journal of the ACM (JACM)
Analysis of Performability for Stochastic Models of Fault-Tolerant Systems
IEEE Transactions on Computers
Approximating response time distributions
SIGMETRICS '89 Proceedings of the 1989 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
ACM Transactions on Mathematical Software (TOMS)
Regenerative randomization: theory and application examples
Proceedings of the 1995 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
Algorithm 619: automatic numerical inversion of the Laplace transform [D5]
ACM Transactions on Mathematical Software (TOMS)
An implementation of a Fourier series method for the numerical inversion of the Laplace transform
ACM Transactions on Mathematical Software (TOMS)
Applied Mathematics and Computation
IPDPS '00 Proceedings of the 15 IPDPS 2000 Workshops on Parallel and Distributed Processing
Algebraic inversion of the Laplace transform
Computers & Mathematics with Applications
An accurate numerical inversionof Laplace transforms based on the location of their poles
Computers & Mathematics with Applications
Mathematical and Computer Modelling: An International Journal
A Laplace transform finite difference method for the Black-Scholes equation
Mathematical and Computer Modelling: An International Journal
Hi-index | 0.01 |
A method is presented for numerically inverting a Laplace transform that requires, in addition to the transform function itself, only sine, cosine, and exponential functions. The method is conceptually much like the method of Dubner and Abate, which approximates the inverse function by means of a Fourier cosine series. The method presented here, however, differs from theirs in two important respects. First of all, the Fourier series contains additional terms involving the sine function selected such that the error in the approximation is less than that of Dubner and Abate and such that the Fourier series approximates the inverse function on an interval of twice the length of the corresponding interval in Dubner and Abate's method. Second, there is incorporated into the method in this paper a transformation of the approximating series into one that converges very rapidly. In test problems using the method it has routinely been possible to evaluate inverse transforms with considerable accuracy over a wide range of values of the independent variable using a relatively few determinations of the Laplace transform itself.