Abstract
In this note we investigate the Chebyshev iteration and the conjugate gradient method applied to the system of linear equations Ax = f where A is a symmetric, positive definite matrix. For both methods we present algorithms which approximate during the iteration process the kth error $k= ||x − xk||A. The algorithms are based on the theory of modified moments and Gaussian quadrature. The proposed schemes are also applicable for other polynomial iteration schemes. Several examples, illustrating the performance of the described methods, are presented.
Original language | English |
---|---|
Title of host publication | Recent Advances in Iterative Methods |
Editors | Gene Golub, Mitchell Luskin, Anne Greenbaum |
Number of pages | 9 |
Volume | 60 |
Place of Publication | New York, NY |
Publisher | Springer New York LLC |
Publication date | 1994 |
Pages | 59-67 |
ISBN (Print) | 978-1-4613-9355-9 |
ISBN (Electronic) | 978-1-4613-9353-5 |
DOIs | |
Publication status | Published - 1994 |