Newton's method | Monte Carlo method | The Crystal Method | Scholarly method | The Duckworth Lewis Method | New Austrian Tunnelling method | Method acting | Horner's method | Suzuki method | Smart Common Input Method | Powell's method | Method Fest Independent Film Festival | method acting | Java remote method invocation | Jacobi method | Iterative method | Finite element method | Delphi method | Brent's method | X Input Method | scientific method | Sainte-Laguë method | Quantum inverse scattering method | Q9 input method | Method of matched asymptotic expansions | Method Music | Kodály Method | Hardy–Littlewood circle method | Gauss–Seidel method | finite element method |
In mathematics, the Lehmer–Schur algorithm (named after Derrick Henry Lehmer and Issai Schur) is a root-finding algorithm extending the idea of enclosing roots like in the one-dimensional bisection method to the complex plane.