Isolating real roots of real polynomials
Kurt Mehlhorn, Michael Sagraloff · 2009
We describe a bisection algorithm for root isolation of polynomials with real coefficients. It is assumed that the coefficients can be approximated with arbitrary precision; exact computation in the field of coefficients is not required. We refer to such coefficients as bitstream coefficients. The algorithm is deterministic and has almost the same asymptotic complexity as the randomized algorithm of [12]. We also discuss a partial extension to multiple roots.