The problem of (numerically) finding roots of nonlinear equations is one of the oldest and most thoroughly researched areas of mathematics , yet new and surprising approaches are constantly being discovered. One such new approach was published recently in . Their approach is iterative and closely related to the classical Newton–Raphson method, yet in many cases appears to be considerably more effective. The idea of this new approach is very simple. Consider the equation
is a sufficiently smooth (not necessarily polynomial) complex function. Let
be our initial "guess" of the value of the root. Suppose we found a smooth function
, which is invertible in some neighborhood of
. The Taylor expansion for
in a neighborhood of
this is just the usual Taylor expansion). We will use the function
as an approximation of
, and seek
, which amounts to
. The resulting iterative scheme
is convergent of order 3 rather than 2 as is the case with the usual Newton–Raphson method, but it does not require the computation of second-order derivatives. The choice of a suitable
is not unique; the ones considered in  are
. Different choices of
work better for different types of equations.
Here we use only the first form. The method has been extended to multivariate equations in . It has many interesting properties that can be seen in the Demonstration, including the ability to find complex roots starting with real initial values.
 J. Stoer and R. Bulirsch, Introduction to Numerical Analysis
, 2nd ed., New York: Springer 1993.
 R. Oftadeh, M. Nikkhah–Bahrami, and A. Najafi, "A Novel Cubically Convergent Iterative Method for Computing Complex Roots of Nonlinear Equations," Applied Mathematics and Computation
(6), 2010 pp. 2608–2618.
 M. Nikkhah–Bahrami and R. Oftadeh, "An Effective Iterative Method for Computing Real and Complex Roots of Systems of Nonlinear Equations," Applied Mathematics and Computation
(5), 2009 pp. 1813–1820.