815 citations · 3.2k across the 142 of their papers we have counts for
4 papers · 1 filter
Iterative representing set selection for nested cross approximation
A. Yu Mikhalev, I. V. Oseledets
A new fast algebraic method for obtaining an -approximation of a matrix from its entries is presented. The main idea behind the method is based on the nested represe…
Computation of extreme eigenvalues in higher dimensions using block tensor train format
Sergey V. Dolgov, Boris N. Khoromskij, Ivan V. Oseledets +1
We consider an approximate computation of several minimal eigenpairs of large Hermitian matrices which come from high--dimensional problems. We use the tensor train format (TT) for…
Fast low-rank solution of the Poisson equation with application to the Stokes problem
E. A. Muravleva, I. V. Oseledets
We consider the problem of computing approximate solution of Poisson equation in the low-parametric tensor formats. We propose a new algorithm to compute the solution based on the…
A projector-splitting integrator for dynamical low-rank approximation
Christian Lubich, Ivan Oseledets
The dynamical low-rank approximation of time-dependent matrices is a low-rank factorization updating technique. It leads to differential equations for factors of the matrices, whic…