Faster Numerical Univariate Polynomial Root-Finding by Means of Subdivision Iterations

Abstract

Root-finding for a univariate polynomial is four millennia old and still highly important for Computer Algebra and various other fields. Subdivision root-finders for a complex univariate polynomial are known to be highly efficient and practically promising. The recent one by Becker et al. [] competes for user’s choice and is nearly optimal for dense polynomials represented in monomial basis, but [] proposes and analyzes further significant acceleration, which becomes dramatic for polynomials admitting their fast evaluation (e.g., sparse ones). Here and in the companion paper [], we present some of these results and algorithms.