A STOPPING CRITERION FOR POLYNOMIAL ROOT FINDING.
STANFORD UNIV CALIF DEPT OF COMPUTER SCIENCE
Pagination or Media Count:
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. Author
- Theoretical Mathematics