Year: 1989
Journal of Computational Mathematics, Vol. 7 (1989), Iss. 2 : pp. 209–216
Abstract
Preconditionings have proved to be a powerful technique for accelerating the rate of convergence of an iterative method. This paper, which is concerned with the conjugate gradient algorithm for large matrix computations, investigates an approximate polynomial preconditioning strategy. The method is particularly attractive for implementation on vector computers.
You do not have full access to this article.
Already a Subscriber? Sign in as an individual or via your institution
Journal Article Details
Publisher Name: Global Science Press
Language: English
DOI: https://doi.org/1989-JCM-9471
Journal of Computational Mathematics, Vol. 7 (1989), Iss. 2 : pp. 209–216
Published online: 1989-01
AMS Subject Headings:
Copyright: COPYRIGHT: © Global Science Press
Pages: 8