Jenkins–Traub algorithm: Difference between revisions

Revision as of 03:43, 5 February 2017

Revision as of 03:44, 5 February 2017

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?==