By Topic

The Gaver-Stehfest algorithm for approximate inversion of Laplace transforms

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
R. G. Jacquot ; Department of Electrical Engineering, University of Wyoming, Laramie, WY 82071 ; J. W. Steadman ; C. N. Rhodine

An approximate technique for the inversion of Laplace transforms is represented and some simple applications are given. The limitations of the method were explored and it is clear that functions which have oscillatory inverses present difficulty for the method. Better approximations result from the use of computers with longer word lengths and there is considerable improvement when an averaging algorithm is employed. Eight-bit microcomputers are generally sufficiently accurate for nonoscillatory time functions but transforms for lightly damped sinusoids and Bessel functions require large main-frame computers with relatively long word length.

Published in:

IEEE Circuits & Systems Magazine  (Volume:5 ,  Issue: 1 )