vix.ing · top · new · best · stats · spec

Subtraction scheme for next-to-next-to-leading order computations

2011/11/30 by Radja Boughezal, Kirill Melnikov, Frank Petriello · 2 citations
Engineering · Mathematics · Physics and Astronomy · #Algorithm #Arithmetic #Business #Computation #Computer science #Electromagnetic Scattering and Analysis #Electromagnetic Simulation and Numerical Methods #Mathematics #Numerical methods for differential equations #Order (exchange) #Parallel computing #Scheme (mathematics) #Subtraction #hep-ph

paper · pdf · doi:10.1103/physrevd.85.034025

13 pages

arxiv created 2011/11/30 · openalex publication_date 2012/02/14 · arxiv updated 2015/06/03 · openalex created_date 2016/06/24 · openalex updated_date 2026/08/05

Abstract

We use the known soft and collinear limits of tree- and one-loop scattering amplitudes---computed over a decade ago---to explicitly construct a subtraction scheme for next-to-next-to-leading order (NNLO) computations. Our approach combines partitioning of the final-state phase-space together with the technique of sector decomposition, following recent suggestions in Ref. [34]. We apply this scheme to a toy example: the NNLO QED corrections to the decay of the Z boson to a pair of massless leptons. We argue that the main features of this subtraction scheme remain valid for computations of processes of arbitrary complexity with NNLO accuracy.

Citations

Cited by