Skip to main content

and
  1. No Access

    Article

    Low-Rank Approximation Algorithms for Matrix Completion with Random Sampling

    The possibility of accelerating a projection algorithm onto dominant singular spaces in the problem of recovering a low-rank matrix from a small number of its entries is explored. The underlying idea is to rep...

    O. S. Lebedeva, A. I. Osinsky, S. V. Petrov in Computational Mathematics and Mathematical… (2021)

  2. No Access

    Article

    Block tensor conjugate gradient-type method for Rayleigh quotient minimization in two-dimensional case

    A method for solving a partial algebraic eigenvalues problem is constructed. It exploits tensor structure of eigenvectors in two-dimensional case. For a symmetric matrix represented in tensor format, the metho...

    O. S. Lebedeva in Computational Mathematics and Mathematical Physics (2010)