4.6 Article

ON THE CONVERGENCE OF THE GAVER-STEHFEST ALGORITHM

Journal

SIAM JOURNAL ON NUMERICAL ANALYSIS
Volume 51, Issue 6, Pages 2984-2998

Publisher

SIAM PUBLICATIONS
DOI: 10.1137/13091974X

Keywords

Gaver-Stehfest algorithm; inverse Laplace transform; Lambert W-function; generating functions; Dini criterion; Jordan criterion

Funding

  1. Natural Sciences and Engineering Research Council of Canada

Ask authors/readers for more resources

The Gaver-Stehfest algorithm for numerical inversion of Laplace transform was developed in the late 1960s. Due to its simplicity and good performance it is becoming increasingly more popular in such diverse areas as geophysics, operations research and economics, financial and actuarial mathematics, computational physics, and chemistry. Despite the large number of applications and numerical studies, this method has never been rigorously investigated. In particular, it is not known whether the Gaver-Stehfest approximations converge or what the rate of convergence is. In this paper we answer the first of these two questions: We prove that the Gaver-Stehfest approximations converge for functions of bounded variation and functions satisfying an analogue of Dini criterion.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.6
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available