Part of the Lecture Notes in Mathematics book series (LNM, volume 506)
Conjugate gradient methods for indefinite systems
KeywordsConjugate Gradient Recurrence Relation Conjugate Gradient Method Gradient Algorithm Conjugate Gradient Algorithm
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- 4.Lawson, C.L., Sparse Matrix Methods Based on Orthogonality and Conjugacy, Jet Propulsion Lab., Tech. Memo. 33–627, 1973.Google Scholar
- 6.Paige, C.C., and Saunders, M.A., Solution of sparse indefinite systems of equations and least squares problems, Stanford University Report, STAN-CS-73-399, 1973.Google Scholar
- 7.Reid, J.K., On the Method of Conjugate Gradients for the Solution of Large Sparse Systems of Linear Equations, pp. 231–254 in Large Sparse Systems of Linear Equations, ed. J.K. Reid, Academic Press, London, 1971.Google Scholar
- 8.Rutishauser, H., Theory of gradient methods, Chapter 2 of Refined iterative methods for computation of the solution and the eigenvalues of self-adjoint boundary value problems, by M. Engeli, Th. Ginsburg, H. Rutishauser, and E. Stiefel, Birkhaüser, Basel, 1959.Google Scholar
© Springer-Verlag 1976