A fast algorithm for approximate polynomial gcd based on structured matrix computations

@inproceedings{Bini2008AFA,
  title={A fast algorithm for approximate polynomial gcd based on structured matrix computations},
  author={Dario Bini and Paola Boito},
  year={2008}
}
An O(n) complexity algorithm for computing an 2-greatest common divisor (gcd) of two polynomials of degree at most n is presented. The algorithm is based on the formulation of polynomial gcd given in terms of resultant (Bézout, Sylvester) matrices, on their displacement structure and on the reduction of displacement structured matrices to Cauchy-like form originally pointed out by Georg Heinig. A Matlab implementation is provided. Numerical experiments performed with a wide variety of test… CONTINUE READING