Tensors inside of matrices give logarithmic complexity


The recently intoduced TT-format finds a surprising application for the compression of ordinary “two” or “three” dimensional matrices, related to the discretization of operators on tensor grids. For some examples the complexity is shown to be logarithmic in the matrix order. The new format (named TTM format) can be used to implement all basic operations efficiently. The Matlab codes will be posted here soon. The paper itself is here


26/05/2016 A TT-eigenvalue solver that finally works Papers
12/05/2016 Exponential machines and tensor trains Papers
06/04/2016 Convergence analysis of a projected fixed-point iteration Papers
30/03/2016 Compress-and-eliminate solver for sparse matrices Papers
01/12/2015 New paper in SIMAX Papers


We are located at the 2-nd floor of the new "Technopark-3” building in Skolkovo (few kilometers outside Moscow Ring Road). The building is accessible from Skolkovo Road (Сколковское шоссе) and Minskoe Highway (Минское шоссе).