swMATH ID: 5303
Software Authors: M. A. Jenkins; J. F. Traub
Description: Algorithm 419: zeros of a complex polynomial [C2] 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.
Homepage: http://dl.acm.org/citation.cfm?id=361262
Programming Languages: C++, Fortran
Keywords: optimization; ZERO – Zeros of Functions and Systems
Related Software: na10; EISPACK; QuACN; R; Mathematica
Cited in: 16 Publications

Citations by Year