Symmetric Tensors and Symmetric Tensor Rank 论文

2008SIAM Journal on Matrix Analysis and Applications引用 565
Tensor decomposition and applicationsMatrix Theory and AlgorithmsAlgebraic structures and combinatorial models

详细信息

发表期刊/会议
SIAM Journal on Matrix Analysis and Applications
发表日期
2008-01-01
发表年份
2008

关键词

Tensor decomposition and applicationsMatrix Theory and AlgorithmsAlgebraic structures and combinatorial models

摘要

A symmetric tensor is a higher order generalization of a symmetric matrix. In this paper, we study various properties of symmetric tensors in relation to a decomposition into a symmetric sum of outer product of vectors. A rank-1 order-k tensor is the outer product of k nonzero vectors. Any symmetric tensor can be decomposed into a linear combination of rank-1 tensors, each of which is symmetric or not. The rank of a symmetric tensor is the minimal number of rank-1 tensors that is necessary to reconstruct it. The symmetric rank is obtained when the constituting rank-1 tensors are imposed to be themselves symmetric. It is shown that rank and symmetric rank are equal in a number of cases and that they always exist in an algebraically closed field. We will discuss the notion of the generic symmetric rank, which, due to the work of Alexander and Hirschowitz [J. Algebraic Geom., 4 (1995), pp. 201–222], is now known for any values of dimension and order. We will also show that the set of symmetric tensors of symmetric rank at most r is not closed unless $r=1$.