Related papers: IBP reduction coefficients made simple
Polynomial multiplication is a fundamental problem in symbolic computation. There are efficient methods for the multiplication of two univariate polynomials. However, there is rarely efficiently nontrivial method for the multiplication of…
We present a novel algorithm which can overcome the drawbacks of the conventional linear scaling method with minimal computational overhead. This is achieved by introducing additional constraints, thus eliminating the redundancy of the…
We present an extension of the summation-by-parts (SBP) framework to tensor-product spectral-element operators in collapsed coordinates. The proposed approach enables the construction of provably stable discretizations of arbitrary order…
In this paper we describe algorithms for computing the BWT and for building (compressed) indexes in external memory. The innovative feature of our algorithms is that they are lightweight in the sense that, for an input of size $n$, they use…
In this article, we present a new implementation of the Laporta algorithm to reduce scalar multi-loop integrals---appearing in quantum field theoretic calculations---to a set of master integrals. We extend existing approaches by using an…
In this work we propose an efficient and accurate multi-scale optical simulation algorithm by applying a numerical version of slowly varying envelope approximation in FEM. Specifically, we employ the fast iterative method to quickly compute…
We propose a method to decrease the number of hidden units of the restricted Boltzmann machine while avoiding decrease of the performance measured by the Kullback-Leibler divergence. Then, we demonstrate our algorithm by using numerical…
Using the method of uniqueness a two-loop massless propagator Feynman diagram with a non-integer index on the central line is evaluated in a very transparent way. The result is applied to the computation of the two-loop polarization…
FIRE is a program which performs integration-by-parts (IBP) reduction of Feynman integrals. Originally, the C++ version of FIRE relies on the computer algebra system Fermat by Robert Lewis to simplify rational functions. We present an…
There is currently a high demand for theoretical predictions for processes at next-to-next-to-leading order (NNLO) and beyond, mainly due to the large amount of data which has already been collected at LHC. This requires practical methods…
Recently a nice work about the understanding of one-loop integrals has been done in [1] using the tricks of the projective space language associated to their Feynman parametrization. We find this language is also very suitable to deal with…
Gradient descent method, as one of the major methods in numerical optimization, is the key ingredient in many machine learning algorithms. As one of the most fundamental way to solve the optimization problems, it promises the function value…
We present a novel technique for the analytic evaluation of multifold Mellin-Barnes (MB) integrals, which commonly appear in physics, as for instance in the calculations of multi-loop multi-scale Feynman integrals. Our approach is based on…
We present a new method for numerically computing generic multi-loop Feynman integrals. The method relies on an iterative application of Feynman's trick for combining two propagators. Each application of Feynman's trick introduces a…
We propose a new set of Master Integrals which can be used as a basis for certain multiloop calculations in massless gauge field theories. In these theories we consider three-point Feynman diagrams with arbitrary number of loops. The…
The method for functional reduction of Feynman integrals, proposed by the author, is used to calculate one-loop integrals corresponding to diagrams with four external lines. The integrals that emerge from amplitudes for the scattering of…
This paper develops new combinatorial approaches to analyze and compute special set partitions, called complementary set partitions, which are fundamental in the study of generalized cumulants. Moving away from traditional graph-based and…
Over the last year significant progress was made in the understanding of the computation of Feynman integrals using differential equations. These lectures give a review of these developments, while not assuming any prior knowledge of the…
In this paper, we suggest a new efficient algorithm in order to compute S-polynomial reduction rapidly in the known algorithm for computing Grobner bases, and compare the complexity with others.
Message-passing algorithms based on belief-propagation (BP) are successfully used in many applications including decoding error correcting codes and solving constraint satisfaction and inference problems. BP-based algorithms operate over…