A method of solving an equation in one variable f(x)=0 with a first approximation to the solution x₀ using the iteration $x_{n+1}=x_n-\frac{f\left(x_n\right)}{f\left(x_n\right)-\left(\frac{f\left(x_n\right)f^{″}\left(x_n\right)}{f^{\prime }\left(x_n\right)}\right)}n=0,1,2,\dots$

This method converges faster than Newton’s method, but more computation is required at each iteration, so neither method can claim to be more efficient.