Name
Title | ||
|---|---|---|
A near-optimal subdivision algorithm for complex root isolation based on the Pellet test and Newton iteration. |
Abstract | ||
|---|---|---|
We describe a subdivision algorithm for isolating the complex roots of a polynomial F∈C[x]. Given an oracle that provides approximations of each of the coefficients of F to any absolute error bound and given an arbitrary square B in the complex plane containing only simple roots of F, our algorithm returns disjoint isolating disks for the roots of F in B. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1016/j.jsc.2017.03.009 | Journal of Symbolic Computation |
Keywords | Field | DocType |
Root finding,Root isolation,Approximate arithmetic,Certified computation,Complexity analysis,Complex roots,Subdivision methods | Discrete mathematics,Combinatorics,Complex number,Polynomial,Quadratic equation,Complex plane,Root-finding algorithm,Rate of convergence,Properties of polynomial roots,Mathematics,Newton's method | Journal |
Volume | ISSN | Citations |
86 | 0747-7171 | 0 |
PageRank | References | Authors |
0.34 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ruben Becker | 1 | 31 | 5.27 |
| Michael Sagraloff | 2 | 339 | 22.61 |
| Vikram Sharma | 3 | 229 | 20.35 |
| Chee-Keng Yap | 4 | 1996 | 395.32 |