Revision as of 03:07, 30 March 2010 edit LilHelpa (talk \| contribs) Extended confirmed users, Pending changes reviewers 413,966 edits m General fixes and Typo fixing, typos fixed: sligthly → slightly, occurence → occurrence using AWB ← Previous edit		Revision as of 13:04, 5 November 2010 edit undo Gareth McCaughan (talk \| contribs) Extended confirmed users 682 edits m fxi tpyo: capitalization of "Traub" Next edit →
Line 222: ==Software and testing== The software for the Jenkins-~~traub~~Traub algorithm was published as Jenkins and Traub [http://portal.acm.org/citation.cfm?id=361262&coll=portal&dl=ACM Algorithm 419: Zeros of a Complex Polynomial].<ref>Jenkins, M. A. and Traub, J. F. (1972), [http://portal.acm.org/citation.cfm?id=361262&coll=portal&dl=ACM Algorithm 419: Zeros of a Complex Polynomial], Comm. ACM, 15, 97-99.</ref> The software for the real algorithm was published as Jenkins [http://portal.acm.org/citation.cfm?id=355643&coll=ACM&dl=ACM Algorithm 493: Zeros of a Real Polynomial].<ref>Jenkins, M. A. (1975), [http://portal.acm.org/citation.cfm?id=355643&coll=ACM&dl=ACM Algorithm 493: Zeros of a Real Polynomial], ACM TOMS, 1, 178-189.</ref> The methods have been extensively tested by many people. As predicted they enjoy faster than quadratic convergence for all distributions of zeros.

Jenkins–Traub algorithm: Difference between revisions