The PSLQ procedure can be regarded as a jazzed-up version of an integer-relation algorithm dating back more than 2,000 years to the Greek geometer Euclid of Alexandria (365–300 B.C.). The Euclidean ...

I'm looking for what the title says. Euclidean algorithm works and is fast for just a pair of numbers, but I don't see any obvious generalizations. A quick googling didn't turn up anything too ...

This paper shows that there is a close relationship between the Euclidean algorithm for polynomials and the Lanczos method for solving sparse linear systems, especially when working over finite fields ...