factors with roots , that is, , so in general . Points are colored according to the final point of the Bairstow iteration, black points indicate divergent behavior. The first image is a demonstration of the single real root case. The second indicates that one can remedy the divergent behavior by introducing an additional real root, at the cost of slowing down the speed of convergence. One can also in the case of odd degree polynomials first find a real root using Newton's method and/or an interval shrinking method, so that after deflation a better-behaved even-degree polynomial remains. The third image corresponds to the example above. Reference External links Bairstow's Algorithm on Mathworld Numerical Recipes in Fortran 77 Online Example polynomial root solver (deg(P) ≤ 10) using Bairstow's Method LinBairstowSolve, an open-source C++ implementation of the Lin-Bairstow method available as a method of the VTK library Online root finding of a polynomial – Bairstow's method by Farhad Mazlumi Root-finding algorithms