Efficient Implementation of a Class of Preconditioned Conjugate Gradient Methods
- 1 March 1981
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific and Statistical Computing
- Vol. 2 (1) , 1-4
- https://doi.org/10.1137/0902001
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Conjugate gradient type methods for unsymmetric and inconsistent systems of linear equationsLinear Algebra and its Applications, 1980
- An ILUCG algorithm which minimizes in the euclidean normJournal of Computational Physics, 1979
- Alternating methods for sets of linear equationsNumerische Mathematik, 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
- A GENERALIZED CONJUGATE GRADIENT METHOD FOR THE NUMERICAL SOLUTION OF ELLIPTIC PARTIAL DIFFERENTIAL EQUATIONSPublished by Elsevier ,1976
- THE ANALYSIS AND APPLICATION OF SPARSE MATRIX ALGORITHMS IN THE FINITE ELEMENT METHODPublished by Elsevier ,1973
- A generalized SSOR methodBIT Numerical Mathematics, 1972
- An Approximate Factorization Procedure for Solving Self-Adjoint Elliptic Difference EquationsSIAM Journal on Numerical Analysis, 1968
- Methods of conjugate gradients for solving linear systemsJournal of Research of the National Bureau of Standards, 1952