|This article needs additional citations for verification. (November 2013)|
In numerical analysis, the class of Householder's methods are root-finding algorithms used for functions of one real variable with continuous derivatives up to some order d+1, where d will be the order of the Householder's method.
The algorithm is iterative and it has rate of convergence of d+1.
Like many root-finding methods, the Householder'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 (d+1) 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:
- , for some
This means that the iterates converge to the zero if the initial guess is sufficiently close, and that the convergence has rate (d+1).
An approximate idea of the Householder's method derives from the geometric series. Let the real-valued, continuously differentiable function f(x) have a simple zero at x=a, that is a root f(a)=0 of multiplicity one, which is equivalent to . Then 1/f(x) has a singularity at a, specifically a simple pole (also of multiplicity one), and close to a the behavior of 1/f(x) is dominated by1/(x-a). Approximatively one gets
Here because a is a simple zero of f(x). The coefficient of degree d has the value . Thus, one can now reconstruct the zero a by dividing the coefficient of degree d-1 by the coefficient of degree d. Since this geometric series is an approximation to the Taylor expansion of 1/f(x), one can get estimates of the zero of f(x) − now without prior knowledge of the location of this zero − by dividing the corresponding coefficients of the Taylor expansion of 1/f(x) or, more generally, 1/f(b+x). From that one gets, for any integer d, and if the corresponding derivatives exist,
By König's theorem, we have:
This suggests that the Householder's iteration might be a good convergent iteration. The actual proof of the convergence is also based on this idea.
The methods of lower order
The Householder's method of order 1 is just Newton's method, since:
For the Householder's method of order 2 one gets Halley's method, since the identities
In the last line, is the update of the Newton iteration at the point . This line was added to demonstrate where the difference to the simple Newton's method lies.
The third order method is obtained from the identity of the third order derivative of 1/f
and has the formula
and so on...
The first problem solved by Newton with the Newton-Raphson-Simpson method was the polynomial equation . He observed that there should be a solution close to 2. Replacing y=x+2 transforms the equation into
The Taylor series of the reciprocal function starts with
The result of applying Householder's methods of various orders at x=0 is also obtained by dividing neighboring coefficients of the latter power series. For the first orders one gets the following values after just one iteration step: For an example, in the case of the 3rd order, .
As one can see, there are a little bit more than d correct decimal places for each order d.
Let's calculate the values for some lowest order,
And using following relations,
- 1st order;
- 2nd order;
- 3rd order;
|x||1st (Newton)||2nd (Halley)||3rd order||4th order|
An exact derivation of the Householder's methods starts from the Padé approximation of order (d+1) of the function resp. its Taylor development, where the approximant with linear numerator is chosen. If this has been achieved, the update for the next approximation results from computing the unique zero of the numerator.
The Padé approximation has the form
The rational function has a zero at .
Just as the Taylor polynomial of degree d has d+1 coefficients that depend on the function f, also the Padé approximation always has d+1 coefficients dependent on f and its derivatives. More precisely, in any Padé approximant, the degrees of numerator and denominator polynomials have to add to the order of the approximant. Therefore, has to hold.
One could determine the Padé approximant starting from the Taylor polynomial of f using Euclid's algorithm. However, starting from the Taylor polynomial of 1/f is shorter and leads directly to the given formula. Since
has to be equal to the inverse of the desired rational function, we get after multiplying with in the power the equation
Now, solving the last equation for the zero of the numerator results in
This implies the iteration formula
- Pascal Sebah and Xavier Gourdon (2001). "Newton's method and high order iteration". Note: Use the Postscript version of this link; the website version is not compiled correctly.