General tensor decomposition, moment matrices and applications
From MaRDI portal
(Redirected from Publication:1940930)
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.
Recommendations
Cited in
(39)- Generalized singular value decompositions for tensors and their applications
- Waring, tangential and cactus decompositions
- A comparison of different notions of ranks of symmetric tensors
- Multihomogeneous polynomial decomposition using moment matrices
- Partially symmetric variants of Comon's problem via simultaneous rank
- A note on the cactus rank for Segre-Veronese varieties
- On the equivalence between low-rank matrix completion and tensor rank
- On the construction of general cubature formula by flat extensions
- Polynomial-exponential decomposition from moments
- Improved method for finding optimal formulas for bilinear maps in a finite field
- Effective criteria for specific identifiability of tensors and forms
- Structured low rank decomposition of multivariate Hankel matrices
- Hermitian tensor decompositions
- Tensor decomposition for learning Gaussian mixtures from moments
- Skew-symmetric tensor decomposition
- A normal form algorithm for tensor rank decomposition
- Rank-\(r\) decomposition of symmetric tensors
- A Semidefinite Relaxation Method for Partially Symmetric Tensor Decomposition
- Estimating Higher-Order Moments Using Symmetric Tensor Decomposition
- Scalable symmetric Tucker tensor decomposition
- Tensor decompositions on simplicial complexes with invariance
- On tensor decomposition, sparse interpolation and Padé approximation
- Finding optimal Chudnovsky-Chudnovsky multiplication algorithms
- Decomposing tensors into frames
- Detecting optimality and extracting solutions in polynomial optimization with the truncated GNS construction
- Condition numbers for the tensor rank decomposition
- Generalized cut operation associated with higher order variation in tensor models
- A constructive algorithm for decomposing a tensor into a finite sum of orthonormal rank-1 terms
- SOS tensor decomposition: theory and applications
- Tensor Decompositions and Applications
- From computation to comparison of tensor decompositions
- On the typical rank of real polynomials (or symmetric tensors) with a fixed border rank
- SVD perspectives for augmenting DeepONet flexibility and interpretability
- The multidimensional truncated moment problem: the moment cone
- Low rank symmetric tensor approximations
- Generalized pseudoskeleton decompositions
- High order singular value decomposition for plant diversity estimation
- Hankel Tensor Decompositions and Ranks
- A constructive arbitrary-degree Kronecker product decomposition of tensors.
This page was built for publication: General tensor decomposition, moment matrices and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1940930)
