full
search.png

Search

close.png

Cancel

arrow
Volume 8, Issue 3
Comparative Testing of Five Numerical Methods for Finding Roots of Polynomials

Glenn R. Luecke & James D. Francis

J. Comp. Math., 8 (1990), pp. 202-211.

Published online: 1990-08

Preview Full PDF 1705 19694

Cited by

google scholar semantic scholar
Export citation
  • 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.

  • Keywords

  • AMS Subject Headings

  • Copyright

COPYRIGHT: © Global Science Press

  • Email address
  • BibTex
  • RIS
  • TXT
@Article{JCM-8-202, 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 = {

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.

}, issn = {1991-7139}, doi = {https://doi.org/}, url = {http://global-sci.org/intro/article_detail/jcm/9433.html} }
TY - JOUR T1 - Comparative Testing of Five Numerical Methods for Finding Roots of Polynomials JO - Journal of Computational Mathematics VL - 3 SP - 202 EP - 211 PY - 1990 DA - 1990/08 SN - 8 DO - http://doi.org/ UR - https://global-sci.org/intro/article_detail/jcm/9433.html KW - AB -

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.

Glenn R. Luecke & James D. Francis. (1970). Comparative Testing of Five Numerical Methods for Finding Roots of Polynomials. Journal of Computational Mathematics. 8 (3). 202-211. doi:
Copy to clipboard
BibteX RIS TXT
The citation has been copied to your clipboard