A New Method for Real Root Isolation of Univariate Polynomials

A new algorithm for real root isolation of univariate polynomials is proposed, which is mainly based on exact interval arithmetic and bisection method. Although exact interval arithmetic is usually supposed to be inefficient, our algorithm is surprisingly fast because the termination condition of our algorithm is different from those of existing algorithms which are mostly based on Descartes’ rule of signs or Vincent’s theorem and we decrease the times of Taylor shifts in some cases. We test our algorithm on a large number of examples from the literature and report the performance.