Finding linear dependencies in integration-by-parts equations: a Monte Carlo approach

From MaRDI portal
(Redirected from Publication:314201)




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.





Describes a project that uses

Uses Software





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)