Article,

An improved method for numerical inversion of Laplace transforms

, , and .
SIAM J. Sci. Statist. Comput., 3 (3): 357--366 (1982)
DOI: 10.1137/0903022

Abstract

An improved procedure for numerical inversion of Laplace transforms is proposed based on accelerating the convergence of the Fourier series obtained from the inversion integral using the trapezoidal rule. When the full complex series is used, at each time-value the epsilon-algorithm computes a .(trigonometric) Padé approximation which gives better results than existing acceleration methods. The quotient-difference algorithm is used to compute the coefficients of the corresponding continued fraction, which is evaluated at each time-value, greatly improving efficiency. The convergence of the continued fraction can in turn be accelerated, leading to a further improvement in accuracy. Note: code at http://www.cs.hs-rm.de/~weber/lapinv/dehoog/dehoog.htm and often cites Hollenbeck, who says: % algorithm: de Hoog et al's quotient difference method with accelerated % convergence for the continued fraction expansion % de Hoog, F. R., Knight, J. H., and Stokes, A. N. (1982). An improved % method for numerical inversion of Laplace transforms. S.I.A.M. J. Sci. % and Stat. Comput., 3, 357-366. % Modification: The time vector is split in segments of equal magnitude % which are inverted individually. This gives a better overall accuracy. % details: de Hoog et al's algorithm f4 with modifications (T->2*T and % introduction of tol). Corrected error in formulation of z.

Tags

Users

  • @peter.ralph

Comments and Reviews