Content deleted Content added
Added short description Tags: Mobile edit Mobile app edit Android app edit App description add |
|||
| (2 intermediate revisions by 2 users not shown) | |||
Line 1:
{{Short description|Root-finding 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.
Line 73 ⟶ 74:
{{root-finding algorithms}}
[[Category:
| |||