Numerical analysis Nonlinear equations Theorem
Halley's method
Statement
Let be a real function that is three times continuously differentiable on an open interval . Let be a simple zero of , that is, and . Halley's method is the iteration Then there is such that for every with the iterates are defined and converge to . The convergence has order at least : for some constant and all .
Remarks
The step is Newton's method applied to . At a simple zero, has the zero and satisfies , and Newton's method on such a function converges cubically. The same formula can be written , evaluated at . Here is the derivative of . For with , the method gives , which roughly triples the number of correct digits of per step near the root. At a multiple zero the order of convergence drops to .
Going deeper
For a student
Each step costs one evaluation of , and . So it pays off when the second derivative is cheap, as for polynomials. It is the case of the Householder family of methods, whose case is Newton's method.
Reading path
To understand this page from the ground up, read these 7 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Limit point of a set definition
- Rate of convergence concept
- Limit of a function definition
- Derivative definition
- Tangent line concept
- Newton's method concept
- Halley's method statement
Where this leads
1 page builds on this one.
Further reading
About this page
| Tag | RPME2B5MS2 |
|---|---|
| URI | m2://RPME2B5MS2 |
| Kind | statement, theorem |
| Writing | W0 stub |
| MSC | 65H05 |
| Status | This copy of the site has no build data. Run m2 status RPME2B5MS2. |
| About | Newton's method |
| Uses | Newton's method, Rate of convergence, Derivative |
| Same as |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- a source with a locator (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.