Related papers: How to choose master integrals
In this paper, we present a generalized version of the matrix chain algorithm to generate efficient code for linear algebra problems, a task for which human experts often invest days or even weeks of works. The standard matrix chain problem…
We present a Mathematica package which finds a basis of master integrals for the Feynman integral reduction. In this basis the dependence on the dimensional regularization in the denominators factorizes in kinematic independent polynomials.
Deriving a comprehensive set of reduction rules for Feynman integrals has been a longstanding challenge. In this paper, we present a proposed solution to this problem utilizing generating functions of Feynman integrals. By establishing and…
FIRE is a program performing reduction of Feynman integrals to master integrals. The C++ version of FIRE was presented in 2014. There have been multiple changes and upgrades since then including the possibility to use multiple computers for…
Intersection numbers are rational scalar products among functions that admit suitable integral representations, such as Feynman integrals. Using these scalar products, the decomposition of Feynman integrals into a basis of linearly…
We present a new program package for calculating one-loop Feynman integrals, based on a new method avoiding Feynman parametrization and the contraction due to Passarino and Veltman. The package is calculating one-, two- and three-point…
Iterative refinement (IR) is a popular scheme for solving a linear system of equations based on gradually improving the accuracy of an initial approximation. Originally developed to improve upon the accuracy of Gaussian elimination,…
Since Feynman integrals (FIs) at higher spacetime dimensions are free of infrared and collinear divergence--and their ultraviolet divergences can be systematically subtracted--this allows us to construct a wide range of locally finite…
Lifted Reed-Solomon codes are a natural affine-invariant family of error-correcting codes which generalize Reed-Muller codes. They were known to have efficient local-testing and local-decoding algorithms (comparable to the known algorithms…
This is a sequel of our previous paper where we described an algorithm to find a solution of differential equations for master integrals in the form of an $\epsilon$-expansion series with numerical coefficients. The algorithm is based on…
The study of Feynman integrals through the lens of intersection theory offers a unifying framework for their analysis, capturing both the linear and quadratic relations that arise among integrals. In doing so, it provides a powerful method…
The technique of decomposing Feynman diagrams at the one loop level into elementary integrals is generalized to the imaginary time Matsubara formalism. The three lowest integrals, containing one, two and three fermion lines, are provided in…
It is often useful to perform integration over learned functions represented by neural networks. However, this integration is usually performed numerically, as analytical integration over learned functions (especially neural networks) is…
The Riemann-Liouville formula for fractional derivatives and integrals (differintegration) is used to derive formulae for matrix order derivatives and integrals. That is, the parameter for integration and differentiation is allowed to…
In this paper we develop further and refine the method of differential equations for computing Feynman integrals. In particular, we show that an additional iterative structure emerges for finite loop integrals. As a concrete non-trivial…
In a recent paper \cite{ft} a new powerful method to calculate Feynman diagrams was proposed. It consists in setting up a Taylor series expansion in the external momenta squared. The Taylor coefficients are obtained from the original…
The ideas behind the concept of algebraic ("integration-by-parts") algorithms for multiloop calculations are reviewed. For any topology and mass pattern, a finite iterative algebraic procedure is proved to exist which transforms the…
We present an algorithm for the optimization of a class of finite element integration loop nests. This algorithm, which exploits fundamental mathematical properties of finite element operators, is proven to achieve a locally optimal…
We review the Laporta algorithm for the reduction of scalar integrals to the master integrals and the differential equations technique for their evaluation. We discuss the use of the basis of harmonic polylogarithms for the analytical…
Quantum algorithm is an algorithm for solving mathematical problems using quantum systems encoded as information, which is found to outperform classical algorithms in some specific cases. The objective of this study is to develop a quantum…