Lehmer–Schur algorithm
root-finding algorithm
Press Enter · cited answer in seconds
0 sources
Summary
Lehmer–Schur algorithm is an algorithm[1]. It draws 14 Wikipedia views per month (algorithm category, ranking #143 of 337).[2]
Key Facts
- Lehmer–Schur algorithm's instance of is recorded as algorithm[3].
- Lehmer–Schur algorithm's instance of is recorded as root-finding algorithm[4].
- Issai Schur is named after Lehmer–Schur algorithm[5].
- Derrick Henry Lehmer is named after Lehmer–Schur algorithm[6].
- Lehmer–Schur algorithm's Freebase ID is recorded as /m/07zjvr[7].
- Lehmer–Schur algorithm's Microsoft Academic ID is recorded as 36215071[8].
Body
Designation and Status
Recorded instance of include algorithm[3] and root-finding algorithm[4].
History and Context
Things named after include Issai Schur[5], a mathematician[9], 1875–1941[10], of German Reich[11], specialised in combinatorics[12] and Derrick Henry Lehmer[6], a mathematician[13], 1905–1991[14], of United States[15], awarded the Guggenheim Fellowship[16], specialised in number theory[17].
Why It Matters
Lehmer–Schur algorithm draws 14 Wikipedia views per month (algorithm category, ranking #143 of 337).[2]