Theoretical and Computable Optimal Subspace Expansions for Matrix Eigenvalue Problems
arXiv:2004.04928 · doi:10.1137/20M1331032
Abstract
Consider the optimal subspace expansion problem for the matrix eigenvalue problem : Which vector in the current subspace , after multiplied by , provides an optimal subspace expansion for approximating a desired eigenvector in the sense that has the smallest angle with the expanded subspace , i.e., ? This problem is important as many iterative methods construct nested subspaces that successively expand to . An expression of by Ye (Linear Algebra Appl., 428 (2008), pp. 911--918) for general, but it could not be exploited to construct a computable (nearly) optimally expanded subspace. He turns to deriving a maximization characterization of for a {\em given} when is Hermitian. We generalize Ye's maximization characterization to the general case and find its maximizer. Our main contributions consist of explicit expressions of , and the optimally expanded subspace for general, where is the orthogonal projector onto . These results are fully exploited to obtain computable optimally expanded subspaces within the framework of the standard, harmonic, refined, and refined harmonic Rayleigh--Ritz methods. We show how to efficiently implement the proposed subspace expansion approaches. Numerical experiments demonstrate the effectiveness of our computable optimal expansions.
21 pages, 2 figures. SIAM Journal on Matrix Analysis and Applications, accepted, December 23, 2021