Revision as of 09:24, 17 January 2019 edit Windeman (talk \| contribs) 65 edits No edit summary ← Previous edit		Revision as of 06:29, 18 January 2019 edit undo Coastside (talk \| contribs) Extended confirmed users 8,960 edits →Lehmer-Schur algorithm: fixed dab link, ce Next edit →
Line 3: ===Lehmer-Schur algorithm=== In [[mathematics]], the '''Lehmer–Schur algorithm''' (named after [[Derrick Henry Lehmer]] and [[Issai Schur]]) is a [[root-finding algorithm]] for [[complex]] [[polynomial]]s, extending the idea of enclosing roots like in the one-dimensional [[bisection method]] to the complex plane. It uses the Schur-Cohn test to test increasingly smaller disks for the presence or absence of roots.\\ ===Schur-Cohn algorithm===

Lehmer–Schur algorithm: Difference between revisions