DISPLACEMENT STRUCTURE IN COMPUTING APPROXIMATE GCD OF UNIVARIATE POLYNOMIALS
Lihong Zhi · 2003
We propose a fast algorithm for computing approximate GCD of univariate polynomials with coefficients that are given only to a finite accuracy. The algorithm is based on a stabilized version of the generalized Schur algorithm for Sylvester matrix and its embedding. All computations can be done in O(n 2) operations, where n is the sum of the degrees of polynomials. The stability of the algorithm is also discussed. 1.