A comparison of efficient methods for the computation of Born gluon amplitudes
Michael Dinsdale, Marko Ternick, Stefan Weinzierl
TL;DR
This paper evaluates four recursive algorithms for computing Born-level gluon amplitudes in QCD as the number of external partons $n$ grows, focusing on efficiency and numerical stability in critical phase-space regions. It compares Berends-Giele off-shell-current recursions, scalar-diagram recursions, MHV-vertex CSW recursions, and BCF on-shell momentum-shift recursions, using the leading-color quantity ${\cal M}_n$ as a performance metric. The study finds that Berends-Giele is fastest for large $n$ (e.g., $n\ge 9$), while the on-shell BCF method is most efficient for smaller $n$; MHV and scalar-diagram methods are generally slower but stable. All methods agree to about $10^{-12}$ on non-exceptional points up to $n=12$, and they remain numerically stable in soft/collinear regions, with Berends-Giele offering slightly better resilience to spurious singularities. The results guide algorithm choice for LO/NLO Monte Carlo programs at the LHC, balancing $n$ and helicity configurations to optimize computation time.
Abstract
We compare four different methods for the numerical computation of the pure gluonic amplitudes in the Born approximation. We are in particular interested in the efficiency of the various methods as the number n of the external particles increases. In addition we investigate the numerical accuracy in critical phase space regions. The methods considered are based on (i) Berends-Giele recurrence relations, (ii) scalar diagrams, (iii) MHV vertices and (iv) BCF recursion relations.
