Abstract
The Lanczos and the Conjugate Gradient method both compute implicitly a sequence of Gauss quadrature approximations to a certain Riemann-Stieltjes integral. In finite precision computations the corresponding weight function will be slightly perturbed. The purpose of this paper is to solve a conjecture posed by Anne Greenbaum and Zdeněk Strakoš on the stabilization of weights for the Gauss quadrature approximations, i.e. in particular we prove that for a tight well separated cluster of Ritz values (nodes) an upper bound for the change in the sum of the corresponding weights can be developed that depends mainly on the ratio of the cluster diameter and the gap in the spectrum.
Similar content being viewed by others
References
L. V. Ahlfors, Complex Analysis, McGraw-Hill, 3. ed., New York, 1979.
P. J. Davis and P. Rabinowitz, Methods of numerical integration, Academic Press, 1975.
G. Freud, Orthogonal Polynomials, Pergamon Press, 1971.
G. H. Golub and G. Meurant, Matrices, Moments and Quadrature II; How to compute the norm of the error in iterative methods, BIT, 37 (1997), pp. 687–705.
G. H. Golub and Z. Strakoš, Estimates in quadratic formulas, Numer. Algorithms, 8 (1994), pp. 241–268.
G. H. Golub and C. van Loan, Matrix Computations, The Johns Hopkins University Press, 2nd ed. 1989.
A. Greenbaum, Behavior of Slightly Perturbed Lanczos and Conjugate-Gradient Recurrences, Linear Algebra Appl., 113 (1989), pp. 7–63.
A. Greenbaum and Z. Strakoš, Predicting the behavior of finite precision Lanczos and conjugate gradient computations, SIAM J. Matrix Anal. Appl., 13 (1992), pp. 121–137.
L. A. Knizhnerman, The quality of approximations to an isolated eigenvalue and the distribution of Ritz numbers in the simple Lanczos procedure, Comput. Maths. Math. Phys., 35, No. 10, (1995), pp. 1175–1187.
C. Lanczos, An iteration method for the solution of the eigenvalue problem of linear differential and integral operators, J. Res. Nat. Bur. Standards, 45 (1950), pp. 255–282.
G. Meurant, The computation of bounds for the norm of the error in the conjugate gradient algorithm, Numer. Algorithms, 16 (1997), pp. 77–87.
C. C. Paige, The computation of eigenvalues and eigenvectors of very large sparse matrices, Ph.D. Thesis, London University, Institute of Computer Science, London, 1971.
C. C. Paige, Error analysis of the Lanczos Algorithm for tridiagonalizing a symmetric matrix, J. Inst. Maths. Appl., 18 (1976), pp. 341–349.
C. C. Paige, Accuracy and effectiveness of the Lanczos Algorithm for the symmetric eigenproblem, Linear Algebra Appl., 34 (1980), pp. 235–258.
B. N. Parlett, The Symmetric Eigenvalue Problem, Prentice Hall, Englewood Cliffs, N. J. 1980.
B. N. Parlett, Do we fully understand the symmetric Lanczos algorithm yet?, Proceedings of the Cornelius Lanczos International Centenary Conference (Raleigh, NC, 1993), pp. 93–107, SIAM, Philadelphia, PA, 1994.
Z. Strakoš, On the real convergence rate of the Conjugate Gradient method, Linear Algebra Appl., 154–156 (1991), pp. 535–549.
Z. Strakoš and A. Greenbaum, Open questions in the convergence analysis of the Lanczos process for the real symmetric eigenvalue problem, IMA Research Report 934, March 1992.
Z. Strakoš and P. Tichý, On error estimation in the conjugate gradient method and why it works in finite precision computations, Electron. Trans. Numer. Anal., 13 (2002), pp. 56–80.
R. C. Thompson and P. McEnteggert, Principal submatrices II: The upper and lower quadratic inequalities, Linear Algebra Appl., 1 (1968), pp. 211–243.
W. Wülling, On stabilization and convergence of clustered Ritz values in the Lanczos method, submitted to SIAM J. Matrix Anal. Appl.
Author information
Authors and Affiliations
Corresponding author
Additional information
AMS subject classification (2000)
65F10, 65F15, 65F50
Rights and permissions
About this article
Cite this article
Wülling, W. The Stabilization of Weights in the Lanczos and Conjugate Gradient Method. Bit Numer Math 45, 395–414 (2005). https://doi.org/10.1007/s10543-005-0017-0
Issue Date:
DOI: https://doi.org/10.1007/s10543-005-0017-0