Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 5 Jul 2021 in math.NA, cs.NA, and math.FA | (2107.01990v4)

Abstract: We develop a novel convergence analysis of the classical deterministic block Krylov methods for the approximation of hh-dimensional dominant subspaces and low-rank approximations of matrices A∈Km×n A\in\mathbb K^{m\times n} (where K=R\mathbb K=\mathbb R or C)\mathbb C) in the case that there is no singular gap at the index hh i.e., if σh=σh+1\sigma_h=\sigma_{h+1} (where σ1≥…≥σp≥0\sigma_1\geq \ldots\geq \sigma_p\geq 0 denote the singular values of A A, and p=min⁡{m,n}p=\min\{m,n\}). Indeed, starting with a (deterministic) matrix X∈Kn×r X\in\mathbb K^{n\times r} with r≥hr\geq h satisfying a compatibility assumption with some hh-dimensional right dominant subspace of AA, 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 hh (which is zero in this case) we exploit the nearest existing singular gaps.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.