Name
Title | ||
|---|---|---|
A small probabilistic universal set of starting points for finding roots of complex polynomials by Newton's method. |
Abstract | ||
|---|---|---|
We specify a small set, consisting of O(d(log log d)(2)) points, that intersects the basins under Newton's method of all roots of all (suitably normalized) complex polynomials of fixed degrees d, with arbitrarily high probability. This set is an efficient and universal probabilistic set of starting points to find all roots of polynomials of degree d using Newton's method; the best known deterministic set of starting points consists of [1.1d(log d)(2)] points. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1090/S0025-5718-2012-02640-8 | MATHEMATICS OF COMPUTATION |
Keywords | Field | DocType |
numerical analysis,dynamic system | Discrete mathematics,Combinatorics,Normalization (statistics),Polynomial,Mathematical analysis,Complex quadratic polynomial,Probabilistic logic,Small set,Mathematics,Newton's method,Universal set | Journal |
Volume | Issue | ISSN |
82 | 281 | 0025-5718 |
Citations | PageRank | References |
4 | 0.97 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Béla Bollobás | 1 | 2696 | 474.16 |
| Malte Lackmann | 2 | 4 | 0.97 |
| Dierk Schleicher | 3 | 11 | 5.07 |