A STOPPING CRITERION FOR POLYNOMIAL ROOT FINDING.

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. (Author)

Document Details

Document Type
Technical Report
Publication Date
Feb 10, 1967
Accession Number
AD0647200

Entities

People

  • Duane A. Adams

Organizations

  • Stanford University

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algorithms
  • Iterations
  • Mathematics
  • Polynomials

Fields of Study

  • Mathematics

Readers

  • Approximation Theory.
  • Operations Research