Robust Eigenvectors of Symmetric Tensors

Abstract

The tensor power method generalizes the matrix power method to higher order arrays, or tensors. Like in the matrix case, the fixed points of the tensor power method are the eigenvectors of the tensor. While every real symmetric matrix has an eigendecomposition, the vectors generating a symmetric decomposition of a real symmetric tensor are not always eigenvectors of the tensor. In this paper we show that whenever an eigenvector is a generator of the symmetric decomposition of a symmetric tensor, then (if the order of the tensor is sufficiently high) this eigenvector is robust, i.e., it is an attracting fixed point of the tensor power method. We exhibit new classes of symmetric tensors whose symmetric decomposition consists of eigenvectors. Generalizing orthogonally decomposable tensors, we consider equiangular tight frame decomposable and equiangular set decomposable tensors. Our main result implies that such tensors can be decomposed using the tensor power method.

22 pages, 3 figures

References in corpus (9)

• Shifted Power Method for Computing Tensor Eigenpairs
• Tight informationally complete quantum measurements
• The Number of Eigenvalues of a Tensor
• Equiangular lines with a fixed angle
• A new convergence proof for the higher-order power method and generalizations
• Symmetric Orthogonal Tensor Decomposition is Trivial
• Successive Rank-One Approximations for Nearly Orthogonally Decomposable Symmetric Tensors
• Decomposing Tensors into Frames
• Subspace power method for symmetric tensor decomposition