Today’s algorithm for computation of loop corrections

21
Today’s algorithm for computation of loop correctio Dim. reg. Graph generation QGRAF, GRACE, FeynArts Reduction of integrals IBP id., Tensor red. Evaluation of Master integrals Diff. eq., Mellin-Barnes, sector decomp Lots of mathem

description

Today’s algorithm for computation of loop corrections. Dim. reg. Graph generation QGRAF, GRACE, FeynArts Reduction of integrals IBP id., Tensor red. Evaluation of Master integrals Diff. eq., Mellin -Barnes, sector decomp . Lots of mathematics. Reduction of loop integrals to - PowerPoint PPT Presentation

Transcript of Today’s algorithm for computation of loop corrections

Page 1: Today’s  algorithm for computation  of loop corrections

Today’s algorithm for computation of loop corrections

• Dim. reg.

• Graph generation QGRAF, GRACE, FeynArts

• Reduction of integrals IBP id., Tensor red.

• Evaluation of Master integrals Diff. eq., Mellin-Barnes, sector decomp.

Lots of mathematics

Page 2: Today’s  algorithm for computation  of loop corrections

Y. Sumino(Tohoku Univ.)

Reduction of loop integrals tomaster integrals

Page 3: Today’s  algorithm for computation  of loop corrections

Loop integrals in standard form

Express each diagram in terms of standard integrals

1 loop

2 loop

3 loop

Each can be represented by a lattice site in N-dim. space

NB: is negative, when representing a numerator.

e.g. A diagram for QCD potential

Page 4: Today’s  algorithm for computation  of loop corrections

Integration-by-parts (IBP) Identities

In dim. reg.

Ex. at 1-loop:

Chetyrkin, Tkachov

Page 5: Today’s  algorithm for computation  of loop corrections

O

(3-loop)21-dim. space

Reduction by Laporta algorithm

Page 6: Today’s  algorithm for computation  of loop corrections

O

(3-loop)21-dim. space

Reduction by Laporta algorithm

Page 7: Today’s  algorithm for computation  of loop corrections

O

(3-loop)21-dim. space

Reduction by Laporta algorithm

Page 8: Today’s  algorithm for computation  of loop corrections

O

(3-loop)21-dim. space

Reduction by Laporta algorithm

Page 9: Today’s  algorithm for computation  of loop corrections

O

(3-loop)21-dim. space

Reduction by Laporta algorithm

Page 10: Today’s  algorithm for computation  of loop corrections

O

(3-loop)21-dim. space

Reduction by Laporta algorithm

Page 11: Today’s  algorithm for computation  of loop corrections

O

(3-loop)21-dim. space

Reduction by Laporta algorithm

Page 12: Today’s  algorithm for computation  of loop corrections

(3-loop)21-dim. space

O

Reduction by Laporta algorithm

Page 13: Today’s  algorithm for computation  of loop corrections

O

(3-loop)21-dim. space

Reduction by Laporta algorithm

Page 14: Today’s  algorithm for computation  of loop corrections

O

(3-loop)21-dim. space

Master integrals

Reduction by Laporta algorithm

Page 15: Today’s  algorithm for computation  of loop corrections

O

Evolution in12-dim. subspace

Out of only 12 ofthem are linearly independent.

An improvement

Page 16: Today’s  algorithm for computation  of loop corrections

+ + =0× 1𝐷1𝐷2𝐷3𝐷4

× 1𝐷1

Linearly dependent propagator denominators

1 loop case:

;

loop momentum external momentum, only up to 4 independent ones.

4 master integrals(well known)

Use to reduce the number of Di’s.

Page 17: Today’s  algorithm for computation  of loop corrections

In the case of QCD potential

1 loop: 1 master integral

2 loop: 5 master integrals

3 loop: 40 master integrals

𝑞

Page 18: Today’s  algorithm for computation  of loop corrections

More about implementation of Laporta alg. cf. JHEP07(2004)046

IBP ids = A huge system of linear eqs.

Laporta alg. = Reduction of complicated loop integrals to a small set of simpler integrals via Gauss elimination method.

1. Specify complexity of an integrala. More Di’s

b. More positive powers of Di’sc. More negative powers of Di’s

2. Rewrite complicated integrals by simpler ones iteratively.

O

simpler

more complex

Page 19: Today’s  algorithm for computation  of loop corrections

Example of Step 2.

{(1) Solve in terms of

𝑧=−𝑥−2 𝑦⋯ (3 )

Substitute to (2):

𝑥− 𝑦+3 (−𝑥−2 𝑦 )=−2 𝑥+5 𝑦=0

∴ 𝑦=25 𝑥

Substitute to (3):

𝑧=−𝑥−2× 25 𝑥=− 95 𝑥

Thus, are expressed by .

Complexity: .

Pick one identity.

Apply all known reduction relations.

Solve the obtained eq for the most comlex variable.

Obtain a new reduction relation.

𝑥− 𝑦+3 𝑧=0

𝑥− 𝑦+3 (−𝑥−2 𝑦)=0

−2 𝑥+5 𝑦=0

𝑦=25 𝑥

Page 20: Today’s  algorithm for computation  of loop corrections

• Generalized unitarity (e.g. BlackHat, Njet, ...) [Bern, Dixon, Dunbar, Kosower, 1994...; Ellis Giele Kunst 2007 + Melnikov 2008; Badger...]• Integrand reduction (OPP method) (e.g. MadLoop (aMC@NLO),GoSam) [Ossola, Papadopoulos, Pittau 2006; del Aguila, Pittau 2004; Mastrolia, Ossola, Reiter,Tramontano 2010;...]• Tensor reduction (e.g. Golem, Openloops) [Passarino, Veltman 1979; Denner, Dittmaier 2005; Binoth Guillet, Heinrich, Pilon, Reiter 2008;Cascioli, Maierhofer, Pozzorini 2011;...]

New One-loop Computation Technologies (mainly for LHC)

Page 21: Today’s  algorithm for computation  of loop corrections

Improvement 2.

O

(1) Assign a numerical value to temporarily and complete reduction.

(2) Identify the necessary IBP identities and reorder them; Then reprocess the reduction with general .

Many inactive IBP id’s are generatedand solved in Laporta algorithm.

Manageable by a contemporary desktop/laptop PC