Skip to Main content Skip to Navigation
Conference papers

Symmetric tensor decomposition

Jérôme Brachat 1 Pierre Comon 2 Bernard Mourrain 1 Elias P. Tsigaridas 1
1 GALAAD - Geometry, algebra, algorithms
CRISAM - Inria Sophia Antipolis - Méditerranée , UNS - Université Nice Sophia Antipolis (... - 2019), CNRS - Centre National de la Recherche Scientifique : UMR6621
Abstract : We present an algorithm for decomposing a symmetric tensor of dimension n and order d as a sum of of rank-1 symmetric tensors, extending the algorithm of Sylvester devised in 1886 for symmetric tensors of dimension 2. We exploit the known fact that every symmetric tensor is equivalently represented by a homogeneous polynomial in n variables of total degree d. Thus the decomposition corresponds to a sum of powers of linear forms. 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 convergence (e.g. Alternate Least Squares or gradient descents). Second, it gives tools for understanding uniqueness conditions, and for detecting the tensor rank.
Complete list of metadatas
Contributor : Pierre Comon <>
Submitted on : Wednesday, November 25, 2009 - 11:45:27 AM
Last modification on : Tuesday, May 26, 2020 - 6:50:34 PM
Document(s) archivé(s) le : Thursday, June 17, 2010 - 7:25:31 PM


Files produced by the author(s)


  • HAL Id : hal-00435908, version 1



Jérôme Brachat, Pierre Comon, Bernard Mourrain, Elias P. Tsigaridas. Symmetric tensor decomposition. 17th European Signal Processing Conference 2009., Aug 2009, Glasgow, United Kingdom. pp.525-529. ⟨hal-00435908⟩



Record views


Files downloads