Welcome to The Wikipedia Adventure!
edit
- Hi Windeman! We're so happy you wanted to play to learn, as a friendly and fun way to get into our community and mission. I think these links might be helpful to you as you get started.
-- 13:31, Tuesday, March 1, 2016 (UTC)
| Mission 1 | Mission 2 | Mission 3 | Mission 4 | Mission 5 | Mission 6 | Mission 7 |
| Say Hello to the World | An Invitation to Earth | Small Changes, Big Impact | The Neutral Point of View | The Veil of Verifiability | The Civility Code | Looking Good Together |
Comment on my editing of 'Lehmer-Schur algorithm'
The second statement of the lemma and both statements of the theorem were erroneous as becomes evident by applying them to the polynomials and . They have been replaced by correct ones and a sketch of proof for the lemma has been added.
Added are references 'Cohn','Henrici', 'Marden', and 'Stewart etc.'. 'Cohn', though in german, is added because it is one of the original paper on the subject.
'Stewart etc.' gives a good exposition of the numerical problems of implementation that are also relevant for L-S.
Removed are some references for the following reasons: 'Acton etc.' only mentions the existence of S-C-algorithm and refers to 'the original article' for its definition. Its detailed description of covering an anulus by disks was copied to the L-S wiki-lemma. 'W.H.Press etc.' has one paragraph on L-S, without definition, and refers to 'Acton etc.' for an introduction.
Removed are the external links for the following reasons: 'GAP library etc.' is an undocumented list of program scripts 'Jan van Leeuwen etc.' is to specialistic for our lemma. Both do not satisfy the Wikipedia requirement of being 'directly relevant to an encyclopedic understanding of the subject'.
I doubt whether the sketchy description of Wilff's algorithm makes sense in the Lehmer-Schur article, rather than in Root- finding algorithm in general.