Jenkins–Traub algorithm: Difference between revisions

Content deleted Content added
m Reverting possible vandalism by 116.237.90.177 to version by Yobot. False positive? Report it. Thanks, ClueBot NG. (480529) (Bot)
Line 88:
 
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.
ooo
 
==What gives the algorithm its power?==