On the real convergence rate of the conjugate gradient method

Citations of this article
Mendeley users who have this article in their library.


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. © 1991.




Strakoš, Z. (1991). On the real convergence rate of the conjugate gradient method. Linear Algebra and Its Applications, 154156(C), 535–549. https://doi.org/10.1016/0024-3795(91)90393-B

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free