By Francoise Veillon
Communications of the ACM,
October 1974,
Vol. 17 No. 10, Pages 587-589
10.1145/355620.361174
Comments
This work forms part of a thesis presented in Grenoble in March 1972. Improvements made to the Dubner and Abate algorithm for numerical inversion of the Laplace transform [1] have led to results which compare favorably with theirs and those of Bellmann [2], and Stehfest [3]. The Dubner method leads to the approximation formula: ƒ(t) = 2eat/T[1/2Re{F(a)} + ∑∞k-1 Re{F(a + ik&pgr;/T)}cos(k&pgr;t/T)], (1) where F(s) is the Laplace transform of ƒ(t) and a is positive and greater than the real parts of the singularities of ƒ(t).
The full text of this article is premium content
No entries found
Log in to Read the Full Article
Need Access?
Please select one of the options below for access to premium content and features.
Create a Web Account
If you are already an ACM member, Communications subscriber, or Digital Library subscriber, please set up a web account to access premium content on this site.
Join the ACM
Become a member to take full advantage of ACM's outstanding computing information resources, networking opportunities, and other benefits.
Subscribe to Communications of the ACM Magazine
Get full access to 50+ years of CACM content and receive the print version of the magazine monthly.
Purchase the Article
Non-members can purchase this article or a copy of the magazine in which it appears.
