13 Feb
2007
13 Feb
'07
5:09 p.m.
On Tuesday 13 February 2007 20:38, Henry Baker wrote:
There is also a classical Newton method for approximating a conjugate pair of roots simultaneously; it guesses a quadratic factor for the polynomial & iterates. I did a quick Google search to find the name of this algorithm, but wasn't able to find it. If anyone cares, I'll do a deeper search. I think that it appeared in one of the early ACM publications.
Sounds like Bairstow's method. It's in "Numerical Recipes" under the name "qroot". (This should not be taken as an endorsement of "Numerical Recipes".) -- g