## Computation of the canonical decomposition by means of a simultaneous generalized schur decomposition (2004)

Venue: | SIAM J. Matrix Anal. Appl |

Citations: | 35 - 6 self |

### BibTeX

@ARTICLE{Lathauwer04computationof,

author = {Lieven De Lathauwer and Bart De Moor and Joos Vandewalle},

title = {Computation of the canonical decomposition by means of a simultaneous generalized schur decomposition},

journal = {SIAM J. Matrix Anal. Appl},

year = {2004},

volume = {26},

pages = {295--327}

}

### Years of Citing Articles

### OpenURL

### Abstract

Abstract. The canonical decomposition of higher-order tensors is a key tool in multilinear algebra. First we review the state of the art. Then we show that, under certain conditions, the problem can be rephrased as the simultaneous diagonalization, by equivalence or congruence, of a set of matrices. Necessary and sufficient conditions for the uniqueness of these simultaneous matrix decompositions are derived. In a next step, the problem can be translated into a simultaneous generalized Schur decomposition, with orthogonal unknowns [A.-J. van der Veen and A. Paulraj, IEEE Trans. Signal Process., 44 (1996), pp. 1136–1155]. A first-order perturbation analysis of the simultaneous generalized Schur decomposition is carried out. We discuss some computational techniques (including a new Jacobi algorithm) and illustrate their behavior by means of a number of numerical experiments.