摘要

Since publication of M.M. Block in Eur. Phys. J. C 65, 1 (2010), we have discovered that the algorithm of Block (2010) does not work if g(s) -> 0 less rapidly than 1/s, as s -> infinity. Although we require that g(s) -> 0 as s -> 8, it can approach 0 as 1/s(beta), with 0 < beta < 1, and still be a proper Laplace transform. In this note, we derive a new numerical algorithm for just such cases, and test it for g(s) = root pi/root s, the Laplace transform of 1/root nu