Halley's Method — Definition, Formula & Example
Halley's method is a way to approximate a solution of by repeatedly improving a guess. It uses the first and second derivatives, so each step usually roughly triples the number of correct digits.
Let be three times continuously differentiable near a simple root , meaning and . Halley's method generates the sequence . For sufficiently close to , the sequence converges to with order 3. That is, for some constant . It is equivalent to applying Newton's method to .
Key Formula
Where:
- = Current approximation of the root
- = Next, improved approximation
- = Function value at the current guess
- = First derivative at the current guess
- = Second derivative at the current guess
Worked Example
Problem: Approximate by applying one step of Halley's method to with starting guess . Compare the result with one step of Newton's method.
Step 1: Find the derivatives, and . Then evaluate all three at .
Step 2: Substitute these values into Halley's formula and simplify the fraction.
Step 3: Compare with the true value . One Newton step gives . Halley's single step is about 40 times more accurate.
Answer: After one step of Halley's method, . This is already within of .
Why It Matters
Halley's method is useful when costs little to compute, as with polynomials and many special functions. Some cube-root and reciprocal-square-root routines use Halley-type steps because fewer iterations mean faster code. In a numerical analysis course, it is the standard example of a third-order method. It shows how extra derivative information buys a higher order of convergence.
Common Mistakes
Mistake: Writing the denominator as , or dropping the factor of 2 in front of .
Correction: The denominator is , with a minus sign. A wrong sign or a missing 2 still gives numbers, but the cubic convergence is lost. A quick check for the missing 2 is to set : the formula should reduce to Newton's step, . That check cannot catch a wrong sign, so compare the sign with the formula above.
