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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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
