Computer Science – Symbolic Computation
Scientific paper
2009-01-23
Linear Algebra and Applications 433, 11-12 (2010) 851?1872
Computer Science
Symbolic Computation
Scientific paper
We present an algorithm for decomposing a symmetric tensor, of dimension n and order d as a sum of rank-1 symmetric tensors, extending the algorithm of Sylvester devised in 1886 for binary forms. We recall the correspondence between the decomposition of a homogeneous polynomial in n variables of total degree d as a sum of powers of linear forms (Waring's problem), incidence properties on secant varieties of the Veronese Variety and the representation of linear forms as a linear combination of evaluations at distinct points. Then we reformulate Sylvester's approach from the dual point of view. Exploiting this duality, we propose necessary and sufficient conditions for the existence of such a decomposition of a given rank, using the properties of Hankel (and quasi-Hankel) matrices, derived from multivariate polynomials and normal form computations. This leads to the resolution of polynomial equations of small degree in non-generic cases. We propose a new algorithm for symmetric tensor decomposition, based on this characterization and on linear algebra computations with these Hankel matrices. The impact of this contribution is two-fold. First it permits an efficient computation of the decomposition of any tensor of sub-generic rank, as opposed to widely used iterative algorithms with unproved global convergence (e.g. Alternate Least Squares or gradient descents). Second, it gives tools for understanding uniqueness conditions, and for detecting the rank.
Brachat Jerome
Comon Pierre
Mourrain Bernard
Tsigaridas Elias
No associations
LandOfFree
Symmetric tensor decomposition does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Symmetric tensor decomposition, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Symmetric tensor decomposition will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-66218