Integer relation algorithm: Difference between revisions

Revision as of 17:34, 2 October 2011

Revision as of 17:17, 17 August 2012

Line 15:

*The '''PSLQ algorithm''', developed by Ferguson and Bailey in 1992 and substantially simplified by Ferguson, Bailey, and Arno in 1999.<ref>{{MathWorld|urlname=PSLQAlgorithm|title=PSLQ Algorithm}}</ref><ref>[http://crd.lbl.gov/~dhbailey/dhbpapers/pslq.pdf ''A Polynomial Time, Numerically Stable Integer Relation Algorithm''] by Helaman R. P. Ferguson and David H. Bailey; RNR Technical Report RNR-91-032; July 14, 1992</ref>

In 2000 the PSLQ algorithm was selected as one of the "Top Ten Algorithms of the Century" by [[Jack Dongarra]] and Francis Sullivan.<ref>{{cite journal |author=Barry A. Cipra |url=http://amathwww.coloradouta.edu/resourcesfaculty/archivercli/TopTen/topten.pdf |title=The Best of the 20th Century: Editors Name Top 10 Algorithms |journal=SIAM News |volume=33 |issue=4}}</ref>

==Applications==