Lehmer–Schur algorithm: Difference between revisions

Revision as of 22:18, 22 April 2010

Revision as of 07:30, 30 June 2010

Line 7:

==References==

* {{cite

|author=Acton, Foreman S.

|title=Numerical Methods That Work

|date=1970

|publication-date=1990

|edition=corrected

Line 20:

* W. H. Press, B. P. Flannery, S. A. Teukolsky, W. T. Vetterling, ''[[Numerical Recipes|Numerical Recipes in C: The Art of Scientific Computing]]'', Cambridge University Press, 1992. ISBN 0-521-43108-5 (available free online, with code samples: [http://www.nrbook.com/a/bookcpdf.html]), section 9.5.

==External Linkslinks==

* [https://svn.ece.lsu.edu/svn/dmk/trunk/benchmarks/simtools/scpu2k/gap/polystff.g GAP Library, Lehrstuhl D fuer Mathematik, RWTH Aachen, Germany]

* [http://www.cs.uu.nl/research/techreps/repo/CS-1979/1979-01.pdf "On program efficiency and algebraic complexity" Jan Van Leeuwen]

[http://www.cs.uu.nl/research/techreps/repo/CS-1979/1979-01.pdf "On program efficiency and algebraic complexity" Jan Van Leeuwen]

{{DEFAULTSORT:Lehmer-Schur Algorithm}}

[[Category:Root-finding algorithms]]