Related papers: GPU Implementation of Zippel Method for Feynman In…
Integration-by-parts (IBP) reduction is one of the essential steps in evaluating Feynman integrals. A modern approach to IBP reduction uses modular arithmetic evaluations with parameters set to numerical values at sample points, followed by…
The reduction of Feynman integrals to master integrals is an algebraic problem that requires algorithmic approaches at the modern level of calculations. Straightforward applications of the classical Buchberger algorithm to construct…
An algorithm for the reduction of massive Feynman integrals with any number of loops and external momenta to a minimal set of basic integrals is proposed. The method is based on the new algorithm for evaluating tensor integrals,…
We introduce an algebro-geometrically motived integration-by-parts (IBP) reduction method for multi-loop and multi-scale Feynman integrals, using a framework for massively parallel computations in computer algebra. This framework combines…
The differential-reduction algorithm, which allows one to express generalized hypergeometric functions with parameters of arbitrary values in terms of such functions with parameters whose values differ from the original ones by integers, is…
We provide algorithms for symbolic integration of hyperlogarithms multiplied by rational functions, which also include multiple polylogarithms when their arguments are rational functions. These algorithms are implemented in Maple and we…
We describe how Groebner bases can be used to solve the reduction problem for Feynman integrals, i.e. to construct an algorithm that provides the possibility to express a Feynman integral of a given family as a linear combination of some…
An algorithm for the systematic analytical approximation of multi-scale Feynman integrals is presented. The algorithm produces algebraic expressions as functions of the kinematical parameters and mass scales appearing in the Feynman…
It was observed that hyperlogarithms provide a tool to carry out Feynman integrals. So far, this method has been applied successfully to finite single-scale processes. However, it can be employed in more general situations. We give examples…
The paper considers the problem of implementation on graphics processors of numerical integration routines for higher order finite element approximations. The design of suitable GPU kernels is investigated in the context of general purpose…
Feynman integral reduction by means of integration-by-parts identities is a major power gadget in a theorist toolbox indispensable for calculation of multiloop quantum effects relevant for particle phenomenology and formal theory alike. An…
Rational-function simplification is key bottlenecks in integration-by-parts (IBP) reduction of Feynman integrals. We study denominator factorization patterns appearing in IBP coefficients and develop practical algorithms for extracting and…
We address the problem of unambiguous reconstruction of rational functions of many variables. This is particularly relevant for recovery of exact expansion coefficients in integration-by-parts identites (IBPs) based on modular arithmetic.…
The Kernel Polynomial Method (KPM) is one of the fast diagonalization methods used for simulations of quantum systems in research fields of condensed matter physics and chemistry. The algorithm has a difficulty to be parallelized on a…
We present a historiographical review of algorithms and computer codes developed for solving integration-by-parts relations for Feynman integrals. This procedure is one of the key steps in the evaluation of Feynman integrals, since it…
We present a novel approach to optimizing the reduction of Feynman integrals using integration-by-parts identities. By developing a priority function through the FunSearch algorithm, which combines large language models and genetic…
In the computation of Feynman integrals which evaluate to multiple polylogarithms one encounters quite often square roots. To express the Feynman integral in terms of multiple polylogarithms, one seeks a transformation of variables, which…
We present a new method for the reconstruction of rational functions through finite-fields sampling that can significantly reduce the number of samples required. The method works by exploiting all the independent linear relations among…
Integration By Parts (IBP) is an important method for computing Feynman integrals. This work describes a formulation of the theory involving a set of differential equations in parameter space, and especially the definition and study of an…
The Poisson-Nernst-Planck (PNP) equations are one of the most effective model for describing electrostatic interactions and diffusion processes in ion solution systems, and have been widely used in the numerical simulations of biological…