Dominant subspace and low-rank approximations from block Krylov subspaces without a prescribed gap

We develop a novel convergence analysis of the classical deterministic block Krylov methods for the approximation of h-dimensional dominant subspaces and low-rank approximations of matrices A is an element of K m x n (where K = R or C) in the case that there is no singular gap at the index h i.e., if ah = sigma(h +1) (where a 1 > ... > ap > 0 denote the singular values of A , and p = min{m, n }). Indeed, starting with a (deterministic) matrix X is an element of K-n x r with r > h satisfying a compatibility assumption with some h-dimensional right dominant subspace of A , we show that block Krylov methods produce arbitrarily good approximations for both problems mentioned above. Our approach is based on recent work by Drineas, Ipsen, Kontopoulou and Magdon-Ismail on the approximation of structural left dominant subspaces. The main difference between our work and previous work on this topic is that instead of exploiting a singular gap at the prescribed index h (which is zero in this case) we exploit the nearest existing singular gaps. We include a section with numerical examples that test the performance of our main results. (c) 2024 Elsevier Inc. All rights are reserved, including those for text and data mining, AI training, and similar technologies.