A convergence analysis for nonsymmetric Lanczos algorithms
HTML articles powered by AMS MathViewer
- by Qiang Ye PDF
- Math. Comp. 56 (1991), 677-691 Request permission
Abstract:
A convergence analysis for the nonsymmetric Lanczos algorithm is presented. By using a tridiagonal structure of the algorithm, some identities concerning Ritz values and Ritz vectors are established and used to derive approximation bounds. In particular, the analysis implies the classical results for the symmetric Lanczos algorithm.References
- George Cybenko, An explicit formula for Lánczos polynomials, Linear Algebra Appl. 88/89 (1987), 99–115. MR 882443, DOI 10.1016/0024-3795(87)90105-4
- Gene H. Golub and Charles F. Van Loan, Matrix computations, Johns Hopkins Series in the Mathematical Sciences, vol. 3, Johns Hopkins University Press, Baltimore, MD, 1983. MR 733103
- Shmuel Kaniel, Estimates for some computational techniques in linear algebra, Math. Comp. 20 (1966), 369–378. MR 234618, DOI 10.1090/S0025-5718-1966-0234618-4
- Cornelius Lanczos, An iteration method for the solution of the eigenvalue problem of linear differential and integral operators, J. Research Nat. Bur. Standards 45 (1950), 255–282. MR 0042791 P. Lancaster and Q. Ye, Rayleigh-Ritz and Lanczos methods for symmetric matrix pencils (submitted).
- Thomas A. Manteuffel, The Tchebychev iteration for nonsymmetric linear systems, Numer. Math. 28 (1977), no. 3, 307–327. MR 474739, DOI 10.1007/BF01389971 C. Paige, The computation of eigenvalues and eigenvectors of very large sparse matrices, Ph.D. dissertation, University of London, 1971.
- Beresford N. Parlett, The symmetric eigenvalue problem, Prentice-Hall Series in Computational Mathematics, Prentice-Hall, Inc., Englewood Cliffs, N.J., 1980. MR 570116
- Beresford N. Parlett, Derek R. Taylor, and Zhishun A. Liu, A look-ahead Lánczos algorithm for unsymmetric matrices, Math. Comp. 44 (1985), no. 169, 105–124. MR 771034, DOI 10.1090/S0025-5718-1985-0771034-2
- Y. Saad, On the rates of convergence of the Lanczos and the block-Lanczos methods, SIAM J. Numer. Anal. 17 (1980), no. 5, 687–706. MR 588755, DOI 10.1137/0717059 —, Projection methods for solving large sparse eigenvalue problems, Matrix Pencils (A. Ruhe and B. Kagstrom, eds.), Lecture Notes in Math., vol. 973, Springer, New York, 1983, pp. 221-244.
- D. S. Scott, How to make the Lanczos algorithm converge slowly, Math. Comp. 33 (1979), no. 145, 239–247. MR 514821, DOI 10.1090/S0025-5718-1979-0514821-5 Q. Ye, Variational principles and numerical algorithms for symmetric matrix pencils, Ph.D. thesis, University of Calgary, 1989.
Additional Information
- © Copyright 1991 American Mathematical Society
- Journal: Math. Comp. 56 (1991), 677-691
- MSC: Primary 65F15
- DOI: https://doi.org/10.1090/S0025-5718-1991-1068826-4
- MathSciNet review: 1068826