Report Number: CS-TR-67-55
Institution: Stanford University, Department of Computer Science
Title: A stopping criterion for polynomial root finding
Author: Adams, Duane A.
Date: February 1967
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.