A Fortran implementation of the Vollinga-Weinzierl algorithm evaluates generalised polylogarithms up to weight five quickly enough for Monte Carlo integration.
Numerical Implementation of Harmonic Polylogarithms to Weight w = 8
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
We present the FORTRAN-code HPOLY.f for the numerical calculation of harmonic polylogarithms up to w = 8 at an absolute accuracy of $\sim 4.9 \cdot 10^{-15}$ or better. Using algebraic and argument relations the numerical representation can be limited to the range $x \in [0, \sqrt{2}-1]$. We provide replacement files to map all harmonic polylogarithms to a basis and the usual range of arguments $x \in ]-\infty,+\infty[$ to the above interval analytically. We also briefly comment on a numerical implementation of real valued cyclotomic harmonic polylogarithms.
citation-role summary
method 1
citation-polarity summary
fields
hep-ph 1years
2019 1verdicts
ACCEPT 1roles
method 1polarities
use method 1representative citing papers
citing papers explorer
-
HandyG -- rapid numerical evaluation of generalised polylogarithms in Fortran
A Fortran implementation of the Vollinga-Weinzierl algorithm evaluates generalised polylogarithms up to weight five quickly enough for Monte Carlo integration.