Abstract
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.
Similar content being viewed by others
References
Fox, L., Huskey, H. D., Wilkinson, J. H.: Notes on the solution of algebraic linear simultaneous equations. Quart. J. Mech. Appl. Math.1, 149–173 (1948)
Golub, G. H., Kahan, W.: Calculating the singular values and pseudo inverse of a matrix. J. SIAM Ser. B. Numer. Anal.2, 205–224 (1965)
Hestenes, Magnus R., Stiefel, Eduard: The method of conjugate gradients for solving linear systems. J. Res. Nat. Bur. Standards49, 409–436 (1952)
Householder, A. S.: Terminating and nonterminating iterations for solving linear systems. J. Soc. Indust. Appl. Math.3, 67–72 (1955)
Householder, A. S.: The theory of matrices in numerical analysis. New York: Blaisdell 1964
Lanczos, C.: An iteration for the solution of the eigenvalue problem of linear differential and integral operators. J. Res. Nat. Bur. Standards45, 164–206 (1950)
Wilkinson, J. H.: The algebraic eigenvalue problem. Oxford: Clarendon 1965
Author information
Authors and Affiliations
Additional information
This work was supported by the Office of Naval Research under contract number N 00014-67-A-0126.
Rights and permissions
About this article
Cite this article
Stewart, G.W. Conjugate direction methods for solving systems of linear equations. Numer. Math. 21, 285–297 (1973). https://doi.org/10.1007/BF01436383
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01436383