Jenkins–Traub algorithm explained

The Jenkins–Traub algorithm for polynomial zeros is a fast globally convergent iterative polynomial root-finding method published in 1970 by Michael A. Jenkins and Joseph F. Traub. They gave two variants, one for general polynomials with complex coefficients, commonly known as the "CPOLY" algorithm, and a more complicated variant for the special case of polynomials with real coefficients, commonly known as the "RPOLY" algorithm. The latter is "practically a standard in black-box polynomial root-finders".^[1]

This article describes the complex variant. Given a polynomial P,$$P(z)\; =\; \backslash sum\_^na\_iz^,\; \backslash quad\; a\_0=1,\backslash quad\; a\_n\backslash ne\; 0$$with complex coefficients it computes approximations to the n zeros

\alpha _{1,\alpha} _{2,...,\alpha} _{n} of P(z), one at a time in roughly increasing order of magnitude. After each root is computed, its linear factor is removed from the polynomial. Using this deflation guarantees that each root is computed only once and that all roots are found.

The real variant follows the same pattern, but computes two roots at a time, either two real roots or a pair of conjugate complex roots. By avoiding complex arithmetic, the real variant can be faster (by a factor of 4) than the complex variant. The Jenkins–Traub algorithm has stimulated considerable research on theory and software for methods of this type.

Overview

The Jenkins–Traub algorithm calculates all of the roots of a polynomial with complex coefficients. The algorithm starts by checking the polynomial for the occurrence of very large or very small roots. If necessary, the coefficients are rescaled by a rescaling of the variable. In the algorithm, proper roots are found one by one and generally in increasing size. After each root is found, the polynomial is deflated by dividing off the corresponding linear factor. Indeed, the factorization of the polynomial into the linear factor and the remaining deflated polynomial is already a result of the root-finding procedure. The root-finding procedure has three stages that correspond to different variants of the inverse power iteration. See Jenkins and Traub.^[2] A description can also be found in Ralston and Rabinowitz^[3] p. 383.The algorithm is similar in spirit to the two-stage algorithm studied by Traub.^[4]

Root-finding procedure

Starting with the current polynomial P(X) of degree n, the aim is to compute the smallest root

\alpha of P(x). The polynomial can then be split into a linear factor and the remaining polynomial factor H polynomials is constructed. These polynomials are all of degree n - 1 and are supposed to converge to the factor

\bar H(X) of P(X) containing (the linear factors of) all the remaining roots. The sequence of H polynomials occurs in two variants, an unnormalized variant that allows easy theoretical insights and a normalized variant of \bar H polynomials that keeps the coefficients in a numerically sensible range.The construction of the H polynomials \left(H ^{(λ)} (z)\right) _{λ=0,1,2,...} is guided by a sequence of complex numbers (s _{λ)} _{λ=0,1,2,...} called shifts. These shifts themselves depend, at least in the third stage, on the previous H polynomials. The H polynomials are defined as the solution to the implicit recursion$$H^(z)=P^\backslash prime(z)$$ and $$(X-s\_\backslash lambda)\backslash cdot\; H^(X)\backslash equiv\; H^(X)\backslash pmod\backslash \; .$$A direct solution to this implicit equation is$$H^(X)\; =\backslash frac1\backslash cdot\; \backslash left(H^(X)-\backslash fracP(X)\; \backslash right)\backslash ,,$$where the polynomial division is exact.

Algorithmically, one would use long division by the linear factor as in the Horner scheme or Ruffini rule to evaluate the polynomials at

s _{λ} and obtain the quotients at the same time. With the resulting quotients p(X) and h(X) as intermediate results the next H polynomial is obtained asSince the highest degree coefficient is obtained from P(X), the leading coefficient of H ^{(λ+1)} (X) is - \tfrac{H ^{(λ)} (s _{λ)}{P(s} _{λ)}} . If this is divided out the normalized H polynomial is

Stage one: no-shift process

For

λ = 0 , 1 , ... , M -1 set s _{λ=0} . Usually M=5 is chosen for polynomials of moderate degrees up to n = 50. This stage is not necessary from theoretical considerations alone, but is useful in practice. It emphasizes in the H polynomials the cofactor(s) (of the linear factor) of the smallest root(s).

Stage two: fixed-shift process

The shift for this stage is determined as some point close to the smallest root of the polynomial. It is quasi-randomly located on the circle with the inner root radius, which in turn is estimated as the positive solution of the equation$$R^n+|a\_|\backslash ,R^+\backslash dots+|a\_|\backslash ,R=|a\_0|\backslash ,.$$Since the left side is a convex function and increases monotonically from zero to infinity, this equation is easy to solve, for instance by Newton's method.

Now choose

s = R ⋅ \exp(i\phi _{random)} on the circle of this radius. The sequence of polynomials H ^{(λ+1)} (z) , λ= M,M +1 , ... ,L -1 , is generated with the fixed shift value s _{λ} = s . This creates an asymmetry relative to the previous stage which increases the chance that the H polynomial moves towards the cofactor of a single root.During this iteration, the current approximation for the root

$$t\_\backslash lambda=s-\backslash frac$$is traced. The second stage is terminated as successful if the conditions and are simultaneously met. This limits the relative step size of the iteration, ensuring that the approximation sequence stays in the range of the smaller roots. If there was no success after some number of iterations, a different random point on the circle is tried. Typically one uses a number of 9 iterations for polynomials of moderate degree, with a doubling strategy for the case of multiple failures.

Stage three: variable-shift process

The

H ^{(λ+1)} (X) polynomials are now generated using the variable shifts s _{λ} , λ= L,L +1 , ... which are generated by $$s\_L\; =\; t\_L\; =\; s-\; \backslash frac$$being the last root estimate of the second stage and$$s\_=s\_\backslash lambda-\; \backslash frac,\; \backslash quad\; \backslash lambda=L,L+1,\backslash dots,$$where \bar H ^{(λ+1)} (z) is the normalized H polynomial, that is H ^{(λ)} (z) divided by its leading coefficient.

If the step size in stage three does not fall fast enough to zero, then stage two is restarted using a different random point. If this does not succeed after a small number of restarts, the number of steps in stage two is doubled.

Convergence

It can be shown that, provided L is chosen sufficiently large, s_λ always converges to a root of P.

The algorithm converges for any distribution of roots, but may fail to find all roots of the polynomial. Furthermore, the convergence is slightly faster than the quadratic convergence of the Newton–Raphson method, however, it uses one-and-half as many operations per step, two polynomial evaluations for Newton vs. three polynomial evaluations in the third stage.

What gives the algorithm its power?

Compare with the Newton–Raphson iteration$$z\_=z\_i\; -\; \backslash frac.$$

The iteration uses the given P and

\scriptstyle P ^{\prime} . In contrast the third-stage of Jenkins–Traub$$s\_\; =s\_\backslash lambda-\; \backslash frac\; =s\_\backslash lambda-\backslash frac$$

is precisely a Newton–Raphson iteration performed on certain rational functions. More precisely, Newton–Raphson is being performed on a sequence of rational functions$$W^\backslash lambda(z)=\backslash frac.$$

For

λ sufficiently large,$$\backslash frac=W^\backslash lambda(z)\backslash ,LC(H^)$$is as close as desired to a first degree polynomial$$z-\backslash alpha\_1,\; \backslash ,$$where \alpha _{1} is one of the zeros of P . Even though Stage 3 is precisely a Newton–Raphson iteration, differentiation is not performed.

Analysis of the H polynomials

Let

\alpha _{1,...,\alpha} _{n} be the roots of P(X). The so-called Lagrange factors of P(X) are the cofactors of these roots,$$P\_m(X)=\backslash frac.$$If all roots are different, then the Lagrange factors form a basis of the space of polynomials of degree at most n - 1. By analysis of the recursion procedure one finds that the H polynomials have the coordinate representation$$H^(X)\; =\backslash sum\_^n\; \backslash left[\backslash prod\_\{\backslash kappa=0\}^\{\backslash lambda-1\}(\backslash alpha\_m-s\_\backslash kappa)\; \backslash right]^\backslash ,P\_m(X)\backslash \; .$$Each Lagrange factor has leading coefficient 1, so that the leading coefficient of the H polynomials is the sum of the coefficients. The normalized H polynomials are thus$$\backslash bar\; H^(X)\; =\backslash frac=\; \backslash frac\backslash \; .$$

Convergence orders

If the condition

|\alpha _{1-s} _{\kappa|<min{}} _{m=2,3,...,n} |\alpha _{m-s} _{\kappa|} holds for almost all iterates, the normalized H polynomials will converge at least geometrically towards P _{1(X)} .

Under the condition that one gets the asymptotic estimates for

• stage 1: $$$$

H^(X) =P_1(X)+O\left(\left|\frac\right|^\lambda\right).

• for stage 2, if s is close enough to

\alpha _{1} : $$H^(X)\; =\; P\_1(X)\; +O\backslash left(\backslash left|\backslash frac\backslash right|^M\; \backslash cdot\; \backslash left|\backslash frac\backslash right|^\backslash right)$$ and $$s-\backslash frac\; =\; \backslash alpha\_1+O\backslash left(\backslash ldots\backslash cdot|\backslash alpha\_1-s|\backslash right).$$

• and for stage 3: $$$$

H^(X) =P_1(X) +O\left(\prod_^ \left|\frac\right| \right) and $$s\_=\; s\_\backslash lambda-\backslash frac\; =\backslash alpha\_1+O\backslash left(\backslash prod\_^\; \backslash left|\backslash frac\backslash right|\; \backslash cdot\; \backslash frac$$

^2

\right) giving rise to a higher than quadratic convergence order of \phi ^{2=1+\phi ≈} 2 . 61 , where \phi = \tfrac 12 ( 1+ \sqrt 5 ) is the golden ratio.

Interpretation as inverse power iteration

All stages of the Jenkins–Traub complex algorithm may be represented as the linear algebra problem of determining the eigenvalues of a special matrix. This matrix is the coordinate representation of a linear map in the n-dimensional space of polynomials of degree n - 1 or less. The principal idea of this map is to interpret the factorization$$P(X)=(X-\backslash alpha\_1)\backslash cdot\; P\_1(X)$$with a root

\alpha _{1\in\C} and P _{1(X)} = P(X) / (X - \alpha _{1)} the remaining factor of degree n - 1 as the eigenvector equation for the multiplication with the variable X, followed by remainder computation with divisor P(X), $$M\_X(H)\; =\; (X\backslash cdot\; H(X))\; \backslash bmod\; P(X)\backslash ,.$$This maps polynomials of degree at most n - 1 to polynomials of degree at most n - 1. The eigenvalues of this map are the roots of P(X), since the eigenvector equation reads$$0\; =\; (M\_X-\backslash alpha\backslash cdot\; id)(H)=((X-\backslash alpha)\backslash cdot\; H)\; \backslash bmod\; P\backslash ,,$$which implies that (X - \alpha) ⋅ H) = C ⋅ P(X) , that is, (X - \alpha) is a linear factor of P(X). In the monomial basis the linear map M _{X} is represented by a companion matrix of the polynomial P, as$$M\_X(H)\; =\; \backslash sum\_^H\_mX^-H\_\backslash left(X^n+\backslash sum\_^a\_mX^m\backslash right)\; =\; \backslash sum\_^(H\_-a\_H\_)X^m-a\_0H\_\backslash ,,$$the resulting transformation matrix isTo this matrix the inverse power iteration is applied in the three variants of no shift, constant shift and generalized Rayleigh shift in the three stages of the algorithm. It is more efficient to perform the linear algebra operations in polynomial arithmetic and not by matrix operations, however, the properties of the inverse power iteration remain the same.

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 A Three-Stage Algorithm for Real Polynomials Using Quadratic Iteration.^[5] 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 The shifted QR algorithm for Hermitian matrices.^[6] Again the shifts may be viewed as Newton-Raphson iteration on a sequence of rational functions converging to a first degree polynomial.

Software and testing

The software for the Jenkins–Traub algorithm was published as Jenkins and Traub Algorithm 419: Zeros of a Complex Polynomial.^[7] The software for the real algorithm was published as Jenkins Algorithm 493: Zeros of a Real Polynomial.^[8]

The methods have been extensively tested by many people. As predicted they enjoy faster than quadratic convergence for all distributions of zeros.

However, there are polynomials which can cause loss of precision^[9] 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,^[10] p. 64. The original polynomial was of degree 60 and suffered severe deflation instability.

External links

• A free downloadable Windows application using the Jenkins–Traub Method for polynomials with real and complex coefficients
• RPoly++ An SSE-Optimized C++ implementation of the RPOLY algorithm.

Notes and References

1. Press, W. H., Teukolsky, S. A., Vetterling, W. T. and Flannery, B. P. (2007), Numerical Recipes: The Art of Scientific Computing, 3rd ed., Cambridge University Press, page 470.
2. Jenkins, M. A. and Traub, J. F. (1970), A Three-Stage Variables-Shift Iteration for Polynomial Zeros and Its Relation to Generalized Rayleigh Iteration, Numer. Math. 14, 252–263.
3. Ralston, A. and Rabinowitz, P. (1978), A First Course in Numerical Analysis, 2nd ed., McGraw-Hill, New York.
4. Traub, J. F. (1966), A Class of Globally Convergent Iteration Functions for the Solution of Polynomial Equations, Math. Comp., 20(93), 113–138.
5. Jenkins, M. A. and Traub, J. F. (1970), A Three-Stage Algorithm for Real Polynomials Using Quadratic Iteration, SIAM J. Numer. Anal., 7(4), 545–566.
6. Dekker, T. J. and Traub, J. F. (1971), The shifted QR algorithm for Hermitian matrices, Lin. Algebra Appl., 4(2), 137–154.
7. Jenkins, M. A. and Traub, J. F. (1972), Algorithm 419: Zeros of a Complex Polynomial, Comm. ACM, 15, 97–99.
8. Jenkins, M. A. (1975), Algorithm 493: Zeros of a Real Polynomial, ACM TOMS, 1, 178–189.
9. Web site: 8 August 2005. William Kahan Oral history interview by Thomas Haigh. 2021-12-03. The History of Numerical Analysis and Scientific Computing. Philadelphia, PA.
10. Wilkinson, J. H. (1963), Rounding Errors in Algebraic Processes, Prentice Hall, Englewood Cliffs, N.J.