General Tensor Decomposition, Moment Matrices and Applications

Abstract

The tensor decomposition addressed in this paper may be seen as a generalisation of Singular Value Decomposition of matrices. We consider general multilinear and multihomogeneous tensors. We show how to reduce the problem to a truncated moment matrix problem and 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 to binary forms. An example illustrates the algebraic operations involved in this approach and how the decomposition can be recovered from eigenvector computation.

Submitted (2011)

References in corpus (4)

• Determinantal equations for secant varieties and the Eisenbud-Koh-Stillman conjecture
• Equations for secant varieties to Veronese varieties
• Equations for secant varieties via vector bundles
• A Sparse Flat Extension Theorem for Moment Matrices

Cited by in corpus (13)

• Effective criteria for specific identifiability of tensors and forms
• SVD Perspectives for Augmenting DeepONet Flexibility and Interpretability
• A condition number for the tensor rank decomposition
• Partially symmetric variants of Comon's problem via simultaneous rank
• Waring, tangential and cactus decompositions
• A note on the cactus rank for Segre-Veronese varieties
• Semidefinite Relaxations for Best Rank-1 Tensor Approximations
• Tensor decomposition for learning Gaussian mixtures from moments
• A Normal Form Algorithm for Tensor Rank Decomposition
• Hankel tensor decompositions and ranks
• Hermitian Tensor Decompositions
• Low Rank Symmetric Tensor Approximations
• On the construction of general cubature formula by flat extensions