|
|
| (One intermediate revision by one other user not shown) |
| Line 1: |
Line 1: |
| The '''Aberth method''', or '''Aberth–Ehrlich method''', named after Oliver Aberth<ref>{{cite journal|last=Aberth|first=Oliver|title=Iteration methods for finding all zeros of a polynomial simultaneously|journal=Math. Comp.|volume=27 |year=1973|pages=339–344|doi=10.2307/2005621|issue=122|publisher=Mathematics of Computation, Vol. 27, No. 122|jstor=2005621}}</ref> and Louis W. Ehrlich,<ref>{{cite journal| last=Ehrlich| first=Louis W.| title=A modified Newton method for polynomials| journal=Comm. ACM| volume=10 | issue = 2 | year=1967|pages=107–108|doi=10.1145/363067.363115}}</ref> is a [[root-finding algorithm]] for simultaneous approximation of all the roots of a univariate [[polynomial]].
| | She is recognized by the name of Myrtle Shryock. South Dakota is exactly where me and my spouse reside. The factor she adores most is body building and now she is trying to earn cash with it. For years he's been operating as a meter reader and it's some thing he truly enjoy.<br><br>my web page std testing at home ([http://raybana.com/chat/pg/groups/174883/solid-advice-for-dealing-with-a-candida/ click this over here now]) |
| | |
| The [[fundamental theorem of algebra]] states that for each polynomial with complex coefficients there are as many roots as the degree of the polynomial. Numerical algorithms that approximate all roots at once include the [[Durand–Kerner method|Weierstrass–(Durand–Kerner) method]] and the Aberth–Ehrlich method.
| |
| | |
| ==Description==
| |
| | |
| Let <math> p(x)=p_nx^n+p_{n-1}x^{n-1}+\cdots+p_1x+p_0 </math> be a [[univariate]] polynomial of degree ''n'' with real or complex coefficients. Then there exist complex numbers <math>z^*_1,\,z^*_2,\dots,z^*_n</math>, the roots of ''p(x)'', that give the [[factorisation]]:
| |
| | |
| :<math>p(x)=p_n\cdot(x-z^*_1)\cdot(x-z^*_2)\cdots(x-z^*_n).</math>
| |
| | |
| Although those numbers are unknown, [[Properties of polynomial roots|upper and lower bounds]] for their absolute values are computable from the coefficients of the polynomial. Now one can pick ''n'' distinct numbers in the complex plane—randomly or evenly distributed—such such that their absolute values are within the same bounds. A set of such numbers is called an initial approximation of the set of roots of ''p(x)''. This approximation can be iteratively improved using the following procedure.
| |
| | |
| Let <math>z_1,\dots,z_n\in\mathbb C</math> be the current approximations of the zeros of ''p(x)''. Then offset numbers <math>w_1,\dots,w_n\in\mathbb C</math> are computed as
| |
| | |
| :<math>w_k=-\frac{\frac{p(z_k)}{p'(z_k)}}{1-\frac{p(z_k)}{p'(z_k)}\cdot \sum_{j\ne k}\frac1{z_k-z_j}},</math>
| |
| | |
| where ''p'(z)'' is the polynomial derivative of ''p'' evaluated in the point ''z''.
| |
| | |
| The next set of approximations of roots of ''p(x)'' is then <math> z_1+w_1,\dots,z_n+w_n </math>. One can measure the quality of the current approximation by the values of the polynomial or by the size of the offsets.
| |
| | |
| Inside the formula of the Aberth method one can find elements of [[Newton's method]] and the Weierstrass–(Durand–Kerner) method. Details for an efficient implementation, esp. on the choice of good initial approximations, can be found in Bini (1996).<ref>{{cite journal| last=Bini| first=Dario Andrea| title=Numerical computation of polynomial zeros by means of Aberth's method| journal=Numerical Algorithms| volume=13| year=1996| pages=179–200| url=http://www.springerlink.com/content/b35647833p354348| doi=10.1007/BF02207694| issue=2}}</ref>
| |
| | |
| ==Derivation from Newton's method==
| |
| | |
| The iteration formula is the univariate Newton iteration for the function
| |
| | |
| :<math>F(x)=\frac{p(x)}{\prod_{j=0;\,j\ne k}^n(x-z_j)}</math>
| |
| | |
| If the values <math>z_1,\dots,z_n</math> are already close to the roots of ''p''(''x''), then the rational function ''F''(''x'') is almost linear with poles at <math>z_1,\dots,z_{k-1},z_{k+1},\dots,z_n</math> that direct the Newton iteration away from the roots of ''p(x)'' that are close to them. That is, the corresponding basins of attraction get rather small.
| |
| | |
| The Newton step in the univariate case is the reciprocal value to the logarithmic derivative
| |
| :<math>\begin{align}
| |
| \frac{F'(x)}{F(x)}
| |
| &= \frac{d}{dx}\ln|F(x)|\\
| |
| &= \frac{d}{dx}\big(\ln|p(x)|-\sum_{j=0;\,j\ne k}^n\ln|x-z_j|\big)\\
| |
| &= \frac{p'(x)}{p(x)}-\sum_{j=0;\,j\ne k}^n\frac1{x-z_j}
| |
| \end{align}
| |
| </math>
| |
| | |
| Thus,
| |
| :<math>z_k'=z_k-\frac{F(z_k)}{F'(z_k)}=z_k-\frac1{\frac{p'(z_k)}{p(z_k)}-\sum_{j=0;\,j\ne k}^n\frac1{z_k-z_j}}</math>
| |
| results in the Aberth–Ehrlich iteration.
| |
| | |
| The iteration may be executed in a simultaneous Jacobi-like iteration where first all new approximations are computed from the old approximations or in a sequential [[Gauss–Seidel]]-like iteration that uses each new approximation from the time it is computed.
| |
| | |
| ==Literature==
| |
| <references />
| |
| | |
| ==See also==
| |
| * [[MPSolve]] A package for numerical computation of polynomial roots. Free usage for scientific purpose.
| |
| | |
| {{DEFAULTSORT:Aberth Method}}
| |
| [[Category:Root-finding algorithms]]
| |
She is recognized by the name of Myrtle Shryock. South Dakota is exactly where me and my spouse reside. The factor she adores most is body building and now she is trying to earn cash with it. For years he's been operating as a meter reader and it's some thing he truly enjoy.
my web page std testing at home (click this over here now)