Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 229

The DOI matches its Crossref record.

Computation of the Canonical Decomposition by Means of a Simultaneous Generalized Schur Decomposition

De Lathauwer, Lieven, De Moor, Bart, Vandewalle, Joos·2004·SIAM Journal on Matrix Analysis and Applications

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.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1137/s089547980139786x

Cites

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cited by

See all 229

Metadata

Authors
De Lathauwer, L., De Moor, B., & Vandewalle, J.
Venue
SIAM Journal on Matrix Analysis and Applications
Published
2004-01
Volume
26
Issue
2
Pages
295-327
ISSN
  • 0895-4798 (ISSN-L)
  • 1095-7162
OpenAlex
W2078789945
Cited by
229
References
0
FWCI
5.05
Type
journal article
Language
en
Open access
closed

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Computation of the Canonical Decomposition by Means of a Simultaneous Generalized Schur Decomposition. https://app.cochat.ai/papers/10.1137/s089547980139786x
The paper
De Lathauwer, L., De Moor, B., & Vandewalle, J. (2004). Computation of the Canonical Decomposition by Means of a Simultaneous Generalized Schur Decomposition. SIAM Journal on Matrix Analysis and Applications. https://doi.org/10.1137/s089547980139786x

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.