On the Best Approximation Algorithm by Low-Rank Matrices in Chebyshev’s Norm

Abstract The problem of approximation by low-rank matrices is found everywhere in computational mathematics. Traditionally, this problem is solved in the spectral or Frobenius norm, where the approximation efficiency is associated with the rate of decrease of the matrix singular values. However, recent results show that this requirement is not necessary in other norms. In this paper, a method for solving the problem of approximating by low-rank matrices in Chebyshev’s norm is proposed. It makes it possible to construct effective approximations of matrices for which singular values do not decrease in an acceptable amount time.