Abstract
A robust method for finding the roots of polynomials using the Routh array is given. Certain multipoint approximation properties of the array are clarified, which enable a simple criterion to be used in the root-finding algorithm. A bisection-type iteration guarantees convergence to the roots.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
