Year: 1990
Journal of Computational Mathematics, Vol. 8 (1990), Iss. 3 : pp. 202–211
Abstract
This paper summarizes the results of comparative testing of (1) Wilf'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.
You do not have full access to this article.
Already a Subscriber? Sign in as an individual or via your institution
Journal Article Details
Publisher Name: Global Science Press
Language: English
DOI: https://doi.org/1990-JCM-9433
Journal of Computational Mathematics, Vol. 8 (1990), Iss. 3 : pp. 202–211
Published online: 1990-01
AMS Subject Headings:
Copyright: COPYRIGHT: © Global Science Press
Pages: 10