SAMURAI Francesco Tramontano CERN Theory Group work done in - - PowerPoint PPT Presentation

samurai
SMART_READER_LITE
LIVE PREVIEW

SAMURAI Francesco Tramontano CERN Theory Group work done in - - PowerPoint PPT Presentation

One loop calculations with SAMURAI Francesco Tramontano CERN Theory Group work done in collaboration with P. Mastrolia, G. Ossola and T. Reiter FIRENZE HP2.3 14/09/2010 OVERVIEW Introduction Methods Running SAMURAI


slide-1
SLIDE 1

One loop calculations with SAMURAI

Francesco Tramontano CERN Theory Group

work done in collaboration with

  • P. Mastrolia, G. Ossola and T. Reiter

FIRENZE – HP2.3 – 14/09/2010

slide-2
SLIDE 2

OVERVIEW

  • Introduction
  • Methods
  • Running SAMURAI
  • Examples
  • Conclusions and outlook
slide-3
SLIDE 3

Introduction

slide-4
SLIDE 4

 LHC successfully started collisions at 7 TeV on March 30th 2010  The need of Next to Leading Order multi-particle scattering predictions is more pressing  New ideas in the field

  • f loop corrections

give the possibility to perform the automatic generation of NLO predictions for multi-leg processes

slide-5
SLIDE 5

Analytic calculations; Analytic calculations;

 W/Z/γ+ 2jets Bern et al (1998)  H + 2jets (eff. coupling) Badger, Berger, Campbell, Del Duca, Dixon, Ellis, Glover, Mastrolia, Risager, Sofianatos, Williams (2006-2009)

Numerical calculations: Numerical calculations:

 EW corr. e+e- > 4 fermions Denner and Dittmaier (2005)  pp > W + 3jets Ellis et al, Berger et al (2009)  pp > Z + 3jets Berger et al (2009)  pp > ttbb Bredenstein et al, Bevilacqua et al (2009)  pp > tt +2jets Czakon et al (2010)  pp > 4b Binoth et al (2010)

Status of the art

We combined some of the recent techniques into a new computer program we called SAMURAI

SAMURAI

slide-6
SLIDE 6

Basic features of SAMURAI:

Scattering AM AMplitudes from Unitarity based Reduction Algorithm at the Integrand-level

 Is a fortran90 library for the calculation of the one loop corrections downloadable at the URL: www.cern.ch/samurai  Main purpose was to provide a flexible and easy to use tool for the evaluation of the virtual corrections  It works with any number/kind of legs  Can process integrands written either as numerator of Feynman diagrams or as product of tree level amplitudes  Rational terms are produced/processed together with the cut-constructible one

slide-7
SLIDE 7

And further:

 SAMURAI SAMURAI can be compiled in 2x 2x or 4x 4x precision, a version working in multiple precision is available

  • n request

 It has a modular modular structure that allows for quick local updates  It could also be useful to perform fast numerical numerical check check of analytic results  Details and examples of applications can be found in arXiv:1006.0710 1006.0710

slide-8
SLIDE 8

Methods

slide-9
SLIDE 9

SAMURAI SAMURAI: a numeri : a numerical implemen cal implementation tation

  • f the
  • f the OPP/D

OPP/D-dimensiona dimensional generalize generalized d unitarit unitarity cuts techn y cuts technique ique

 OPP polynomials (n-ple cut, n=1,2,3,4) extended to the framework of D-dim unitarity [Ellis, Giele, Kunszt, Melnikov]  5-ple cut residue depending only on mu2 [Melnikov, Schultze]  Integrand sampling with DFT for 3-ple and 2-ple cuts [Mastrolia, Ossola, Papdopoulos, Pittau]

slide-10
SLIDE 10

 Any amplitude can be expressed as a linear combination of scalar integrals: boxes, triangles, bubbles, tadpoles plus rational terms  At integrand level the structure is enriched by polynomial terms that integrate to zero  The power of the OPP method is the fact that for each phase space point the only requirement for the reduction is the knowledge of the numerical value of the numerator function N for a finite set of values of the loop momentum variable, solutions of the multiple cut conditions

OPP OPP integrand integrand decompositio decomposition: : 4-dim dim

slide-11
SLIDE 11

Extensio Extension to to D-dim dim

 Once fixed a parametrization for the loop momentum in terms of a linear combination of known four-vectors (p0, ei) the vanishing term are polynomials of xi and mu2  The problem is to fit the coefficients of the Δ-polynomials For example the 3-ple cut residue (function of the unfrozen components) reads:

slide-12
SLIDE 12

5-ple ple cut cut residue residue

Linear dependence Best choice;  avoid scalar pentagon decomposition  avoid pentagon subtraction for tadpoles  numerically more stable

slide-13
SLIDE 13

Numerical Sampling

  • straightforward extension to multi-variate DFT projection
  • Sampling on different circles for stable solutions
  • number of the integrand samplings = number of the unknowns
  • dynamical mu2-sampling

 Cut-5; completely frozen  Cut-4; mu2 sampling  Cut-3,2: mu2 sampling + DFT:  Cut-1: trivial

slide-14
SLIDE 14

Amplitud Amplitudes & es & Master I Master Integrals ntegrals

The sources of rational terms are the integrals with mu2 powers in the numerator They are generated by the reduction algorithm, but could also be present ab initio in the numerator function as a consequence of the algebraic manipulations

slide-15
SLIDE 15

Running SAMURAI

slide-16
SLIDE 16

calls:

A dedicated module (kinematic) is also available in the release that contains useful functions to evaluate:

 Polarization vectors for massless vectors  Scalar and spinor products with both real and complex four vectors as arguments

slide-17
SLIDE 17

 imeth = ‘diag’for an integrand given as numerator

  • f a Feynman diagram

‘tree’for an integrand given as the product of tree level amplitudes  isca = 1, scalar integrals evaluated with the QCDLoop package (Ellis and Zanderighi) 2, scalar integrals evaluated with the AVH-OLO package (van Hameren)  verbosity = 0, nothing is printed by the reduction 1, the coefficients are printed out 2, also the value of the MI are printed out 3, also the results of the tests are printed out  itest = 0, none test 1, global n=n test is performed (not avail. for imeth=‘tree’) 2, local n=n test is performed 3, power test is performed (not avail. for imeth=‘tree’) new – based on the mismatch of the polynomial degree of the given integrand and the reconstructed one

slide-18
SLIDE 18

msq(0) msq(1) msq(2) msq(3) Pi(0,:)=v0 Pi(1,:)=v1 Pi(2,:)=v2 Pi(3,:)=v3

Optionally, to fill the denominators Optionally, to fill the denominators

Denominator(j) = [ q + Pi(j,:) ]^2 – mu2 – msq(j) nleg is the number

  • f legs attached

to the loop

slide-19
SLIDE 19

 xnum [i]= the name of the function to reduce with arguments xnum(cut, q, mu2) for imeth=tree the cut play a selective role to use the relative tree product  tot [o] = contains the result of the reduction convoluted with the MI  totr [o]= contains the rational part only  rank [i] = the rank of the numerator, useful to speed up the reduction  istop [i] = when stop the reduction, i.e. after pentuple cut (5) quadruple (4)…  scale2 [i] = the value of the renormalization scale (square) 

  • k [o] = a logical variable giving the result of the test if they are evaluated
slide-20
SLIDE 20

About the precision

 Gram Determinant -> induce large cancellations between contributions from the MI that carry such a factor (the tests coded in SAMURAI detect the associated instabilities)  Big cancellations between diagrams -> on-shell methods seems to be the best option  If running with big internal masses -> big cancellations between cut-constructible and rational part

Quadruple precision solves these issues For numerical studies and checks SAMURAI compiles also in quad

slide-21
SLIDE 21

4 SYSTEMS SYSTEMS

A simple A simple option to t

  • ption to treat instabi

reat instabilities: lities:

switch to a switch to a Tensorial Tensorial Reconstruction paired with an Reconstruction paired with an efficient numerical evaluation of tensor integrals efficient numerical evaluation of tensor integrals Level Level-0 Level Level-1

………… …………………… Sampling monomial with Sampling monomial with

  • ne component of q
  • ne component of q

[with G. Heinrich, G. Ossola, T. Reiter (2010)]

slide-22
SLIDE 22

Level Level-2

………… ……………………

Level Level-3

………… …………………… Sampling monomial with Sampling monomial with two components of q two components of q Sampling monomial with Sampling monomial with three components of q three components of q

6 SYSTEMS SYSTEMS 4 SYSTEMS SYSTEMS

slide-23
SLIDE 23

Level Level-4 mu2 mu2-part part

BUBBLE BUBBLE: TRIENG TRIENGLE: LE: BOX: BOX:

Sampling monomial with Sampling monomial with four components of q four components of q

1 SYSTEM SYSTEM

 Once reconstructed tensors that does not involve mu2, <N(q)>, Once reconstructed tensors that does not involve mu2, <N(q)>,

  • ne can subtract it and sample the rest as above taking mu2.ne.0
  • ne can subtract it and sample the rest as above taking mu2.ne.0

 Not all components relevant Not all components relevant  For several diagrams the mu2 part can be inferred from <N(q)> For several diagrams the mu2 part can be inferred from <N(q)>

slide-24
SLIDE 24

Example: Example:

Standard(double): Standard(double): 2x SAMURAI 2x SAMURAI Standard(quadruple): Standard(quadruple): 2x Kin + integrals 2x Kin + integrals 4x Algorithm 4x Algorithm Tensorial Tensorial(double): (double): Reconstruction paired Reconstruction paired with numerical evaluation with numerical evaluation

  • f tensor
  • f tensor integras

integras with with GOLEM95 GOLEM95

slide-25
SLIDE 25

Also use Also useful for: ful for:

 Speed Speed up the computation up the computation if the numerator has if the numerator has a a long long expression: added time for expression: added time for tensorial tensorial reconstruct reconstruct compensated by a faster reduction compensated by a faster reduction

 Ex Example ample; dummy dummy numera numerator of tor of one 1

  • ne 1ine of

ine of code code sittin sitting on 6 g on 6 denom denominator inators and and re repeated peated N tim N times es

 Real Real loop variable loop variable match well with the automatic match well with the automatic generation generation of integrand directly from tree level

  • f integrand directly from tree level

generators generators like like MadGraph MadGraph and HELAC and HELAC

slide-26
SLIDE 26

Examples

slide-27
SLIDE 27

Note Note:

Are chosen to address typical technical issues that one encounter performing one loop virtual calculation The aim is to show the flexibility of the framework Are part of the release and could also be used as templates for other calculations

slide-28
SLIDE 28

4-photons photons

Results numerically checked vs. Gounaris et al (1999)

  • imeth=‘diag’
  • nleg = 4, rank = 4
  • 6 permutations, only 3 relevant
  • mu2 terms give zero contribution
  • mu2 qαqβ cancel in the sum
  • mu22 gives rise to the correct rational part

L1 p1 p2 L2 L3 L4 p3 p4 Denominators:

slide-29
SLIDE 29

6-photons photons

Results numerically checked vs. Bernicot et al (2007,2008)

Bernicot et al (2007,2008) SAMURAI with istop=2 SAMURAI with istop=3, subtracting totr

  • imeth =‘diag’
  • nleg = 6, rank = 6
  • 120 permutations, only 60 relevant

PS point as in Nagy and Soper (2006)

slide-30
SLIDE 30

8-photons photons

MHV result numerically checked vs. Mahlon (1993)

  • imeth =‘diag’
  • nleg = 8, rank = 8
  • 5040 permutations, only 2520 relevant
  • sampling set as in Gong et al (2008)
slide-31
SLIDE 31

8-photons photons

NMHV result (new) numerically confirm the structure

in Badger et al (2009) The points in quadruple precision (x) have been calculated with istop=2, i.e. retaining all the cut constructible and rational pieces

  • imeth =‘diag’
  • nleg = 8, rank = 8
  • 5040 permutations, only 2520 relevant
  • sampling set as in Gong et al (2008)
slide-32
SLIDE 32

8-photons photons

NN NNMHV MHV result (new) numerically confirm the structure

in Badger et al (2009) The points in quadruple precision (x) have been calculated with istop=2, i.e. retaining all the cut constructible and rational pieces

  • imeth =‘diag’
  • nleg = 8, rank = 8
  • 5040 permutations, only 2520 relevant
  • sampling set as in Gong et al (2008)
slide-33
SLIDE 33

Drell rell-Yan an

Denominators:

If one want to consider regularization schemes giving rise to O(ε) terms and reduce them, then

  • ne needs to process N0 and N1 below separately

d=4 -> Dim Red d=4-2ε -> CDR

  • imeth =‘diag’
  • nleg = 3, rank = 2
  • msq = { 0, 0, 0}
  • Pi = { 0, pu, pu + pe- + pe+ }
  • N1 generate a rational term = - gs

2 CF LO

slide-34
SLIDE 34

VB+1 B+1j: : leading color

leading color

Results numerically checked vs. Bern et al (1997)

  • imeth =‘diag’
  • 1 Box nleg=4, rank=3

4 Tri nleg=3, rank=2 2 Bub nleg=2, rank=1

  • Diagrams can be collected on a common

box denominator

  • Studing Left-handed current needs of

a prescription for gamma5: adopting DR w/anticommuting gamma5 we added –Nc/2 times the Tree Level amplitude

slide-35
SLIDE 35

6q amplitud q amplitudes es

Fortran Code generation completely automated thanks to an infrastructure derived from Golem-2.0

8 he 8 hexago xagons ns 24 24 pen pentagons tagons 42 42 box boxes es 70 70 tri triangles angles 114 bu 114 bubble bbles

  • 25

258 Feyn 8 Feynman Di man Diagrams agrams

slide-36
SLIDE 36

6q amplitud q amplitudes es

  • A(-+-+-+)
  • ren scale = 1GeV
  • uv renormalization included

GOLEM GOLEM-2.0 + GOLEM95 2.0 + GOLEM95 GOLEM GOLEM-2.0 + SAMURAI 2.0 + SAMURAI Infrared poles calculated Infrared poles calculated from the integrated dipoles from the integrated dipoles

Automa Automatic tic gene generated rated fort fortran ran code code based based on

  • n SAMU

SAMURAI RAI redu reduction ction more more th then en 10 tim 10 times s es short horter and er and faster faster alread already y wi withou thout any t any opti

  • ptimiza

mization tion

slide-37
SLIDE 37

6q amplitud q amplitudes es Differen Difference between t ce between the single (d he single (double)

  • uble)

virtual virtual poles and th poles and those of the i

  • se of the integrated

ntegrated dipoles dipoles for 10^5 pha for 10^5 phase space poi se space points nts

8 . 5 . 2 | | 30     R GeV pT 

slide-38
SLIDE 38

5 and and 6-gluons all p gluons all plus: lus: massive scalar loop

massive scalar loop

numerically checked vs. S. Badger’s table

For thi For this hel s helicity c icity choice hoice the res the result i ult is purel s purely rat y rational ional

  • imeth=‘tree’
  • nleg = 6, rank = 6
slide-39
SLIDE 39

Conclusions Conclusions

  • SAMURAI is a fortran library for the automatic

evaluation of the NLO virtual correction to scattering processes, once the integrand is given in the form of Feynman diagrams or as products of tree level amplitudes

  • We produced several examples to show its main features
  • We tried to make things as effective and simple as

possible to allow for interfaces with other tools

  • We provided also a ‚rescue system‛ pairing a

tensorial reconstruction to the numerical evaluation

  • f tensor integrals with GOLEM95 (with G. Heinrich)
  • SAMURAI is mature for physical implementations!