A Link between the Canonical Decomposition in Multilinear Algebra and Simultaneous Matrix Diagonalization
Author:
- Lieven De LathauwerLLLieven De Lathauwer
Top Cited Papers
- 1 January 2006
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Matrix Analysis and Applications
- Vol. 28 (3) , 642-666
Abstract
Canonical decomposition is a key concept in multilinear algebra. In this paper we consider the decomposition of higher‐order tensors which have the property that the rank is smaller than the greatest dimension. We derive a new and relatively weak deterministic sufficient condition for uniqueness. The proof is constructive. It shows that the canonical components can be obtained from a simultaneous matrix diagonalization by congruence, yielding a new algorithm. From the deterministic condition we derive an easy‐to‐check dimensionality condition that guarantees generic uniqueness.Keywords
This publication has 35 references indexed in Scilit:
- Algorithms for Numerical Analysis in High DimensionsSIAM Journal on Scientific Computing, 2005
- Numerical operator calculus in higher dimensionsProceedings of the National Academy of Sciences, 2002
- An introduction to independent component analysisJournal of Chemometrics, 2000
- On the Best Rank-1 and Rank-(R1 ,R2 ,. . .,RN) Approximation of Higher-Order TensorsSIAM Journal on Matrix Analysis and Applications, 2000
- Blind source separation based on time-frequency signal representationsIEEE Transactions on Signal Processing, 1998
- PARAFAC. Tutorial and applicationsChemometrics and Intelligent Laboratory Systems, 1997
- A blind source separation technique using second-order statisticsIEEE Transactions on Signal Processing, 1997
- Decomposition of quantics in sums of powers of linear formsSignal Processing, 1996
- Independent component analysis, A new concept?Signal Processing, 1994
- Strategies for analyzing data from video fluorometric monitoring of liquid chromatographic effluentsAnalytical Chemistry, 1981