Related papers: FIESTA 2: parallelizeable multiloop numerical calc…
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…
Methods developed by the Bielefeld-DESY-Dubna collaboration in recent years are: DIANA (DIagram ANAlyser), a program to produce ``FORM input'' for Feynman diagrams, starting from the Feynman rules; methods to calculate scalar diagrams:…
The FEAST algorithm, due to Polizzi, is a typical contour-integral based eigensolver for computing the eigenvalues, along with their eigenvectors, inside a given region in the complex plane. It was formulated under the circumstance that the…
We report on a program for the numerical evaluation of divergent multi-loop integrals. The program is based on iterated sector decomposition. We improve the original algorithm of Binoth and Heinrich such that the program is guaranteed to…
An operator analogue of the FEAST matrix eigensolver is developed to compute the discrete part of the spectrum of a differential operator in a region of interest in the complex plane. Unbounded search regions are handled with a novel…
Lenstra's integer factorization algorithm is asymptotically one of the fastest known algorithms, and is ideally suited for parallel computation. We suggest a way in which the algorithm can be speeded up by the addition of a second phase.…
Some methods for the numerical computation of two-loop non-infrared vertices are reviewed. A new method is also proposed and compared to the old ones. Finally, some preliminary results are presented, concerning the evaluation of the…
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…
We introduce SOFIA, a Mathematica package that automatizes the computation of singularities of Feynman integrals, based on new theoretical understanding of their analytic structure. Given a Feynman diagram, SOFIA generates a list of…
We propose a novel method to compute multi-loop master integrals by constructing and numerically solving a system of ordinary differential equations, with almost trivial boundary conditions. Thus it can be systematically applied to problems…
In this paper we propose a product space reformulation to transform monotone inclusions described by finitely many operators on a Hilbert space into equivalent two-operator problems. Our approach relies on Pierra's classical reformulation…
Phase space cuts are implemented by inserting Heaviside theta functions in the integrands of momentum-space Feynman integrals. By directly parametrizing theta functions and constructing integration-by-parts (IBP) identities in the…
This paper describes algorithms to deal with nested symbolic sums over combinations of harmonic series, binomial coefficients and denominators. In addition it treats Mellin transforms and the inverse Mellin transformation for functions that…
Incremental computation aims to compute more efficiently on changed input by reusing previously computed results. We give a high-level overview of works on incremental computation, and highlight the essence underlying all of them, which we…
A purely numerical method, Direct ComputationMethod is applied to evaluate Feynman integrals. This method is based on the combination of an efficient numerical integration and an efficient extrapolation. In addition, high-precision…
In this paper, we describe a numerical approach to evaluate Feynman loop integrals. In this approach the key technique is a combination of a numerical integration method and a numerical extrapolation method. Since the computation is carried…
FISTA is a popular convex optimisation algorithm which is known to converge at an optimal rate whenever a minimiser is contained in a suitable Hilbert space. We propose a modified algorithm where each iteration is performed in a subset…
A scheme for systematically achieving accurate numerical evaluation of multi-loop Feynman diagrams is developed. This shows the feasibility of a project aimed to produce a complete calculation for two-loop predictions in the Standard Model.…
The FEAST library package represents an unified framework for solving various family of eigenvalue problems and achieving accuracy, robustness, high-performance and scalability on parallel architectures. Its originality lies with a new…
We present a review of the Bielefeld-Dubna activities on the multiloop calculations. In the first part a C-program DIANA (DIagram ANAlyser) for the automation of Feynman diagram evaluations is presented, in the second part various…