Let A be a polynomial over Z, Q or Q(IX) where IX is a real algebraic number. The problem is to compute a sequence of disjoint intervals with rational endpoints, each containing exactly one real zero of A and together containing all real zeros of A. We describe an algorithm due to Kronecker based on the minimum root separation, Sturm's algorithm, an algorithm based on Rolle's theorem due to Collins and Loos and the modified Uspensky algorithm due to Collins and Aritas. For the last algorithm a recursive version with correctness proof is given which appears in print for the first time.
CITATION STYLE
Collins, G. E., & Loos, R. (1983). Real Zeros of Polynomials (pp. 83–94). https://doi.org/10.1007/978-3-7091-7551-4_7
Mendeley helps you to discover research relevant for your work.