Accession Number : AD0638799

Title :   RELAXATION METHODS FOR SEMI-DEFINITE SYSTEMS.

Descriptive Note : Technical rept.

Corporate Author : STANFORD UNIV CALIF DEPT OF COMPUTER SCIENCE

Personal Author(s) : Kahan,W.

Report Date : 09 AUG 1966

Pagination or Media Count : 35

Abstract : Certain non-stationary relaxation iterations, which are commonly applied to positive definite symmetric systems of linear equations, are also applicable to a semi-definite system provided that system is consistent. Some of the convergence theory of the former application is herein extended to the latter application. The effects of rounding errors and of inconsistency are discussed too, but with few helpful conclusions. Finally, the application of these relaxation iterations to an indefinite system is shown here to be ill-advised because these iterations will almost certainly diverge exponentially. (Author)

Descriptors :   (*ITERATIONS, *MATRICES(MATHEMATICS)), EQUATIONS

Subject Categories : Theoretical Mathematics

Distribution Statement : APPROVED FOR PUBLIC RELEASE