BIB-VERSION:: CS-TR-v2.0
          ID:: STAN//CS-TR-67-55
       ENTRY:: January 03, 1996
ORGANIZATION:: Stanford University, Department of Computer Science
       TITLE:: A stopping criterion for polynomial root finding
        TYPE:: Technical Report
      AUTHOR:: Adams, Duane A.
        DATE:: February 1967
       PAGES:: 12
    ABSTRACT:: When solving for the roots of a polynomial, it is generally
               difficult to know just when to terminate the iteration
               process. In this paper an algorithm is derived and discussed
               which allows one to terminate the iteration process on the
               basis of calculated bounds for the roundoff error.
       NOTES:: [Adminitrivia V1/Prg/19960103]
         END:: STAN//CS-TR-67-55