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.
•
Given that the function is analytic within each of these quarters, a nonzero winding number N (always an integer) identifies N zeros of the function inside the quarter in question by Rouché's theorem, each zero counted as many times as its multiplicity.
algorithm | RSA (algorithm) | Secure Hash Algorithm | Schur function | Issai Schur | Schönhage–Strassen algorithm | Michael Schur | Luhn algorithm | Earley's Algorithm | Dijkstra's algorithm | Derrick Henry Lehmer | CYK algorithm | Viterbi algorithm | Prim's algorithm | Levenberg–Marquardt algorithm | Kosaraju's algorithm | Yarrow algorithm | sorting algorithm | Root-finding algorithm | Kruskal's algorithm | Generic Security Service Algorithm for Secret Key Transaction | Digital Signature Algorithm | Cayley–Purser algorithm | Blahut–Arimoto algorithm | Bellman–Ford algorithm | Algorithm | Verhoeff algorithm | Vatti clipping algorithm | Sylvia Schur | Sorting algorithm |
Lehmer's peripatetic career as a number theorist, with he and his wife taking numerous types of work in the United States and abroad to support themselves during the Great Depression, fortuitously brought him into the center of research into early electronic computing.
•
From 1945-1946, Lehmer served on the Computations Committee at Aberdeen Proving Grounds in Maryland, a group established as part of the Ballistics Research Laboratory to prepare the ENIAC for utilization following its completion at the University of Pennsylvania's Moore School of Electrical Engineering; the other Computations Committee members were Haskell Curry, Leland Cunningham, and Franz Alt.
While attending the Pennsylvania Academy of the Fine Arts in Philadelphia where she studied painting, drawing, and sculpture, Lehmer was inspired by the works of an earlier alumnus, David Lynch, to pursue her interest in film making.
The GNU Scientific Library includes several random number generators of the Lehmer form, including MINSTD, RANF, and the infamous IBM random number generator RANDU.