Jenkins–Traub algorithm: Difference between revisions

Revision as of 08:17, 18 November 2009

Revision as of 08:19, 18 November 2009

Line 1:

The '''Jenkins-Traub algorithm for polynomial zeros''' is a fast globally convergent iterative method. It has been described as ''practically a standard in black-box polynomial root-finders''<ref>Press, W. H., Teukolsky, S. A., Vetterling, W. T. and Flannery, B. P. (2007), Numerical Recipes: The Art of Scientific Computing, 3rd ed., Cambridge University Press, page 470.</ref>.

Given a polynomial ''P'',