Publication | Open Access
Multihomogeneous polynomial decomposition using moment matrices
14
Citations
41
References
2011
Year
Unknown Venue
Numerical AnalysisSpectral TheoryMathematical ProgrammingMoment MatricesGeneral Multihomogeneous TensorsRepresentation TheoryEngineeringMatrix AnalysisMultihomogeneous TensorsMultilinear Subspace LearningMatrix MethodMatrix TheoryNew CriterionApproximation TheoryLow-rank Approximation
In the paper, we address the important problem of tensor decomposition which can be seen as a generalisation of Singular Value Decomposition for matrices. We consider general 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 algorithm is described: it applies for general multihomogeneous tensors, extending the approach of J.J. Sylvester on binary forms. An example illustrates the algebraic operations involved in this approach and how the decomposition can be recovered from eigenvector computation.
| Year | Citations | |
|---|---|---|
Page 1
Page 1