A novel approach to integration by parts reduction

2014/06/30 by Andreas von Manteuffel, Robert M. Schabinger · 4 citations
Physics and Astronomy · Computer Science · #hep-ph #cs.SC #hep-th

paper · pdf · doi:10.1016/j.physletb.2015.03.029

4 pages. Version 2 is the final, published version of this article

arxiv created 2015/09/21 · arxiv updated 2015/09/22

Abstract

Integration by parts reduction is a standard component of most modern multi-loop calculations in quantum field theory. We present a novel strategy constructed to overcome the limitations of currently available reduction programs based on Laporta's algorithm. The key idea is to construct algebraic identities from numerical samples obtained from reductions over finite fields. We expect the method to be highly amenable to parallelization, show a low memory footprint during the reduction step, and allow for significantly better run-times.

Cited by

• Analytic reconstruction with massive particles: one-loop amplitudes for 0 → qqttH
• Reduction of ε-expanded Feynman integrals
• Reinforcement Learning and Metaheuristics for Feynman Integral Reduction
• Two-loop Feynman integrals for leading colour ttW production at hadron colliders

Related

• Kira - A Feynman Integral Reduction Program
• Efficient reduction of Feynman integrals on supercomputers
• SIRENA -- Sum-Integral REductioN Algorithm
• NeatIBP 1.0, A package generating small-size integration-by-parts relations for Feynman integrals
• Reinforcement Learning and Metaheuristics for Feynman Integral Reduction