On the minimal ranks of matrix pencils and the existence of a best approximate block-term tensor decomposition
From MaRDI portal
Publication:1630059
DOI10.1016/j.laa.2018.09.031zbMath1403.15008arXiv1712.05742OpenAlexW2963277906WikidataQ129030632 ScholiaQ129030632MaRDI QIDQ1630059
J. H. de M. Goulart, Pierre Comon
Publication date: 7 December 2018
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1712.05742
Best approximation, Chebyshev systems (41A50) Multilinear algebra, tensor calculus (15A69) Matrix pencils (15A22)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Rank of 3-tensors with 2 slices and Kronecker canonical forms
- Matrix pencils: Theory, applications, and numerical methods
- Typical ranks for \(m\times n\times (m-1)n\) tensors with \(m \leq n\)
- Degeneracy in Candecomp/Parafac explained for \(p\times p\times 2\) arrays of rank \(p+1\) or higher
- Extensions to the kronecker-weierstrass theory of pencils
- Optimal Evaluation of Pairs of Bilinear Forms
- An Addendum to Kronecker’s Theory of Pencils
- The Condition Number of Join Decompositions
- Decompositions of a Higher-Order Tensor in Block Terms—Part II: Definitions and Uniqueness
- Decompositions of a Higher-Order Tensor in Block Terms—Part III: Alternating Least Squares Algorithms
- Tensor Rank and the Ill-Posedness of the Best Low-Rank Approximation Problem
This page was built for publication: On the minimal ranks of matrix pencils and the existence of a best approximate block-term tensor decomposition