@Article{JCM-8-3,
author = {},
title = {Comparative Testing of Five Numerical Methods for Finding Roots of Polynomials},
journal = {Journal of Computational Mathematics},
year = {1990},
volume = {8},
number = {3},
pages = {202--211},
abstract = {<p style="text-align: justify;">This paper summarizes the results of comparative testing of (1) Wilf&#39;s global bisection method, (2) the Laguerre method, (3) the companion matrix eigenvalue method, (4) the companion matrix eigenvalue method with balancing, and (5) the Jenkens-Traub method, all of which are methods for finding the zeros of polynomials. The test set of polynomials used are those suggested by [5]. The methods were compared on each test polynomials on the basis of the accuracy of the computed roots and the CPU time required to numerically compute all roots.</p>},
issn = {1991-7139},
doi = {https://doi.org/1990-JCM-9433},
url = {https://global-sci.com/article/86046/comparative-testing-of-five-numerical-methods-for-finding-roots-of-polynomials}
}