Comparison of sequence accelerators for the Gaver method of numerical Laplace transform inversion

abstract

• The sequence of Gaver functionajs is useful in the numerical inversion of Laplace transforms. The convergence behavior of the sequence is logarithmic, therefore, an acceleration scheme U required. The accepted procedure utilizes Salzer summation, because in many cases the Gaver functional have the asymptotic behavior fn(t)-fn-i(t) An-2 as n for fixed t. It seems that no other acceleration schemes have been investigated in this area. Surely, the popular nonlinear methods should be more effective. However, to our surprise, only one nonlinear method was superior to Salzer summation, namely the Wynn rho algorithm. 2004 Elsevier Ltd. All rights reserved.

authors

• Valko, Peter

published proceedings

• COMPUTERS & MATHEMATICS WITH APPLICATIONS

author list (cited authors)

• Valko, P. P., & Abate, J.

citation count

• 195

complete list of authors

• Valko, PP||Abate, J

publication date

• January 2004

publisher

• Elsevier  Publisher

published in

• Computers and Mathematics with Applications  Journal

keywords

• Convergence Acceleration
• Laplace Transform
• Numerical Transform Inversion
• Sequence Transformation

Digital Object Identifier (DOI)

• 10.1016/j.camwa.2002.10.017

start page

• 629

end page

• 636

volume

• 48

issue

• 3-4

URL

• http%3A%2F%2Fdx.doi.org%2F10.1016%2Fj.camwa.2002.10.017