1972
DOI: 10.1145/361254.361262
|View full text |Cite
|
Sign up to set email alerts
|

Algorithm 419: zeros of a complex polynomial [C2]

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 in… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
28
0
1

Year Published

1977
1977
2015
2015

Publication Types

Select...
6
3

Relationship

0
9

Authors

Journals

citations
Cited by 73 publications
(29 citation statements)
references
References 3 publications
0
28
0
1
Order By: Relevance
“…A change of 0.5% in the second coefficient yields a polynomial of x 4 -1O.05x 3 + 35x 2 -50x + 24, which has roots of (x -0.992)(x -2.340 -jO.2269)(x -2.340 + j0.2269)(x -4.378). The choice of a complex rooting routine by Jenkins and Traub and double precision calculations are the tools used to reduce errors in this section of the algorithm [45]. While the three stage rooting algorithm has performed well, the sensitivity of the roots of a polynomial to the coefficient values indicates the choice of algorithms in step one may be the major contributing factor to the accuracy of the final model.…”
Section: Prony's Methodsmentioning
confidence: 99%
“…A change of 0.5% in the second coefficient yields a polynomial of x 4 -1O.05x 3 + 35x 2 -50x + 24, which has roots of (x -0.992)(x -2.340 -jO.2269)(x -2.340 + j0.2269)(x -4.378). The choice of a complex rooting routine by Jenkins and Traub and double precision calculations are the tools used to reduce errors in this section of the algorithm [45]. While the three stage rooting algorithm has performed well, the sensitivity of the roots of a polynomial to the coefficient values indicates the choice of algorithms in step one may be the major contributing factor to the accuracy of the final model.…”
Section: Prony's Methodsmentioning
confidence: 99%
“…(9), to zero and solving the resulting equations. Here, this is done numerically, using the method described by Jenkins and Traub (1972), and examining the negative real root values of z -1 . For the case of T=1, K 1 =5, K 2 =20 and various values of α from 0 to 1, the results for various values of N in Table 1 [ Fig.…”
Section: Analysis Of a 2-component Responsementioning
confidence: 99%
“…(4)]. It is important to consider two subcases: If all coefficients are numeric, there are subroutines (see [7]) which compute the roots and inform the user about the existence of multiple or complex roots. When the polynomial involves literal coefficients, the situation becomes more complex.…”
Section: Stepmentioning
confidence: 99%
“…The current capabilities of the program which performs this step are summarized in Table I. It should be remarked that, when dealing with homogeneous equations whose coefficients are numeric, it is possible to use strictly numeric routines such as [5], [7], [12] to replace the time-consuming symbolic computations of steps 2, 4, and 5.…”
Section: Stepmentioning
confidence: 99%