A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
A Convergence Analysis for Nonsymmetric Lanczos Algorithms
1991
Mathematics of Computation
Preserved Fulltext
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.
doi:10.2307/2008401
fatcat:u6mxnqvr4jem7fbksar3vaerze