Lin-Bairstow algorithm for Polynomial Roots

[robve]

(02-21-2022 11:53 AM)floppy Wrote:  Thanks for the contribution. Does it differ from other existing programs in modules? and what are the advantages or disadvantages?

All methods have some pros and cons. The usual caveats apply to Bairstow: lacking convergence and being unstable for polynomials of degrees above 8 or 10 (depending on the implementation and fp precision). When the method appears to be stuck and diverges, one can try to reset/perturb the parameters to continue the search. This can be done automatically.

No method is immune to difficulties with higher degree polynomials and/or root multiplicities, see also Wilkinson's polynomial.

- Rob