Chapter 11
Jenkins–Traub, Minimization, and Bairstow Methods
J.M. McNamee and V.Y. Pan
Abstract
First we consider the Jenkins–Traub 3-stage algorithm. In stage 1 we define
In the second stage the factor 
is replaced by 
for fixed 
, and in the third stage by where is re-computed at each iteration. Then a root. A slightly different algorithm is given for ...
Get Numerical Methods for Roots of Polynomials - Part II now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
