Related papers: Using SimTeEx to simplify polynomial expressions w…
Copositivity of tensors plays an important role in vacuum stability of a general scalar potential, polynomial optimization, tensor complementarity problem and tensor generalized eigenvalue complementarity problem. In this paper, we propose…
We present an algorithm for low rank decomposition of tensors of any symmetry type, from fully asymmetric to fully symmetric. It recovers the decomposition one summand at a time via the higher-order power method. This approach is known to…
Kjolstad et. al. proposed a tensor algebra compiler. It takes expressions that define a tensor element-wise, such as $f_{ij}(a,b,c,d) = \exp\left[-\sum_{k=0}^4 \left((a_{ik}+b_{jk})^2\, c_{ii} + d_{i+k}^3 \right) \right]$, and generates the…
Let A[X]_U be a fraction ring of the polynomial ring A[X] in the variable X over a commutative ring A. We show that the Hilbert functor {Hilb}^n_{A[X]_U} is represented by an affine scheme $\text{Symm}^n_A(A[X]_U)$ give as the ring of…
Classical tensors, the familiar mathematical objects denoted by symbols such as $t_{i}$, $t^{ij}$ and $t_{k}^{ij}$, are usually interpreted either as 'coordinatizable objects' with coordinates changing in a specific way under a change of…
We propose an isogeometric solver for Poisson problems that combines i)low-rank tensor techniques to approximate the unknown solution and the system matrix, as a sum of a few terms having Kronecker product structure, ii) a Truncated…
This paper investigates the necessary and sufficient algebraic conditions to a constrained system of Sylvester-type quaternion tensor equations. An explicit formula of the general solution regarding the Moore-Penrose inverses of some block…
Cet article se veut un survol des r\'eseaux de tenseurs et s'adresse aux d\'ebutants en la mati\`ere. Nous y mettons l'accent sur les outils n\'ecessaires \`a l'impl\'ementation concr\`ete d'algorithmes. Quatre op\'erations de base…
Mathematical operators whose transformation rules constitute the building blocks of a multi-linear algebra are widely used in physics and engineering applications where they are very often represented as tensors. In the last century, thanks…
Symmetric and sparse tensors arise naturally in many domains including linear algebra, statistics, physics, chemistry, and graph theory. Symmetric tensors are equal to their transposes, so in the $n$-dimensional case we can save up to a…
We consider the problem of automatically decomposing operations over tensors or arrays so that they can be executed in parallel on multiple devices. We address two, closely-linked questions. First, what programming abstraction should…
This paper presents a method to build explicit tensor-train (TT) representations. We show that a wide class of tensors can be explicitly represented with sparse TT-cores, obtaining, in many cases, optimal TT-ranks. Numerical experiments…
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…
This chapter studies the problem of decomposing a tensor into a sum of constituent rank one tensors. While tensor decompositions are very useful in designing learning algorithms and data analysis, they are NP-hard in the worst-case. We will…
Lichnerowicz's algebra of differential geometric operators acting on symmetric tensors can be obtained from generalized geodesic motion of an observer carrying a complex tangent vector. This relation is based upon quantizing the classical…
Tensor completion is a natural higher-order generalization of matrix completion where the goal is to recover a low-rank tensor from sparse observations of its entries. Existing algorithms are either heuristic without provable guarantees,…
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…
Multivariate polynomials arise in many different disciplines. Representing such a polynomial as a vector of univariate polynomials can offer useful insight, as well as more intuitive understanding. For this, techniques based on tensor…
Tensor decomposition is a mathematically supported technique for data compression. It consists of applying some kind of a Low Rank Decomposition technique on the tensors or matrices in order to reduce the redundancy of the data. However, it…
Tensor rank and low-rank tensor decompositions have many applications in learning and complexity theory. Most known algorithms use unfoldings of tensors and can only handle rank up to $n^{\lfloor p/2 \rfloor}$ for a $p$-th order tensor in…