Solving Sparse Symmetric Sets of Linear Equations by Preconditioned Conjugate Gradients
- 1 June 1980
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Mathematical Software
- Vol. 6 (2) , 206-219
- https://doi.org/10.1145/355887.355893
Abstract
No abstract availableThis publication has 7 references indexed in Scilit:
- New factorization codes for sparse, symmetric and positive definite matricesBIT Numerical Mathematics, 1979
- A class of preconditioned conjugate gradient methods for the solution of a mixed finite element discretization of the biharmonic operatorInternational Journal for Numerical Methods in Engineering, 1979
- A class of first order factorization methodsBIT Numerical Mathematics, 1978
- The incomplete Cholesky—conjugate gradient method for the iterative solution of systems of linear equationsJournal of Computational Physics, 1978
- Partial EliminationIMA Journal of Applied Mathematics, 1977
- Yale Sparse Matrix Package. II. The Nonsymmetric CodesPublished by Defense Technical Information Center (DTIC) ,1977
- Methods of conjugate gradients for solving linear systemsJournal of Research of the National Bureau of Standards, 1952