Related papers: Contraction and decomposition matrices for vacuum …
General algorithms for tensor reduction of two-loop massive vacuum diagrams are discussed. Some explicit useful formulae are presented.
Explicit general formulae for the tensor reduction of two-loop massive vacuum diagrams are presented. The problem of calculating the corresponding coefficients is shown to be equivalent to the problem of constructing differential operators…
As a generalization of a previous work [Phys. Rev. D. {\bf 59}, 105014 (1999)], we compute analytically a class of three-loop vacuum diagrams with two {\em arbitrarily} different mass scales. We use a decomposition algorithm in which the…
The implementation of an algorithm for three-loop massive vacuum integrals, based on the explicit solution of the recurrence relations, in REDUCE and FORM is described.
Deterministic recursive algorithms for the computation of matrix triangular decompositions with permutations like LU and Bruhat decomposition are presented for the case of commutative domains. This decomposition can be considered as a…
Explicit formulas for the solutions of the recurrence relations for 3--loop vacuum integrals are suggested. This formulas can be used for direct calculations and demonstrate a high efficiency. They also produce a new type of recurrence…
The inverse of the Vandermonde and confluent Vandermonde matrices are presented. In the case of the Vandermonde matrix, we present a decomposition in three factors, one of them a diagonal matrix. The evaluation of such inverse matrices is a…
The tensor decomposition addressed in this paper may be seen as a generalisation of Singular Value Decomposition of matrices. We consider general multilinear and multihomogeneous tensors. We show how to reduce the problem to a truncated…
We obtain finite parts (as well as $\epsilon$-pole parts) of massive three-loop vacuum diagrams with three-point and/or four-point interaction vertices by reducing them to tetrahedron diagrams with both massive and massless lines, whose…
This is the second in a series of papers on rank decompositions of the matrix multiplication tensor. We present new rank $23$ decompositions for the $3\times 3$ matrix multiplication tensor $M_{\langle 3\rangle}$. All our decompositions…
Tensor diagrams are a handy way to depict complicated relationships between objects in projective geometry. One of the simpler ones takes two copies of a $3\times 3$ matrix and computes its adjugate. In this paper, we give a geometric…
In this paper, the canonical polyadic (CP) decomposition of tensors that corresponds to matrix multiplications is studied. Finding the rank of these tensors and computing the decompositions is a fundamental problem of algebraic complexity…
We study the problem of calculating two-loop three-point diagrams with irreducible numerators (i.e. numerators which cannot be expressed in terms of the denominators). For the case of massless internal particles and arbitrary (off-shell)…
This paper surveys randomized algorithms in numerical linear algebra for low-rank decompositions of matrices and tensors. The survey begins with a review of classical matrix algorithms that can be accelerated by randomized dimensionality…
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…
In this paper, we first introduce the new class of vertically-recurrent matrices, using a generalization of "the Hockey stick and Puck theorem" in Pascal's triangle. Then, we give an interesting formula for the lower triangular…
We prove the decomposition of arbitrary diagonal operators into tensor and matrix products of smaller matrices, focusing on the analytic structure of the resulting formulas and their inherent symmetries. Diagrammatic representations are…
The theory and computation of tensors with different tensor products play increasingly important roles in scientific computing and machine learning. Different products aim to preserve different algebraic properties from the matrix algebra,…
In this paper, we introduce a new tensor decomposition for third order tensors, which decomposes a third order tensor to three third order low rank tensors in a balanced way. We call such a decomposition the triple decomposition, and the…
Higher-order tensors appear in various areas of mechanics as well as physics, medicine or earth sciences. As these tensors are highly complex, most are not well understood. Thus, the analysis and the visualization process form a highly…