An O(nlog/sup 3/ n) algorithm for the real root problem

Given a univariate complex polynomial f(x) of degree n with rational coefficients expressed as a ratio of two integers <2/sup m/, the root problem is to find all the roots of f(x) up to specified precision 2/sup -/spl mu//. In this paper we assume the arithmetic model for computation. We give an algorithm for the real root problem: where all the roots of the polynomial are real. Our real root algorithm has time cost of O(nlog/sup 2/ n(log n+log b)), where b=m+/spl mu/, thus has time bound O(nlog/sup 3/ n) even in the case of high precision m+/spl mu//spl les/n/sup O(1/). This is within a small polylog factor of optimality, thus (perhaps surprisingly) upper bounding the arithmetic complexity of our real root problem to nearly the same as basic arithmetic operations on polynomials. We require only /spl pi/=O(n(/spl mu/+m+n)) bits of precision to carry out our computations. The Boolean complexity of our algorithm is a multiplicative factor of M(/spl pi/)=O(/spl pi/(log /spl pi/)loglog /spl pi/) more.<
>