Related papers: Recursive reduction of two-loop tensor integrals
We calculate the complete set of two-loop Master Integrals with two off mass-shell legs with massless internal propagators, that contribute to amplitudes of diboson $V_1V_2$ production at the LHC. This is done with the Simplified…
The reduction of a large number of scalar integrals to a small set of master integrals via Laporta's algorithm is common practice in multi-loop calculations. It is also a major bottleneck in terms of running time and memory consumption. It…
An analytical-numeric calculation method of extremely complicated integrals is presented. These integrals appear often in magnet soliton theory. The appropriate analytical continuation and a corresponding integration contour allow to reduce…
Successive quadratic approximations, or second-order proximal methods, are useful for minimizing functions that are a sum of a smooth part and a convex, possibly nonsmooth part that promotes regularization. Most analyses of iteration…
This paper presents iterative methods for solving tensor equations involving the T-product. The proposed approaches apply tensor computations without matrix construction. For each initial tensor, these algorithms solve related problems in a…
We calculate analytically the two-loop triangle integrals entering the $\mathcal{O}(\alpha\alpha_s)$ corrections to the $HZV$ vertex with $V=Z^*,\gamma^*$ using the method of differential equations. Our result provides a prototype to study…
We discuss new ideas for consideration of loop diagrams and angular integrals in $D$-dimensions in QCD. In case of loop diagrams, we propose the covariant formalism of expansion of tensorial loop integrals into the orthogonal basis of…
The method introduced in a previous paper to simplify the tensorial reduction in multi-leg loop calculations is extended to generic one-loop integrals, with arbitrary internal masses and external momenta.
We propose a method for encoding iterators (and recursion operators in general) using interaction nets (INs). There are two main applications for this: the method can be used to obtain a visual nota- tion for functional programs; and it can…
We present master formulas for the divergent part of the one-loop effective action for an arbitrary (both minimal and nonminimal) operators of any order in the 4-dimensional curved space. They can be considered as computer algorithms,…
A method is presented in which matrix elements for some processes are calculated recursively. This recursive calculational technique is based on the method of basis spinors.
We review the current status of high-multiplicity double-virtual QCD corrections to processes relevant for LHC phenomenology. In particular, we discuss the recent full-color calculation of the five-parton process, whose two-loop amplitudes…
Tensor decompositions such as the canonical format and the tensor train format have been widely utilized to reduce storage costs and operational complexities for high-dimensional data, achieving linear scaling with the input dimension…
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…
We present the library Collier for the numerical evaluation of one-loop scalar and tensor integrals in perturbative relativistic quantum field theories. The code provides numerical results for arbitrary tensor and scalar integrals for…
We compute the complete set of two-loop master integrals for the scattering of four massless particles and a massive one. Our results are ready for phenomenological applications, removing a major obstacle to the computation of complete…
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…
In this paper we propose a new inexact dual decomposition algorithm for solving separable convex optimization problems. This algorithm is a combination of three techniques: dual Lagrangian decomposition, smoothing and excessive gap. The…
I will present a new method for thinking about and for computing loop integrals based on differential equations. All required information is obtained by algebraic means and is encoded in a small set of simple quantities that I will…
The rotation of multi-dimensional arrays, or tensors, is a fundamental operation in computer science with applications ranging from data processing to scientific computing. While various methods exist, achieving this rotation in-place…