Tensor-Train Ranks for Matrices and Their Inverses

Ivan V. Oseledets, Eugene E. Tyrtyshnikov, Nickolai Zamarashkin

Abstract

We show that the recent tensor-train (TT) decompositions of matrices come up from its recursive Kronecker-product representations with a systematic use of common bases. The names TTM and QTT used in this case stress the relation with multilevel matrices or quantization that increases artificially the number of levels. Then we investigate how the tensor-train ranks of a matrix can be related to those of its inverse. In the case of a banded Toeplitz matrix, we prove that the tensor-train ranks of its inverse are bounded above by 1+(l+u)^2, where l and u are the bandwidths in the lower and upper parts of the matrix without the main diagonal.
BibTeX
@article{oseledets2011tensor,
  author = {Ivan V. Oseledets and Eugene E. Tyrtyshnikov and Nickolai Zamarashkin},
  title = {{Tensor-Train Ranks for Matrices and Their Inverses}},
  journal = {Comput. Methods Appl. Math.},
  year = {2011},
  doi = {10.2478/cmam-2011-0022},
}

Loading related content...

Figure