Tensor ranks for the inversion of tensor-product binomials (Q989123): Difference between revisions

The author proves that if a nonsingular matrix \(A\) of order \(n=pq\) is a tensor-product binomial with two factors then the tensor rank of \(A^{ - 1}\) is bounded from above by min\(\{p,q\}\). The estimate is sharp, and in the worst case it amounts to \(\sqrt n\).