Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
1991
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/math/9201280 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Table of Contents:
- 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 $ε$-factorization of the polynomial which has an arithmetic complexity of $\Order{d^2(\log d)^2 + d(\log d)^2|\logε|}$. At the present time (1993), this complexity is the best known in terms of the degree.