Abstract

This paper examines the possibility of improving Bairstow's algorithm for finding the roots of polynomials with real coefficients. It discusses points concerning the removal of factors of any chosen order and with speeding the convergence rate. The case of multiple factors is also examined.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.