m-Step Preconditioned Conjugate Gradient Methods
Copyright policy )m-Step Preconditioned Conjugate Gradient Methods
The paper deals with the solution of a sparse system of symmetric positive definite linear equations by preconditioned conjugate gradient methods. Necessary and sufficient conditions are found for the applicability of preconditioners that are based on taking m steps of an iterative method. The computer implementation of these methods is discussed.
- National Aeronautics and Space Administration United States
- Langley Research Center United States
Iterative numerical methods for linear systems, Computational methods for sparse matrices, Numerical computation of matrix norms, conditioning, scaling, symmetric successive overrelaxation, preconditioned conjugate gradient, multi-color ordering
Iterative numerical methods for linear systems, Computational methods for sparse matrices, Numerical computation of matrix norms, conditioning, scaling, symmetric successive overrelaxation, preconditioned conjugate gradient, multi-color ordering
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).65 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 1% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Top 10%
Citations provided by BIP!Popularity provided by BIP!