Access Restriction

Author Traub, J. F. ♦ Jenkins, M. A.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Zeros of a polynomial ♦ Roots ♦ Roots of a polynomial
Abstract The subroutine CPOLY is a Fortran program to find all the zeros of a complex polynomial by the three-stage complex algorithm described in Jenkins and Traub [4]. (An algorithm for real polynomials is given in [5].) The algorithm is similar in spirit to the two-stage algorithms studied by Traub [1, 2]. The program finds the zeros one at a time in roughly increasing order of modulus and deflates the polynomial to one of lower degree. The program is extremely fast and the timing is quite insensitive to the distribution of zeros. Extensive testing of an Algol version of the program, reported in Jenkins [3], has shown the program to be very reliable.
Description Affiliation: Carnagie-Mellon Univ., Pittsburgh, PA (Traub, J. F.) || Queen's Univ., Kingston, Ont., Canada (Jenkins, M. A.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 15
Issue Number 2
Page Count 3
Starting Page 97
Ending Page 99

Open content in new tab

   Open content in new tab
Source: ACM Digital Library