Marcel Wittmann | Searcharxiv

arXiv2021

pfd-parallel, a Singular/GPI-Space package for massively parallel multivariate partial fractioning

Multivariate partial fractioning is a powerful tool for simplifying rational function coefficients in scattering amplitude computations. Since current research problems lead to large sets of complicated rational functions, performance of the partial fractioning as well as size of the obtained expressions are a prime concern. We develop a large scale parallel framework for multivariate partial fractioning, which implements and combines an improved version of Leinartas' algorithm and the {\sc MultivariateApart} algorithm. Our approach relies only on open source software. It combines parallelism over the different rational function coefficients with parallelism for individual expressions. The implementation is based on the \textsc{Singular}/\textsc{GPI-Space framework} for massively parallel computer algebra, which formulates parallel algorithms in terms of Petri nets. The modular nature of this approach allows for easy incorporation of future algorithmic developments into our package. We demonstrate the performance of our framework by simplifying expressions arising from current multiloop scattering amplitude problems.

hep-ph↗

arXiv2020

IBP reduction coefficients made simple

We present an efficient method to shorten the analytic integration-by-parts (IBP) reduction coefficients of multi-loop Feynman integrals. For our approach, we develop an improved version of Leinartas' multivariate partial fraction algorithm, and provide a modern implementation based on the computer algebra system Singular. Furthermore, We observe that for an integral basis with uniform transcendental (UT) weights, the denominators of IBP reduction coefficients with respect to the UT basis are either symbol letters or polynomials purely in the spacetime dimension $D$. With a UT basis, the partial fraction algorithm is more efficient both with respect to its performance and the size reduction. We show that in complicated examples with existence of a UT basis, the IBP reduction coefficients size can be reduced by a factor of as large as $\sim 100$. We observe that our algorithm also works well for settings without a UT basis.

hep-ph↗