Multihomogeneous polynomial decomposition using moment matrices

Authors:
Alessandra Bernardi;Jérôme Brachat;Pierre Comon;Bernard Mourrain
Affiliations:
INRIA Sophia-Antipolis, Sophia Antipolis, France;INRIA Sophia Antipolis, Sophia Antipolis, France;I3S, Sophia Antipolis, France;INRIA Sophia Antipolis, Sophia Antipolis, France
Venue:
Proceedings of the 36th international symposium on Symbolic and algebraic computation
Year:
2011

Citing 17
Cited 2

Decomposition of quantics in sums of powers of linear forms

Signal Processing - Special issue on higher order statistics
Optimal separation of independent narrow-band sources: concept and performance

Signal Processing - Special issue on blind source separation and multichannel deconvolution
Multivariate polynomials, duality, and structured matrices

Journal of Complexity
Adaptive Blind Signal and Image Processing: Learning Algorithms and Applications

Adaptive Blind Signal and Image Processing: Learning Algorithms and Applications
Blind identification of under-determined mixtures based on the characteristic function

Signal Processing - Signal processing in UWB communications
Tensor-based techniques for the blind separation of DS-CDMA signals

Signal Processing
Handbook of Blind Source Separation: Independent Component Analysis and Applications

Handbook of Blind Source Separation: Independent Component Analysis and Applications
Computing symmetric rank for symmetric tensors

Journal of Symbolic Computation
Algebraic Complexity Theory

Algebraic Complexity Theory
An analytical constant modulus algorithm

IEEE Transactions on Signal Processing
Blind PARAFAC receivers for DS-CDMA systems

IEEE Transactions on Signal Processing
Applications of cumulants to array processing .I. Apertureextension and array calibration

IEEE Transactions on Signal Processing
On the virtual array concept for higher order array processing

IEEE Transactions on Signal Processing
Parallel factor analysis in sensor array processing

IEEE Transactions on Signal Processing
On the behavior of current second and higher order blind sourceseparation methods for cyclostationary sources

IEEE Transactions on Signal Processing
Kruskal's permutation lemma and the identification of CANDECOMP/PARAFAC and bilinear models with constant modulus constraints

IEEE Transactions on Signal Processing
Uncertainty principles and ideal atomic decomposition

IEEE Transactions on Information Theory

Moment matrices, border bases and real radical computation

Journal of Symbolic Computation
General tensor decomposition, moment matrices and applications

Journal of Symbolic Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.