BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CS-TR-66-43
       ENTRY:: January 19, 1996
ORGANIZATION:: Stanford University, Department of Computer Science
       TITLE:: Two working algorithms for the eigenvalues of a symmetric
               tridiagonal matrix
        TYPE:: Technical Report
      AUTHOR:: Kahan, William
      AUTHOR:: Varah, James M.
        DATE:: August 1966
       PAGES:: 32
    ABSTRACT:: Two tested programs are supplied to find the eigenvalues of a
               symmetric tridiagonal matrix. One program uses a
               square-root-free version of the QR algorithm. The other uses
               a compact kind of Sturm sequence algorithm. These programs
               are faster and more accurate than the other comparable
               programs published previously with which they have been
               compared.
       NOTES:: [Adminitrivia V1/Prg/19960119]
         END:: STAN//CS-TR-66-43