Related papers: A simple method for multi-leg loop calculations
In this paper, we focus on developing randomized algorithms for the computation of low multilinear rank approximations of tensors based on the random projection and the singular value decomposition. Following the theory of the singular…
The computational cost associated with reducing tensor integrals to scalar integrals using the Passarino-Veltman method is dominated by the diagonalisation of large systems of equations. These systems of equations are sized according to the…
We introduce tensor numerical techniques for solving optimal control problems constrained by elliptic operators in $\mathbb{R}^d$, $d=2,3$, with variable coefficients, which can be represented in a low rank separable form. We construct a…
Tensors play a central role in many modern machine learning and signal processing applications. In such applications, the target tensor is usually of low rank, i.e., can be expressed as a sum of a small number of rank one tensors. This…
Building on the open-loop algorithm we introduce a new method for the automated construction of one-loop amplitudes and their reduction to scalar integrals. The key idea is that the factorisation of one-loop integrands in a product of loop…
Recently, the concept of generating function has been employed in one-loop reduction. For one-loop integrals encompassing arbitrary tensor ranks and higher-pole contributions, the generating function can be decomposed into a tensor part and…
Calculation of amplitudes in perturbative quantum field theory involve large loop integrals. The complexity of those integrals, in combination with the large number of Feynman diagrams, make the calculations very difficult. Reduction…
We discuss briefly the first numerical implementation of the Loop-Tree Duality (LTD) method. We apply the LTD method in order to calculate ultraviolet and infrared finite multi-leg one-loop Feynman integrals. We attack scalar and tensor…
We set up a new, flexible approach for the tensor reduction of one-loop Feynman integrals. The 5-point tensor integrals up to rank R=5 are expressed by 4-point tensor integrals of rank R-1, such that the appearance of the inverse 5-point…
In a recent paper we have presented an automated subtraction method for divergent multi-loop/leg integrals in dimensional regularisation which allows for their numerical evaluation, and applied it to diagrams with massless internal lines.…
One of the main issues in computing a tensor decomposition is how to choose the number of rank-one components, since there is no finite algorithms for determining the rank of a tensor. A commonly used approach for this purpose is to find a…
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.…
We report on the progress in constructing contracted one-loop tensors. Analytic results for rank R=4 tensors, cross-checked numerically, are presented for the first time.
By adding entropic regularization, multi-marginal optimal transport problems can be transformed into tensor scaling problems, which can be solved numerically using the multi-marginal Sinkhorn algorithm. The main computational bottleneck of…
In recent studies, the tensor ring (TR) rank has shown high effectiveness in tensor completion due to its ability of capturing the intrinsic structure within high-order tensors. A recently proposed TR rank minimization method is based on…
We propose a new numerical algorithm for computing the tensor rank decomposition or canonical polyadic decomposition of higher-order tensors subject to a rank and genericity constraint. Reformulating this computational problem as a system…
A detailed investigation is presented of a set of algorithms which form the basis for a fast and reliable numerical integration of one-loop multi-leg (up to six) Feynman diagrams, with special attention to the behavior around (possibly)…
Recently, there has been a growing interest in efficient numerical algorithms based on tensor networks and low-rank techniques to approximate high-dimensional functions and solutions to high-dimensional PDEs. In this paper, we propose a new…
Feynman integral reduction based on intersection theory provides an alternative to the traditional integration-by-parts method, yet its practical application has been constrained by the large number of variables required in the computation.…
One remaining problem of unitarity cut method for one-loop integral reduction is that tadpole coefficients can not be straightforward obtained through this way. In this paper, we reconsider the problem by applying differential operators…