Advertisement

How Orthogonality is Lost in Krylov Methods

  • Jens-Peter M. Zemke
Conference paper

Abstract

In this paper we examine the behaviour of finite precision Krylov methods for the algebraic eigenproblem. Our approach presupposes only some basic knowledge in linear algebra and may serve as a basis for the examination of a wide variety of Krylov methods. The analysis carried out does not yield exact bounds on the accuracy of Ritz values or the speed of convergence of finite precision Krylov methods, but helps understanding the principles underlying the behaviour of finite precision Krylov methods.

Keywords

Machine Precision Krylov Subspace Floating Point Step Number Lanczos Method 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Arnoldi, W.E. (1951): The Principle of Minimized Iterations in the Solution of the Matrix Eigenvalue Problem. Quarterly of Applied Mathematics. 9:17–29MathSciNetMATHGoogle Scholar
  2. Golub, G.H., van Loan, C.F. (1996): Matrix Computations (3rd edition). The John Hopkins Cniversity Press, BaltimoreMATHGoogle Scholar
  3. Greenbaum, A. (1989): Behaviour of Slightly Perturbed Lanczos and ConjugateGradient Recurrences. Linear Algebra and its Applications. 113:7–63MathSciNetMATHCrossRefGoogle Scholar
  4. Horn, R.A., Johnson, C.R. (1994): Topics in Matrix Analysis. Cambridge University Press, CambridgeMATHGoogle Scholar
  5. Kaniel, S. (1966): Estimates for Some Computational Techniques in Linear Algebra. Math. Comp. 20:369–378MathSciNetMATHCrossRefGoogle Scholar
  6. Lanczos, C. (1950): An Iteration Method for the Solution of the Eigenvalue Problem of Linear Differential and Integral Operators. Journal of Research of the National Bureau of Standards. 45(4):255–282MathSciNetCrossRefGoogle Scholar
  7. Lanczos, C. (1952): Solution of Systems of Linear Equations by Minimized Iterations. Journal of Research of the National Bureau of Standards. 49(1):33–53MathSciNetCrossRefGoogle Scholar
  8. Paige, C.C. (1969): Error Analysis of the Generalized Hessenberg Processes for the Eigenproblem. Tech. Note ICSI 179, London University Institute of Computer ScienceGoogle Scholar
  9. Paige, C.C. (1971): The Computation of Eigenvalues and Eigenvectors of Ver)' Large Sparse Matrices. PhD thesis, London University Institute of Computer ScienceGoogle Scholar
  10. Parlett, B.N. (1998): The Symmetric Eigenvalue Problem. Classics in Applied Mathematics. SIAM, Philadelphia. Unabridged, corrected republication of 1980 editionGoogle Scholar
  11. Saad, Y. (1980): On the Rates of Convergence of the Lanczos and the Block-Lanczos Methods. SIAM J. Numer. Anal. 17(5):687–706MathSciNetMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Wien 2001

Authors and Affiliations

  • Jens-Peter M. Zemke

There are no affiliations available

Personalised recommendations