2022/03/03 by Adam Czaplinski, Czaplinski, Adam, Thorsten Raasch +3
Computer Science · Mathematics · #Algebraic Geometry (math.AG) #FOS: Mathematics #Numerical Analysis (math.NA) #Spectral Theory (math.SP) #cs.NA #math.AG #math.NA #math.SP
paper · pdf · doi:10.48550/arxiv.2203.01865
32 pages, 4 figures, 1 table
arxiv created 2022/03/30 · arxiv updated 2022/03/31
We are concerned with the eigenstructure of supersymmetric tensors. Like in the matrix case, normalized tensor eigenvectors are fixed points of the tensor power iteration map. However, unless the given tensor is orthogonally decomposable, some of these fixed points may be repelling and therefore be undetectable by any numerical scheme. In this paper, we consider the case of regular simplex tensors whose symmetric decomposition is induced by an overcomplete, equiangular set of n+1 vectors from \mathbb Rn. We discuss the full real eigenstructure of such tensors, including the robustness analysis of all normalized eigenvectors. As it turns out, regular simplex tensors exhibit robust as well as non-robust eigenvectors which, moreover, only partly coincide with the generators from the symmetric tensor decomposition.