ON THE CONVERGENCE OF THE GAVER–STEHFEST ALGORITHM

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,...

Full description

Saved in:
Bibliographic Details
Published in:SIAM journal on numerical analysis 2013-01, Vol.51 (6), p.2984-2998
Main Author: KUZNETSOV, A.
Format: Article
Language:English
Subjects:
Algorithms
Applied mathematics
Approximation
Geophysics
Laplace transforms
Mathematical functions
Neighborhoods
Random variables
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0036-1429
1095-7170
DOI:10.1137/13091974x