Abstract

An iterative algorithm is given for solving a system Ax=k of n linear equations in n unknowns. The solution is given in n steps. It is shown that this method is a special case of a very general method which also includes Gaussian elimination. These general algorithms are essentially algorithms for finding an n dimensional ellipsoid. Connections are made with the theory of orthogonal polynomials and continued fractions.

Keywords

ConjugateConjugate gradient methodComputer scienceMathematicsApplied mathematicsMathematical analysisAlgorithm

Related Publications

Preconditioning of Truncated-Newton Methods

In this paper we discuss the use of truncated-Newton methods, a flexible class of iterative methods, in the solution of large-scale unconstrained minimization problems. At each ...

1985 SIAM Journal on Scientific and Statis... 175 citations

The Theory of Matrices

Volume 2: XI. Complex symmetric, skew-symmetric, and orthogonal matrices: 1. Some formulas for complex orthogonal and unitary matrices 2. Polar decomposition of a complex matrix...

1984 8577 citations

Publication Info

Year
1952
Type
article
Volume
49
Issue
6
Pages
409-409
Citations
7835
Access
Closed

External Links

Social Impact

Social media, news, blog, policy document mentions

Citation Metrics

7835
OpenAlex

Cite This

Magnus R. Hestenes, Eduard Stiefel (1952). Methods of conjugate gradients for solving linear systems. Journal of research of the National Bureau of Standards , 49 (6) , 409-409. https://doi.org/10.6028/jres.049.044

Identifiers

DOI
10.6028/jres.049.044