Jump to content

Talk:Lehmer–Schur algorithm

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Hans Lundmark (talk | contribs) at 14:14, 23 October 2010 (Anwered reference request). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Can anyone find a better reference for the method? I know it only because I made the method up for myself some years ago, only to find last year that it is called Lehmer-Schur - most of what I've seen written on it since is sketchy on the theoretical groundings.


The original reference is D. H. Lehmer, |"A Machine Method for Solving Polynomial Equations", Journal of the ACM, Volume 8, Issue 2 (April 1961),151–162. However, the method proposed in that paper is different from the one described here; Lehmer uses a test by Schur for counting zeros inside circles, instead of using the argument principle on rectangles. Hans Lundmark (talk) 14:14, 23 October 2010 (UTC)[reply]

Retrieved from "https://en.wikipedia.org/w/index.php?title=Talk:Lehmer–Schur_algorithm&oldid=392406790"