arXiv · math/9201280
Polynomial root-finding algorithms and branched covers
Abstract
We construct a family of root-finding algorithms which exploit the branched covering structure of a polynomial of degree $d$ with a path-lifting algorithm for finding individual roots. In particular, the family includes an algorithm that computes an $\epsilon$-factorization of the polynomial which has an arithmetic complexity of $\Order{d^2(\log d)^2 + d(\log d)^2|\log\epsilon|}$. At the present time (1993), this complexity is the best known in terms of the degree.
Explore related subjects
Keep this discovery
Myong-Hi Kim, Scott Sutherland. 1991-03-13. Polynomial root-finding algorithms and branched covers. https://doi.org/10.1137/s0097539791201587
Cite the original work for its findings. Save a collection to share your selection of sources.