Finding linear dependencies in integration-by-parts equations: a Monte Carlo approach
From MaRDI portal
Publication:314201
DOI10.1016/J.CPC.2014.01.017zbMATH Open1344.81020arXiv1309.7287OpenAlexW1992245008MaRDI QIDQ314201
Author name not available (Why is that?)
Publication date: 13 September 2016
Published in: (Search for Journal in Brave)
Abstract: The reduction of a large number of scalar integrals to a small set of master integrals via Laporta's algorithm is common practice in multi-loop calculations. It is also a major bottleneck in terms of running time and memory consumption. It involves solving a large set of linear equations where many of the equations are linearly dependent. We propose a simple algorithm that eliminates all linearly dependent equations from a given system, reducing the time and space requirements of a subsequent run of Laporta's algorithm.
Full work available at URL: https://arxiv.org/abs/1309.7287
No records found.
No records found.
This page was built for publication: Finding linear dependencies in integration-by-parts equations: a Monte Carlo approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q314201)
