On the minimal ranks of matrix pencils and the existence of a best approximate block-term tensor decomposition

Under the action of the general linear group, the ranks of matrices $A$ and $B$ forming a $m \times n$ pencil $A + \lambda B$ can change, but in a restricted manner. Specifically, to every pencil one can associate a pair of minimal ranks, which is unique up to a permutation. This notion can be defined for matrix pencils and, more generally, also for matrix polynomials of arbitrary degree. The natural hierarchy it induces in a pencil space is discussed. Then, a characterization of the minimal ranks of a pencil in terms of its Kronecker canonical form is provided. We classify the orbits according to their minimal ranks - under the action of the general linear group - in the case of real pencils with $m, n \le 4$. By relying on this classification, we show that no real regular $4 \times 4$ pencil having only complex-valued eigenvalues admits a best approximation (in the norm topology) on the set of real pencils whose minimal ranks are bounded by 3. These non-approximable pencils form an open set, which is therefore of positive volume. Our results can be interpreted from a tensor viewpoint, where the minimal ranks of a degree-$(d-1)$ matrix polynomial characterize the minimal ranks of matrices constituting a block-term decomposition of a $m \times n \times d$ tensor into a sum of matrix-vector tensor products.

[1]  Pierre Comon,et al.  Tensors : A brief introduction , 2014, IEEE Signal Processing Magazine.

[2]  Toshio Sakata,et al.  Typical ranks for m×n×(m-1)n tensors with m⩽n☆ , 2013 .

[3]  Lieven De Lathauwer,et al.  Decompositions of a Higher-Order Tensor in Block Terms - Part III: Alternating Least Squares Algorithms , 2008, SIAM J. Matrix Anal. Appl..

[4]  Nick Vannieuwenhoven,et al.  The Condition Number of Join Decompositions , 2016, SIAM J. Matrix Anal. Appl..

[5]  Lek-Heng Lim,et al.  Complex tensors almost always have best low-rank approximations , 2017 .

[6]  Mitsuhiro Miyazaki,et al.  Rank of 3-tensors with 2 slices and Kronecker canonical forms , 2008, 0808.1167.

[7]  Paul Van Dooren,et al.  Geometry of spaces for matrix polynomial Fiedler linearizations , 2015 .

[8]  Lieven De Lathauwer,et al.  Decompositions of a Higher-Order Tensor in Block Terms - Part II: Definitions and Uniqueness , 2008, SIAM J. Matrix Anal. Appl..

[9]  Joseph JáJá Optimal Evaluation of Pairs of Bilinear Forms , 1978, STOC.

[10]  Vin de Silva,et al.  Tensor rank and the ill-posedness of the best low-rank approximation problem , 2006, math/0607647.

[11]  A. Stegeman Degeneracy in Candecomp/Parafac explained for p × p × 2 arrays of rank p + 1 or higher , 2006 .

[12]  K. Ikramov Matrix pencils: Theory, applications, and numerical methods , 1993 .

[13]  K. H. Hofmann Hierarchy of Closures of Matrix Pencils , 2004 .

[14]  Mike D. Atkinson Extensions to the kronecker-weierstrass theory of pencils , 1991 .

[15]  J. Jaja An Addendum to Kronecker’s Theory of Pencils , 1979 .