The noise handling properties of the Talbot algorithm for numerically inverting the Laplace transform

This paper examines the noise handling properties of three of the most widely used algorithms for numerically inverting the Laplace transform. After examining the genesis of the algorithms, their error handling properties are evaluated through a series of standard test functions in which noise is added to the inverse transform. Comparisons are then made with the exact data. Our main finding is that the for “noisy data”, the Talbot inversion algorithm performs with greater accuracy when compared to the Fourier series and Stehfest numerical inversion schemes as they are outlined in this paper.

Abstract licence: CC BY-NC

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.