Conjugate direction methods for solving systems of linear equations

Research paper by G. W. Stewart

Indexed on: 01 Aug '73Published on: 01 Aug '73Published in: Numerische Mathematik


A generalization of the notion of a set of directions conjugate to a matrix is shown to lead to a variety of finitely terminating iterations for solving systems of linear equations. The errors in the iterates are characterized in terms of projectors constructable from the conjugate directions. The natural relations of the algorithms to well known matrix decompositions are pointed out. Some of the algorithms can be used to solve linear least squares problems.