H

Halley's method

Method of numerically finding roots of a function

In numerical analysis, Halley's method is a root-finding algorithm used for functions of one real variable with a continuous second derivative. Edmond Halley was an English mathematician and astronomer who introduced the method now called by his name.

Nº Q1476051 ★

Common · History

Halley's method

Method of numerically finding roots of a function

In numerical analysis, Halley's method is a root-finding algorithm used for functions of one real variable with a continuous second derivative. Edmond Halley was an English mathematician and astronomer who introduced the method now called by his name.

From Wikipedia

In numerical analysis, Halley's method is a root-finding algorithm used for functions of one real variable with a continuous second derivative. Edmond Halley was an English mathematician and astronomer who introduced the method now called by his name. 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. Multivariate versions of this method exist. Halley's method exactly finds the roots of a linear-over-linear Padé approximation to the function. This contrasts with Newton's method or the secant method, which approximate the function linearly, or Muller's method, which approximates the function quadratically. There is also Halley's irrational method, described below.

Text: Wikipédia, CC BY-SA 4.0. ·

Related cards

Open

…

Confirmation