Abstract
Bairstow's method has to face with numerical errors due to the termination criterion of Raphson-Newton iterations and to successive polynomial divisions. Here, an optimal termination criterion is proposed allowing to stop the iterations as soon as a good computed solution is obtained. Moreover, a simple formula to check the validity of a root of a polynomial is given. It is then possible to eliminate the numerical errors in Bairstow's method. Numerical examples are presented.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have