Abstract
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→∞. Although we require that g(s)→0 as s→∞, it can approach 0 as \({1\over s^{\beta}}\), with 0<β<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)={\sqrt{\pi}\over \sqrt{s}}\), the Laplace transform of \({1\over\sqrt{v}}\).
Similar content being viewed by others
References
M.M. Block, Eur. Phys. J. C 65, 1 (2010)
Mathematica 7, a computing program from Wolfram Research, Inc., Champaign, IL, USA, www.wolfram.com, 2009
M.M. Block, L. Durand, P. Ha, D.W. McKay, to be published (2010). arXiv:1004.1440 [hep-ph]
Author information
Authors and Affiliations
Corresponding author
Additional information
The online version of the original article can be found under doi:http://dx.doi.org/10.1140/epjc/s10052-009-1195-8.
Rights and permissions
About this article
Cite this article
Block, M.M. Addendum to: A new numerical method for obtaining gluon distribution functions G(x,Q 2)=xg(x,Q 2), from the proton structure function \(F_{2}^{\gamma p}(x,Q^{2})\) . Eur. Phys. J. C 68, 683–685 (2010). https://doi.org/10.1140/epjc/s10052-010-1374-7
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1140/epjc/s10052-010-1374-7