The Generalized Schur Decomposition and the rank-$R$ set of real $I\times J\times 2$ arrays
Alwin Stegeman

TL;DR
This paper extends the understanding of the rank-$R$ set of real $I\times J\times 2$ arrays by showing the equivalence of the Generalized Schur Decomposition solutions with the interior and boundary of this set, removing previous restrictions.
Contribution
It proves that the set of GSD solutions matches the interior and boundary of the rank-$R$ set without restrictions on the matrices, providing a complete classification of points.
Findings
GSD solutions correspond to interior and boundary points of the rank-$R$ set.
Complete classification of interior, boundary, and exterior points of the rank-$R$ set.
The equivalence holds even without the previous nonsingular upper triangular restriction.
Abstract
It is known that a best low-rank approximation to multi-way arrays or higher-order tensors may not exist. This is due to the fact that the set of multi-way arrays with rank at most is not closed. Nonexistence of the best low-rank approximation results in diverging rank-1 components when an attempt is made to compute the approximation. Recently, a solution to this problem has been proposed for real arrays. Instead of a best rank- approximation the best fitting Generalized Schur Decomposition (GSD) is computed. Under the restriction of nonsingular upper triangular matrices in the GSD, the set of GSD solutions equals the interior and boundary of the rank- set. Here, we show that this holds even without the restriction. We provide a complete classification of interior, boundary, and exterior points of the rank- set of real arrays, and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTensor decomposition and applications · Sparse and Compressive Sensing Techniques · Advanced Adaptive Filtering Techniques
