Analysis of subspace iteration for eigenvalue problems with evolving matrices

The subspace iteration algorithm, a block generalization of the classical power iteration, is known for its excellent robustness properties. Specifically, the algorithm is resilient to variations in the original matrix, and for this reason it has played an important role in applications ranging from density functional theory in electronic structure calculations to matrix completion problems in machine learning, and subspace tracking in signal processing applications. This note explores its convergence properties in the presence of perturbations. The specific question addressed is the following.