Cart (Loading....) | Create Account
Close category search window
 

The Gaver-Stehfest algorithm for approximate inversion of Laplace transforms

Sign In

Full text access may be available.

To access full text, please use your member or institutional sign in.

Formats Non-Member Member
$31 $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)
Jacquot, R.G. ; Dept. of Electrical Engng., Univ. of Wyoming, Laramie, WY, USA ; Steadman, J.W. ; Rhodine, C.N.

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:

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

Date of Publication:

March 1983

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.