Abstract
A family of root-finding algorithms is constructed that combines knowledge of the branched covering structure of a polynomial with a path-lifting algorithm for finding individual roots. In particular, the family includes an algorithm that computes an ε-factorization of a polynomial of degree d that has an arithmetic complexity. At the present time, this complexity is the best known in terms of the degree.
| Original language | English |
|---|---|
| Pages (from-to) | 415-436 |
| Number of pages | 22 |
| Journal | SIAM Journal on Computing |
| Volume | 23 |
| Issue number | 2 |
| DOIs | |
| State | Published - 1994 |
Fingerprint
Dive into the research topics of 'Polynomial root-finding algorithms and branched covers'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver