Halley's method

In numerical analysis, Halley's method is a root-finding algorithm used for functions of one real variable with a continuous second derivative. It is named after its inventor Edmond Halley. The algorithm is second in the class of Householder's methods, after Newton's method. Like the latter, it iteratively produces a sequence of approximations to the root; their rate of convergence to the root is cubic. Multidimensional versions of this method exist. Halley's method exactly finds the roots of a linear-over-linear Padé approximation to the function, in contrast to Newton's method or the Secant method which approximate the function linearly, or Muller's method which approximates the function quadratically. Edmond Halley was an English mathematician who introduced the method now called by his name. Halley's method is a numerical algorithm for solving the nonlinear equation f(x) = 0. In this case, the function f has to be a function of one real variable. The method consists of a sequence of iterations: beginning with an initial guess x0. If f is a three times continuously differentiable function and a is a zero of f but not of its derivative, then, in a neighborhood of a, the iterates xn satisfy: This means that the iterates converge to the zero if the initial guess is sufficiently close, and that the convergence is cubic. The following alternative formulation shows the similarity between Halley's method and Newton's method. The expression is computed only once, and it is particularly useful when can be simplified: When the second derivative is very close to zero, the Halley's method iteration is almost the same as the Newton's method iteration. Consider the function Any root of f which is not a root of its derivative is a root of g; and any root r of g must be a root of f provided the derivative of f at r is not infinite. Applying Newton's method to g gives with and the result follows. Notice that if f′ (c) = 0, then one cannot apply this at c because g(c) would be undefined. Suppose a is a root of f but not of its derivative.

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related publications (23)

Related concepts (4)

Related courses (1)

Related lectures (32)

ChE-312: Numerical methods

This course introduces students to modern computational and mathematical techniques for solving problems in chemistry and chemical engineering. The use of introduced numerical methods will be demonstr

Secant method

In numerical analysis, the secant method is a root-finding algorithm that uses a succession of roots of secant lines to better approximate a root of a function f. The secant method can be thought of as a finite-difference approximation of Newton's method. However, the secant method predates Newton's method by over 3000 years. For finding a zero of a function f, the secant method is defined by the recurrence relation. As can be seen from this formula, two initial values x0 and x1 are required.

Root-finding algorithms

In mathematics and computing, a root-finding algorithm is an algorithm for finding zeros, also called "roots", of continuous functions. A zero of a function f, from the real numbers to real numbers or from the complex numbers to the complex numbers, is a number x such that f(x) = 0. As, generally, the zeros of a function cannot be computed exactly nor expressed in closed form, root-finding algorithms provide approximations to zeros, expressed either as floating-point numbers or as small isolating intervals, or disks for complex roots (an interval or disk output being equivalent to an approximate output together with an error bound).

Newton's method

In numerical analysis, Newton's method, also known as the Newton–Raphson method, named after Isaac Newton and Joseph Raphson, is a root-finding algorithm which produces successively better approximations to the roots (or zeroes) of a real-valued function. The most basic version starts with a single-variable function f defined for a real variable x, the function's derivative f′, and an initial guess x0 for a root of f. If the function satisfies sufficient assumptions and the initial guess is close, then is a better approximation of the root than x0.

Phase diagram of the J-Jd Heisenberg model on the maple leaf lattice: Neural networks and density matrix renormalization group

Pratyay Ghosh, Ronny Thomale

We microscopically analyze the nearest-neighbor Heisenberg model on the maple leaf lattice through neural quantum state (NQS) and infinite density matrix renormalization group (iDMRG) methods. Embarking to parameter regimes beyond the exact dimer singlet g ...

Amer Physical Soc2024

Computational conceptual design — typological exploration of spatial truss systems through optimization

Corentin Jean Dominique Fivet, Pierluigi D'Acunto, Jonas Warmuth

Exploring a wide range of design options is crucial for every sound conceptual design process. In the conventional structural design workflow, optimization techniques are generally employed to generate well-performing design options. However, focusing only ...

International Association for Shell and Spatial Structures (IASS)2023

Molecular profiling of stem cell-derived retinal pigment epithelial cell differentiation established for clinical translation

Gioele La Manno, Alex Russell Lederer, Irina Khven

Human embryonic stem cell-derived retinal pigment epithelial cells (hESC-RPE) are a promising cell source to treat age-related macular degeneration (AMD). Despite several ongoing clinical studies, a detailed mapping of transient cellular states during in v ...

CELL PRESS2022

Newton's Method: Graphical Approach MATH-250: Numerical analysis

Illustrates the Newton's method graphically, discussing convergence and extreme cases.

Untitled

Finite Difference Method MOOC: Numerical Analysis for Engineers

Summarizes the finite difference method for solving one-dimensional limit problems.