BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CS-TR-77-634
       ENTRY:: June 28, 1995
ORGANIZATION:: Stanford University, Department of Computer Science
       TITLE:: A new proof of global convergence for the tridiagonal QL
               algorithm
        TYPE:: Technical Report
      AUTHOR:: Hoffmann, Walter
      AUTHOR:: Parlett, Beresford N.
        DATE:: October 1977
       PAGES:: 20
    ABSTRACT:: By exploiting the relation of the QL algorithm to inverse
               iteration we obtain a proof of global convergence which is
               more conceptual and less computational than previous
               analyses. The proof uses a new, but simple, error estimate
               for the first step of inverse iteration.
       NOTES:: [Adminitrivia V1/Prg/19950628]
         END:: STAN//CS-TR-77-634