scholarly journals Computer-Aided Numerical Inversion of Laplace Transform

2000 ◽  
Vol 22 (3) ◽  
pp. 189-213 ◽  
Author(s):  
Umesh Kumar

This paper explores the technique for the computer aided numerical inversion of Laplace transform. The inversion technique is based on the properties of a family of three parameter exponential probability density functions. The only limitation in the technique is the word length of the computer being used. The Laplace transform has been used extensively in the frequency domain solution of linear, lumped time invariant networks but its application to the time domain has been limited, mainly because of the difficulty in finding the necessary poles and residues. The numerical inversion technique mentioned above does away with the poles and residues but uses precomputed numbers to find the time response. This technique is applicable to the solution of partially differentiable equations and certain classes of linear systems with time varying components.

1999 ◽  
Vol 110 (23) ◽  
pp. 11176-11186 ◽  
Author(s):  
Bruno Hüpper ◽  
Eli Pollak

2018 ◽  
Vol 13 ◽  
pp. 174830181879706 ◽  
Author(s):  
Colin L Defreitas ◽  
Steve J Kane

This paper examines the noise handling properties of three of the most widely used algorithms for numerically inverting the Laplace transform. After examining the genesis of the algorithms, their error handling properties are evaluated through a series of standard test functions in which noise is added to the inverse transform. Comparisons are then made with the exact data. Our main finding is that the for “noisy data”, the Talbot inversion algorithm performs with greater accuracy when compared to the Fourier series and Stehfest numerical inversion schemes as they are outlined in this paper.


Sign in / Sign up

Export Citation Format

Share Document