Header

UZH-Logo

Maintenance Infos

On-the-fly reduction of open loops


Buccioni, Federico; Pozzorini, Stefano; Zoller, Max (2018). On-the-fly reduction of open loops. European Physical Journal C - Particles and Fields, 78:70.

Abstract

Building on the open-loop algorithm we introduce a new method for the automated construction of one-loop amplitudes and their reduction to scalar integrals. The key idea is that the factorisation of one-loop integrands in a product of loop segments makes it possible to perform various operations on-the-fly while constructing the integrand. Reducing the integrand on-the-fly, after each segment multiplication, the construction of loop diagrams and their reduction are unified in a single numerical recursion. In this way we entirely avoid objects with high tensor rank, thereby reducing the complexity of the calculations in a drastic way. Thanks to the on-the-fly approach, which is applied also to helicity summation and for the merging of different diagrams, the speed of the original open-loop algorithm can be further augmented in a very significant way. Moreover, addressing spurious singularities of the employed reduction identities by means of simple expansions in rank-two Gram determinants, we achieve a remarkably high level of numerical stability. These features of the new algorithm, which will be made publicly available in a forthcoming release of the OpenLoops program, are particularly attractive for NLO multi-leg and NNLO real-virtual calculations.

Abstract

Building on the open-loop algorithm we introduce a new method for the automated construction of one-loop amplitudes and their reduction to scalar integrals. The key idea is that the factorisation of one-loop integrands in a product of loop segments makes it possible to perform various operations on-the-fly while constructing the integrand. Reducing the integrand on-the-fly, after each segment multiplication, the construction of loop diagrams and their reduction are unified in a single numerical recursion. In this way we entirely avoid objects with high tensor rank, thereby reducing the complexity of the calculations in a drastic way. Thanks to the on-the-fly approach, which is applied also to helicity summation and for the merging of different diagrams, the speed of the original open-loop algorithm can be further augmented in a very significant way. Moreover, addressing spurious singularities of the employed reduction identities by means of simple expansions in rank-two Gram determinants, we achieve a remarkably high level of numerical stability. These features of the new algorithm, which will be made publicly available in a forthcoming release of the OpenLoops program, are particularly attractive for NLO multi-leg and NNLO real-virtual calculations.

Statistics

Citations

Dimensions.ai Metrics
17 citations in Web of Science®
19 citations in Scopus®
Google Scholar™

Altmetrics

Downloads

0 downloads since deposited on 13 Feb 2020
6 downloads since 12 months

Additional indexing

Item Type:Journal Article, refereed, original work
Communities & Collections:07 Faculty of Science > Physics Institute
Dewey Decimal Classification:530 Physics
Uncontrolled Keywords:Physics and Astronomy (miscellaneous), Engineering (miscellaneous)
Language:English
Date:1 January 2018
Deposited On:13 Feb 2020 12:09
Last Modified:13 Feb 2020 12:20
Publisher:Springer
ISSN:1434-6044
OA Status:Gold
Free access at:Publisher DOI. An embargo period may apply.
Publisher DOI:https://doi.org/10.1140/epjc/s10052-018-5562-1
Related URLs:https://www.zora.uzh.ch/id/eprint/159960/

Download

Gold Open Access

Download PDF  'On-the-fly reduction of open loops'.
Preview
Content: Published Version
Filetype: PDF
Size: 2MB
View at publisher
Licence: Creative Commons: Attribution 4.0 International (CC BY 4.0)