Efficient algorithm for perturbative calculation of multi-loop Feynman integrals

DOI10.1016/S0375-9601(00)00199-7zbMATH Open1115.81370arXivquant-ph/9909017MaRDI QIDQ997848FDOQ997848

Authors: B. Kastening, Hagen Kleinert 

Publication date: 8 August 2007

Published in: Physics Letters. A (Search for Journal in Brave)

Abstract: We present an efficient algorithm for calculating multiloop Feynman integrals perturbatively.

Full work available at URL: https://arxiv.org/abs/quant-ph/9909017

Mathematics Subject Classification ID

Feynman diagrams (81T18) Software, source code, etc. for problems pertaining to quantum theory (81-04)

Cited In (7)

• Efficient algorithm for computing QFT bounds
• Threshold expansion of Feynman diagrams within a configuration space technique.
• Algebraic-numerical evaluation of Feynman diagrams: two-loop self-energies
• Algorithm FIRE-Feynman integral reduction
• Algorithms for minimal Picard-Fuchs operators of Feynman integrals
• FIESTA5: numerical high-performance Feynman integral evaluation
• All orders structure and efficient computation of linearly reducible elliptic Feynman integrals

This page was built for publication: Efficient algorithm for perturbative calculation of multi-loop Feynman integrals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q997848)