A convergencea nalysis for nonsymmetric lanczos algorithms

Research output: Contribution to journalArticlepeer-review

21 Scopus citations


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.

Original languageEnglish
Pages (from-to)677-691
Number of pages15
JournalMathematics of Computation
Issue number194
StatePublished - Apr 1991


  • Convergence bound
  • Lanczos algorithm
  • Tridiagonal matrices

ASJC Scopus subject areas

  • Algebra and Number Theory
  • Computational Mathematics
  • Applied Mathematics


Dive into the research topics of 'A convergencea nalysis for nonsymmetric lanczos algorithms'. Together they form a unique fingerprint.

Cite this