Furthermore , the convergence is slightly faster than the quadratic convergence of Newton -- Raphson iteration , however , it uses at least twice as many operations per step .
The algorithm converges for any distribution of roots , but may fail to find all roots of the polynomial .
The convergence is slightly faster than the quadratic convergence of Newton -- Raphson iteration , however , it uses at least twice as many operations per step .
The algorithm converges for any distribution of roots , but may fail to find all roots of the polynomial .