A constructive algorithm for finding the exact roots of polynomials with computable real coefficients. (Q1603892): Difference between revisions

A constructive algorithm for finding the exact roots of polynomials with computable real coefficients is given. After a short introduction to computability and arithmetic and the properties of the roots of polynomials, an error analysis is presented. As the main result the authors prove the dependence of the roots with respect to perturbations of the coefficients. After a discussion of how to align the roots, the complete algorithm, which is based on the algorithms by \textit{M. A. Jenkins} and \textit{J. F. Traub} [SIAM J. Numer. Anal. 7, 545--566 (1970; Zbl 0237.65034)], is described.