Content deleted Content added
Add link to python implementation of algorithm |
|||
Line 89:
The algorithm converges for any distribution of roots, but may fail to find all roots of the polynomial. Furthermore, the convergence is slightly faster than the [[Rate of convergence|quadratic convergence]] of Newton–Raphson iteration, however, it uses at least twice as many operations per step.
test
==What gives the algorithm its power?==
| |||