Undercomplete Decomposition of Symmetric Tensors in Linear Time, and
Smoothed Analysis of the Condition Number
Undercomplete Decomposition of Symmetric Tensors in Linear Time, and
Smoothed Analysis of the Condition Number
We study symmetric tensor decompositions, i.e., decompositions of the form $T = \sum_{i=1}^r u_i^{\otimes 3}$ where $T$ is a symmetric tensor of order 3 and $u_i \in \mathbb{C}^n$.In order to obtain efficient decomposition algorithms, it is necessary to require additional properties from $u_i$. In this paper we assume that the …