Multihomogeneous Polynomial Decomposition using Moment Matrices

Alessandra Bernardi 1 Jérôme Brachat 1 Pierre Comon 2 Bernard Mourrain 1
1 GALAAD - Geometry, algebra, algorithms
CRISAM - Inria Sophia Antipolis - Méditerranée , UNS - Université Nice Sophia Antipolis, CNRS - Centre National de la Recherche Scientifique : UMR6621
Abstract : In the paper, we address the important problem of tensor decomposition which can be seen as a generalisation of Sin- gular Value Decomposition for matrices. We consider gen- eral multilinear and multihomogeneous tensors. We show how to reduce the problem to a truncated moment matrix problem and we give a new criterion for flat extension of Quasi-Hankel matrices. We connect this criterion to the commutation characterisation of border bases. A new algo- rithm is described: it applies for general multihomogeneous tensors, extending the approach of J.J. Sylvester on binary forms. An example illustrates the algebraic operations in- volved in this approach and how the decomposition can be recovered from eigenvector computation.
Document type :
Conference papers
Complete list of metadatas

Cited literature [46 references]  Display  Hide  Download

https://hal.inria.fr/inria-00638837
Contributor : Bernard Mourrain <>
Submitted on : Monday, November 7, 2011 - 2:34:08 PM
Last modification on : Monday, September 23, 2019 - 4:46:36 PM
Long-term archiving on : Sunday, December 4, 2016 - 10:09:37 AM

File

paper.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Alessandra Bernardi, Jérôme Brachat, Pierre Comon, Bernard Mourrain. Multihomogeneous Polynomial Decomposition using Moment Matrices. 36th international symposium on Symbolic and algebraic computation (ISSAC 11), Jun 2011, San Jose, United States. pp.35-42, ⟨10.1145/1993886.1993898⟩. ⟨inria-00638837⟩

Share

Metrics

Record views

473

Files downloads

343