On the real convergence rate of the conjugate gradient method
We present a parametrized class of matrices for which the rate of convergence of the conjugate gradient method varies greatly with the parameter and does not appreciably depend on the algorithm implementation. A small change in the eigenvalue distribution can lead to a large change in the sensitivit...
Saved in:
| Published in | Linear algebra and its applications Vol. 154; pp. 535 - 549 |
|---|---|
| Main Author | |
| Format | Journal Article |
| Language | English |
| Published |
Elsevier Inc
01.08.1991
|
| Online Access | Get full text |
Cover
Loading…
| Summary: | We present a parametrized class of matrices for which the rate of convergence of the conjugate gradient method varies greatly with the parameter and does not appreciably depend on the algorithm implementation. A small change in the eigenvalue distribution can lead to a large change in the sensitivity of CG to rounding errors. A theorem is proved which gives a necessary and sufficient condition for ordering exact arithmetic CG processes for systems with different spectra according to the energy norm of the error. Theorems 4.1 and 4.2 continue Paige's and Greenbaum's work. |
|---|---|
| ISSN: | 0024-3795 1873-1856 |
| DOI: | 10.1016/0024-3795(91)90393-B |