Accession Number : AD0638818
Title : RELAXATION METHODS FOR AN EIGENPROBLEM.
Descriptive Note : Technical rept.
Corporate Author : STANFORD UNIV CALIF DEPT OF COMPUTER SCIENCE
Personal Author(s) : Kahan,W.
Report Date : 08 AUG 1966
Pagination or Media Count : 37
Abstract : A theory is developed to account for the convergence properties of certain relaxation iterations which have been widely used to solve an eigenproblem 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 a previous report (AD-638 799). (Author)
Descriptors : (*ITERATIONS, *MATRICES(MATHEMATICS)), THEORY
Subject Categories : Theoretical Mathematics
Distribution Statement : APPROVED FOR PUBLIC RELEASE