Abstract
Recently, the authors obtained an upper bound on the error for the conjugate gradient method, which is valid in an asymptotic setting as the size of the linear systems tends to infinity. The estimate depends on the asymptotic distribution of eigenvalues, and the ratio between the size and the number of iterations. Such error bounds are related to the existence of polynomials with value 1 at 0 whose supnorm on the spectrum is as small as possible. A possible strategy for constructing such a polynomial p is to select a set S, to specify that every eigenvalue outside S is a zero of p, and then to minimize the supnorm of p on S. Here we show that this strategy can never give a better asymptotic upper bound than the one we obtained before. We also discuss the case where equality is met.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
REFERENCES
B. Beckermann, On a conjecture of E. A. Rakhmanov, Constr. Approx., 16 (2000), pp. 427–448.
B. Beckermann, A note on the convergence of Ritz values for sequences of matrices, Publication ANO 408, Université de Lille, 2000.
B. Beckermann and A. B. J. Kuijlaars, Superlinear convergence of conjugate gradients, SIAM J. Numer. Anal., 39 (2001), pp. 300–329.
P. Billingsley, Convergence of Probability Measures, 2nd ed., John Wiley, New York, 1999.
A. Böttcher and B. Silbermann, Introduction to Large Truncated Toeplitz Matrices, Universitext, Springer-Verlag, New York, 1999.
V. S. Buyarov and E. A. Rakhmanov, Families of equilibrium measures in an external field on the real axis, Siberian Math. J., 190 (1999), pp. 791–802.
P. Deift and K. T.-R. McLaughlin, A continuum limit of the Toda lattice, Mem. Amer. Math. Soc., 131, no. 624 (1998), pp. 1–216.
P. D. Dragnev and E. B. Saff, Constrained energy problems with applications to orthogonal polynomials of a discrete variable, J. Anal. Math., 72 (1997), pp. 223–259.
P. D. Dragnev and E. B. Saff, A problem in potential theory and zero asymptotics of Krawtchouk polynomials, J. Approx. Theory, 102 (2000), pp. 120–140.
T. A. Driscoll, K.-C. Toh, and L. N. Trefethen, From potential theory to matrix iterations in six steps, SIAM Review, 40 (1998), pp. 547–578.
B. Fischer, Polynomial Based Iteration Methods for Symmetric Linear Systems, Wiley-Teubner, New York, 1996.
A. Greenbaum, Comparison of splittings used with the conjugate gradient algorithm, Numer. Math., 33 (1979), pp. 181–193.
A. Greenbaum, Iterative Methods for SolvingLi near Systems, SIAM, Philadelphia, PA, 1997.
A. B. J. Kuijlaars, Which eigenvalues are found by the Lanczos method? SIAM J. Matrix Anal. Appl., 22 (2000), pp. 306–321.
A. B. J. Kuijlaars and E. A. Rakhmanov, Zero distributions for discrete orthogonal polynomials, J. Comput. Appl. Math., 99 (1998), pp. 255–274.
A. B. J. Kuijlaars and W. Van Assche, Extremal polynomials on discrete sets, Proc. London Math. Soc., 79 (1999), pp. 191–221.
O. Nevanlinna, Convergence of Iterations for Linear Equations, Birkhäuser Verlag, Basel, 1993.
E. A. Rakhmanov, Equilibrium measure and the distribution of zeros of the extremal polynomials of a discrete variable, Siberian Math. J., 187 (1996), pp. 1213–1228.
E. B. Saff and V. Totik, Logarithmic Potentials with External Fields, Springer-Verlag, Berlin, 1997.
S. Serra Capizzano, A note on the asymptotic spectra of finite difference discretizations of second order elliptic partial differential equations, Asian J. Math., 4 (2000), pp. 499–514.
S. Serra Capizzano and P. Tilli, From partial differential equations to generalised locally Toeplitz sequences, manuscript.
P. Tilli, Locally Toeplitz sequences: Spectral properties and applications, Linear Algebra Appl., 278 (1998), pp. 91–120.
L. N. Trefethen and D. Bau III, Numerical Linear Algebra, SIAM, Philadelphia, PA, 1997.
E. E. Tyrtyshnikov and N. L. Zamarashkin, Spectra of multilevel Toeplitz matrices: Advanced theory via simple matrix relationships, Linear Algebra Appl., 270 (1998), pp. 15–27.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Beckermann, B., Kuijlaars, A.B.J. On The Sharpness of an Asymptotic Error Estimate for Conjugate Gradients. BIT Numerical Mathematics 41, 856–867 (2001). https://doi.org/10.1023/A:1021964506568
Issue Date:
DOI: https://doi.org/10.1023/A:1021964506568