Halley's method is an algorithm for finding roots, also known as the tangent hyperbolas method or Halley's rational formula. As in Halley's irrational formula, take the second-order
Taylor series of an analytic
function
|
(1)
|
A root of satisfies
, so
|
(2)
|
Setting the quadratic approximation to zero gives
|
(3)
|
giving
|
(4)
|
Using the estimate from Newton's method,
|
(5)
|
gives
|
(6)
|
so the iteration function is
|
(7)
|
At a simple root ,
,
giving at least cubic convergence for starting values sufficiently close to
. Curiously, the third derivative
|
(8)
|
is the negative of the Schwarzian derivative at . Halley's method may also be derived by applying
Newton's method to
. It may also be derived by using an osculating
curve of the form
|
(9)
|
Taking derivatives,
|
(10)
| |||
|
(11)
| |||
|
(12)
|
which has solutions
|
(13)
| |||
|
(14)
| |||
|
(15)
|
so at a root, and
|
(16)
|
which is Halley's method.
Basti and Cremaschi (2026) proved that the quartic function
|
(17)
|
has four distinct roots, but its Halley map has an extraneous attracting two-cycle, with one point in and the other in
. The absolute
value of its multiplier is less than
. Consequently, a nonempty
open basin of attraction fails to converge
to any root. The same polynomial
also has an extraneous superattracting two-cycle for Newton's
method.