the approximate gcd of inexact polynomials
This paper presents an algorithm and its implementation for computing the approximate GCD (greatest common divisor) of multivariate polynomials whose coefficients may be inexact. The method and the companion software appear to be the first practical package with such capabilities. The most significant features of the algorithm are its robustness and accuracy as demonstrated in computational experiments. In addition, two variations of a squarefree factorization method for multivariate polynomials are proposed as an application of the GCD algorithm.
polynomial greatest common divisor squarefree factorization