A fast GCD algorithm

The algorithms for approximate GCD computation outlined in the previous chapters all have a computational cost which is cubic in the degrees of the polynomials. The only exception is the Euclidean algorithm, which however, in addition to troublesome stability issues, might fail to return an approxim... View More