Jenkins-Traub algorithm

The Jenkins-Traub algorithm for polynomial zeros is a fast globally convergent iterative method. It has been described as "practically a standard in black-box polynomial root-finders".

Given a polynomial "P",

:$P(z)=sum\_\{i=0\}^na\_iz^\{n-i\},\; quad\; a\_0=1,quad\; a\_n\; e\; 0$

with complex coefficients compute approximations to the "n" zeros $alpha\_1,alpha\_1,dots,alpha\_n$ of "P"("z"). There is a variation of the Jenkins-Traub algorithm which is faster if the coefficients are real. The Jenkins-Traub algorithm has stimulated considerable research on theory and software for methods of this type.

Overview

The Jenkins-Traub algorithm is a three-stage process for calculating the zeros of a polynomial with complex coefficents. See Jenkins and Traub [Jenkins, M. A. and Traub, J. F. (1970), [http://www.springerlink.com/content/q6w17w30035r2152/?p=ae17d723839045be82d270b45363625f&pi=1 A Three-Stage Variables-Shift Iteration for Polynomial Zeros and Its Relation to Generalized Rayleigh Iteration] , Numer. Math. 14, 252-263.] .A description can also be found in Ralston and Philip Rabinowitz (mathematician)
Rabinowitz [Ralston, A. and Rabinowitz, P. (1978), A First Course in Numerical Analysis, 2nd ed., McGraw-Hill, New York.] p. 383.The algorithm is similar in spirit to the two-stage algorithm studied by Traub [Traub, J. F. (1966), [http://links.jstor.org/sici?sici=0025-5718(196601)20%3A93%3C113%3AACOGCI%3E2.0.CO%3B2-3 A Class of Globally Convergent Iteration Functions for the Solution of Polynomial Equations] , Math. Comp., 20(93), 113-138.] .

The three-stages of the algorithm are these:
*Stage One: No-Shift Process. This stage is not necessary from theoretical considerations alone, but is useful in practice.
*Stage Two: Fixed-Shift Process. A sequence of polynomials $H^\{(lambda+1)\}(z)$ is generated, $lambda=0,1,dots,L-1$.
*Stage Three: Variable-Shift Process. The $H^\{(lambda)\}(z)$ are now generated using the variable shifts $s\_\{lambda\}$ which are generated by

:

where is $H^\{(lambda)\}(z)$ divided by its leading coefficient.

It can be shown that provided "L" is chosen sufficiently large "s"_λ always converges to a zero of "P". After an approximate zero has been found the degree of "P" is reduced by one by deflation and the algorithm is performed on the new polynomial until all the zeros have been computed.

The algorithm converges for any distribution of zeros. Furthermore, the convergence is faster than the quadratic convergence of Newton-Raphson iteration.

What gives the algorithm its power?

Compare with the Newton-Raphson iteration

:$z\_\{i+1\}=z\_i\; -\; frac\{P(z\_i)\}\{P^\{prime\}(z\_i)\}.$

The iteration uses the given "P" and $scriptstyle\; P^\{prime\}$. In contrast the third-stage of Jenkins-Traub

:

is precisely a Newton-Raphson iteration performed on certain rational functions. More precisely, Newton-Raphson is being performed on a sequence of rational functions

:$P(z)/H^\{(lambda)\}$.

For $lambda$ sufficiently large,

:$P(z)/H^\{(lambda)\}$

is as close as desired to a first degree polynomial

:$z-alpha\_1$,

where $alpha\_1$ is one of the zeros of $P$. Even though Stage 3 is precisely a Newton-Raphson iteration, differentiation is not performed.

Real coefficients

The Jenkins-Traub algorithm described earlier works for polynomials with complex coefficients. The same authors also created a three-stage algorithm for polynomials with real coefficients. See Jenkins and Traub [http://links.jstor.org/sici?sici=0036-1429%28197012%297%3A4%3C545%3AATAFRP%3E2.0.CO%3B2-J A Three-Stage Algorithm for Real Polynomials Using Quadratic Iteration] . [Jenkins, M. A. and Traub, J. F. (1970), [http://links.jstor.org/sici?sici=0036-1429%28197012%297%3A4%3C545%3AATAFRP%3E2.0.CO%3B2-J A Three-Stage Algorithm for Real Polynomials Using Quadratic Iteration] , SIAM J. Numer. Anal., 7(4), 545-566.] The algorithm finds either a linear or quadratic factor working completely in real arithmetic. If the complex and real algorithms are applied to the same real polynomial, the real algorithm is about four times as fast. The real algorithm always converges and the rate of convergence is greater than second order.

A connection with the shifted QR algorithm

There is a surprising connection with the shifted QR algorithm for computing matrix eigenvalues. See Dekker and Traub [http://linkinghub.elsevier.com/retrieve/pii/0024379571900358 The shifted QR algorithm for Hermitian matrices] . [Dekker, T. J. and Traub, J. F. (1971), [http://linkinghub.elsevier.com/retrieve/pii/0024379571900358 The shifted QR algorithm for Hermitian matrices] , Lin. Algebra Appl., 4(2), 137-154.] Again the shifts may be viewed as Newton-Raphson iteration on a sequence of rational functions converging to a first degree polynomial.

oftware and testing

The software for the Jenkins-traub algorithm was published as Jenkins and Traub [http://portal.acm.org/citation.cfm?id=361262&coll=portal&dl=ACM Algorithm 419: Zeros of a Complex Polynomial] . [ Jenkins, M. A. and Traub, J. F. (1972), [http://portal.acm.org/citation.cfm?id=361262&coll=portal&dl=ACM Algorithm 419: Zeros of a Complex Polynomial] , Comm. ACM, 15, 97-99.] The software for the real algorithm was published as Jenkins [http://portal.acm.org/citation.cfm?id=355643&coll=ACM&dl=ACM Algorithm 493: Zeros of a Real Polynomial] . [Jenkins, M. A. (1975), [http://portal.acm.org/citation.cfm?id=355643&coll=ACM&dl=ACM Algorithm 493: Zeros of a Real Polynomial] , ACM TOMS, 1, 178-189.]

The methods have been extensively tested by many people. As predicted they enjoy faster than quadratic convergence for all distributions of zeros. They have been described as "practically a standard in black-box polynomial root finders"; see Press, et al., Numerical Recipes, [Press, W. H., Teukolsky, S. A., Vetterling, W. T. and Flannery, B. P. (2002), Numerical Recipes in C++: The Art of Scientific Computing, 2nd. ed., Cambridge University Press, New York.] p. 380.

However there are polynomials which can cause loss of precision as illustrated by the following example. The polynomial has all its zeros lying on two half-circles of different radii. Wilkinson recommends that it is desirable for stable deflation that smaller zeros be computed first. The second-stage shifts are chosen so that the zeros on the smaller half circle are found first. After deflation the polynomial with the zeros on the half circle is known to be ill-conditioned if the degree is large; see Wilkinson, [Wilkinson, J. H. (1963), Rounding Errors in Algebraic Processes, Prentice Hall, Englewood Cliffs, N.J.] p. 64. The original polynomial was of degree 60 and suffered severe deflation instability.

References

External links

* [http://math.fullerton.edu/mathews/n2003/jenkinstraub/JenkinsTraubBib/Links/JenkinsTraubBib_lnk_2.html Additional Bibliography for the Jenkins-Traub Method]
* [http://math.fullerton.edu/mathews/n2003/jenkinstraub/JenkinsTraubBib/Links/JenkinsTraubBib_lnk_1.html Internet Resources for the Jenkins-Traub Method]
* [http://www.hvks.com/Numerical/winsolve.htm A free downloadable Windows application using the Jenkins-Traub Method for polynomials with real and complex coefficients]