Jenkins–Traub algorithm: Difference between revisions

Revision as of 01:20, 8 June 2009

Revision as of 00:21, 11 July 2009

Line 5:

:<math>P(z)=\sum_{i=0}^na_iz^{n-i}, \quad a_0=1,\quad a_n\ne 0</math>

with complex coefficients compute approximations to the ''n'' zeros <math>\alpha_1,\alpha_1alpha_2,\dots,\alpha_n</math> of ''P''(''z'').

There is a variation of the Jenkins-Traub algorithm which is faster if the coefficients are real. The Jenkins-Traub algorithm has stimulated considerable research on theory and software for methods of this type.