Revision as of 20:13, 22 August 2011 edit Macrakis (talk \| contribs) Autopatrolled, Extended confirmed users, Pending changes reviewers, Rollbackers 54,657 edits link authors in lead (even though Jenkins is a redlink) ← Previous edit		Revision as of 20:13, 22 August 2011 edit undo Macrakis (talk \| contribs) Autopatrolled, Extended confirmed users, Pending changes reviewers, Rollbackers 54,657 edits link authors in lead (even though Jenkins is a redlink); correct italics Next edit →
Line 1: The '''Jenkins–Traub algorithm for polynomial zeros''' is a fast globally convergent iterative method published in 1970 by [[Michael A. Jenkins]] and [[Joseph F. Traub]]. It is ''"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'',

Jenkins–Traub algorithm: Difference between revisions