A combined method for polynomial roots using modified Newton-Raphson with minimum searching (Q1200179)

A combined algorithm for polynomial roots is constructed. At first, a local geometric property of an analytic function \(f\) is derived which in the case that \(f\) is a polynomial, is used to construct a root-finding algorithm MS which is always convergent. Then a modified Newton-Raphson method (MNR) is presented which is fast but unreliable. At last the method MNR is combined with the algorithm MS to yield a new method MNRMSc for which numerical experiments show to be significantly faster and more reliable than the Newton-Raphson method and some other algorithms of the same level of accuracy. It is also capable of greater accuracy.