Ivan V. Oseledets
Skolkovo Institute of Science and Technology
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Ivan V. Oseledets.
SIAM Journal on Scientific Computing | 2011
Ivan V. Oseledets
A simple nonrecursive form of the tensor decomposition in
SIAM Journal on Scientific Computing | 2009
Ivan V. Oseledets; Eugene E. Tyrtyshnikov
d
SIAM Journal on Matrix Analysis and Applications | 2008
Ivan V. Oseledets; D. V. Savostianov; Eugene E. Tyrtyshnikov
dimensions is presented. It does not inherently suffer from the curse of dimensionality, it has asymptotically the same number of parameters as the canonical decomposition, but it is stable and its computation is based on low-rank approximation of auxiliary unfolding matrices. The new form gives a clear and convenient way to implement all basic operations efficiently. A fast rounding procedure is presented, as well as basic linear algebra operations. Examples showing the benefits of the decomposition are given, and the efficiency is demonstrated by the computation of the smallest eigenvalue of a 19-dimensional operator.
SIAM Journal on Scientific Computing | 2012
Ivan V. Oseledets; Sergey Dolgov
For
SIAM Journal on Matrix Analysis and Applications | 2010
Ivan V. Oseledets
d
Computer Physics Communications | 2014
Sergey Dolgov; Boris N. Khoromskij; Ivan V. Oseledets; Dmitry V. Savostyanov
-dimensional tensors with possibly large
Computational Methods in Applied Mathematics Comput | 2010
Boris N. Khoromskij; Ivan V. Oseledets
d>3
SIAM Journal on Scientific Computing | 2012
Sergey Dolgov; Boris N. Khoromskij; Ivan V. Oseledets
, an hierarchical data structure, called the Tree-Tucker format, is presented as an alternative to the canonical decomposition. It has asymptotically the same (and often even smaller) number of representation parameters and viable stability properties. The approach involves a recursive construction described by a tree with the leafs corresponding to the Tucker decompositions of three-dimensional tensors, and is based on a sequence of SVDs for the recursively obtained unfolding matrices and on the auxiliary dimensions added to the initial “spatial” dimensions. It is shown how this format can be applied to the problem of multidimensional convolution. Convincing numerical examples are given.
Computing | 2009
Ivan V. Oseledets; Dmitry V. Savostyanov; Eugene E. Tyrtyshnikov
We consider Tucker-like approximations with an
Physical Review B | 2016
Jutho Haegeman; Christian Lubich; Ivan V. Oseledets; Bart Vandereycken; Frank Verstraete
r \times r \times r