Relaxation methods for an eigenproblem

[摘要] A theory is developed to account for the convergence properties of certain relaxation iterations which have been widely used to solve the eigenproblem $(A - \lambda B) \underline{x} = 0, \underline{x} \neq 0, with large symmetric matrices A and B and positive definite B. These iterations always converge, and almost always converge to the right answer. Asymptotically, the theory is essentially that of the relaxation iteration applied to a semi-definite linear system discussed in the author's previous report [Stanford University Computer Science Department report CS45, 1966].

[学科分类] 计算机科学（综合）