2. The PSLQ Integer Relation Algorithm
In 1991 a new algorithm, known as ``PSLQ'' algorithm, was developed by
Ferguson [12]. It appears to combine some of the best features
separately possessed by previous algorithms, including fast run times,
numerical stability, numerical efficiency (i.e. successfully
recovering a relation when the input is known to only limited
precision), and a guaranteed completion in a polynomially bounded
number of iterations. More recently a much simpler formulation of
this algorithm was developed, and it has been extended to the complex
number field
[13]. This newer, simpler version of PSLQ can be stated as
follows:
Annotation Form Interface