Revision as of 20:13, 3 January 2014 edit Michael Hardy (talk \| contribs) Administrators 210,577 edits en-dash rather than hyphen in "Schur–Cohn" and some other similarly obvious corrections per WP:MOS ← Previous edit		Revision as of 20:13, 3 January 2014 edit undo Michael Hardy (talk \| contribs) Administrators 210,577 edits en-dash rather than hyphen in "Schur–Cohn" and some other similarly obvious corrections per WP:MOS Next edit →
Line 9: If after some recursions a small disk is found that contains only one root, this root is further approximated using [[Newton's method]] and then the polynomial is deflated by splitting off the corresponding linear factor. After that, the whole procedure is restarted. ===Schur ~~Transformation~~transformation of polynomials=== Consider, as before, a polynomial with complex coefficients

Lehmer–Schur algorithm: Difference between revisions