Tensor integrand reduction via Laurent expansion
From MaRDI portal
Publication:1638776
DOI10.1007/JHEP06(2016)060zbMATH Open1388.81006arXiv1604.01363MaRDI QIDQ1638776
Author name not available (Why is that?)
Publication date: 12 June 2018
Published in: (Search for Journal in Brave)
Abstract: We introduce a new method for the application of one-loop integrand reduction via the Laurent expansion algorithm, as implemented in the public C++ library Ninja. We show how the coefficients of the Laurent expansion can be computed by suitable contractions of the loop numerator tensor with cut-dependent projectors, making it possible to interface Ninja to any one-loop matrix element generator that can provide the components of this tensor. We implemented this technique in the Ninja library and interfaced it to MadLoop, which is part of the public MadGraph5_aMC@NLO framework. We performed a detailed performance study, comparing against other public reduction tools, namely CutTools, Samurai, IREGI, PJFry++ and Golem. We find that Ninja outperforms traditional integrand reduction in both speed and numerical stability, the latter being on par with that of the tensor integral reduction tool Golem which is however more limited and slower than Ninja. We considered many benchmark multi-scale processes of increasing complexity, involving QCD and electro-weak corrections as well as effective non-renormalizable couplings, showing that Ninja's performance scales well with both the rank and multiplicity of the considered process.
Full work available at URL: https://arxiv.org/abs/1604.01363
No records found.
No records found.
This page was built for publication: Tensor integrand reduction via Laurent expansion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1638776)
