On the rate of convergence of the Gaver-Stehfest algorithm

DOI10.1093/IMANUM/DRAB015zbMATH Open1514.65199arXiv2005.05813MaRDI QIDQ6340554FDOQ6340554

Alexey S. Kuznetsov, Justin Miles

Publication date: 12 May 2020

Abstract: The Gaver-Stehfest algorithm is widely used for numerical inversion of Laplace transform. In this paper we provide the first rigorous study of the rate of convergence of the Gaver-Stehfest algorithm. We prove that Gaver-Stehfest approximations converge exponentially fast if the target function is analytic in a neighbourhood of a point and they converge at a rate $o(n^{-k})$ if the target function is $(2k+3)$-times differentiable at a point.

Mathematics Subject Classification ID

Laplace transform (44A10) Numerical methods for integral transforms (65R10)

This page was built for publication: On the rate of convergence of the Gaver-Stehfest algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6340554)