Related papers: Recursive reduction of two-loop tensor integrals
The large double logarithm in loop-induced processes is one kind of logarithm at subleading power, which has a different origin from Sudakov double logarithms. We develop a method with soft-collinear effective theory to resum these large…
We present OPITeR, a FORM program for the reduction of multi-loop tensor Feynman integrals. The program can handle tensors, including spinor indices, with rank of up to 20 and can deal with up to 8 independent external momenta. The…
Benson's outer approximation algorithm and its variants are the most frequently used methods for solving linear multiobjective optimization problems. These algorithms have two intertwined components: one-dimensional linear optimization one…
This paper introduces the recursive sweeping preconditioner for the numerical solution of the Helmholtz equation in 3D. This is based on the earlier work of the sweeping preconditioner with the moving perfectly matched layers (PMLs). The…
In this paper we propose new techniques to sample arbitrary third-order tensors, with an objective of speeding up tensor algorithms that have recently gained popularity in machine learning. Our main contribution is a new way to select, in a…
If $A$ is a tridiagonal matrix, then the equations $AX=I$ and $XA=I$ defining the inverse $X$ of $A$ are in fact the second order recurrence relations for the elements in each row and column of $X$. Thus, the recursive algorithms should be…
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…
We develop two Regression Monte Carlo algorithms (value and performance iteration) to solve general problems of optimal stochastic control of discrete-time Markov processes. We formulate our method within an innovative framework that allow…
By recursively solving the underlying Schr\" odinger equation, we set up an efficient systematic approach for deriving analytic expressions for discretized effective actions. With this we obtain discrete short-time propagators for both one…
We calculate the vacuum-to-vacuum correlator of two quark tensor currents with two massive quarks, retaining full momentum dependence. For the first time, we include perturbative corrections up to next-to-leading order. Our fully analytical…
Loop calculations involve the evaluation of divergent integrals. Usually [1] one computes them in a number of dimensions different than four where the integral is convergent and then one performs the analytical continuation and considers…
Within the tensor singular value decomposition (T-SVD) framework, existing robust low-rank tensor completion approaches have made great achievements in various areas of science and engineering. Nevertheless, these methods involve the T-SVD…
We present a new program package for calculating one-loop Feynman integrals, based on a new method avoiding Feynman parametrization and the contraction due to Passarino and Veltman. The package is calculating one-, two- and three-point…
Traditional tensor decomposition methods, e.g., two dimensional principal component analysis and two dimensional singular value decomposition, that minimize mean square errors, are sensitive to outliers. To overcome this problem, in this…
The low multilinear rank approximation, also known as the truncated Tucker decomposition, has been extensively utilized in many applications that involve higher-order tensors. Popular methods for low multilinear rank approximation usually…
The popular Alternating Least Squares (ALS) algorithm for tensor decomposition is efficient and easy to implement, but often converges to poor local optima---particularly when the weights of the factors are non-uniform. We propose a…
In this paper, we investigate a class of nonconvex and nonsmooth fractional programming problems, where the numerator composed of two parts: a convex, nonsmooth function and a differentiable, nonconvex function, and the denominator consists…
We present a new method for evaluating tensor integrals in the large-scale structure. Decomposing a $\Lambda$CDM-like universe into a finite sum of scaling universes using the FFTLog, we can recast loop integrals for biased tracers in the…
We describe new developments in the OpenLoops framework based on the recently introduced on-the-fly method. The on-the-fly approach exploits the factorisation of one-loop diagrams into segments in order to perform various operations, such…
Recasting the $N$-point one loop scalar integral as a probabilistic problem, allows the derivation of integral recurrence relations as well as exact analytical expressions in the most common cases. $\epsilon$ expansions are derived by…