Using local PHS+ poly approximations for Laplace transform inversion by Gaver-Stehfest algorithm Articles uri icon

publication date

  • December 2020

start page

  • 55

end page

  • 64

volume

  • 13

International Standard Serial Number (ISSN)

  • 2035-6803

abstract

  • The Laplace transform inversion is a well-known ill-conditioned problem and many numerical schemes in literature have investigated how to solve it. In this paper, we revise the Gaver-Stehfest method by using polyharmonic splines augmented with polynomials to approximate the Laplace transform into the numerical inversion formula. Theoretical accuracy bounds for the fitting model are given. Discussions on the effectiveness of the inversion algorithm are produced and confirmed by numerical experiments about approximation errors and inversion results. Comparisons with an existing model are also presented.

keywords

  • numerical inversion; polynomials; laplace transforms