Answers are grounded in this paper and cite their sources.
Some methods to bound individual eigenvalues of a generalized eigenvalue problem λ Cx = Ax are presented, both for general positive semidefinite matrices and for the special case where C is an incomplete factorization of A. This provides accurate estimates of the rate of convergence of preconditioned conjugate gradient methods to solve linear systems with A. In particular, methods are presented to actually numerically compute bounds of the extreme eigenvalues. The estimates enable us to compare modified and unmodified incomplete factorization methods.
No takes yet. Share an insight, caveat, or question.
Owe Axelsson (1992) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: