computing multivariate approximate gcd based on barnett's theorem
We present algorithms for multivariate GCD and approximate GCD by modifying Barnett's theorem, which is based on the LU-decomposition of Bzout matrix. Our method is suited for multivariate polynomials with large degrees. Also, we analyze ill-conditioned cases of our method. We show our method is stabler and faster than many other methods.
approximate gcd lifting technique illconditioned problem b&#233 zout matrix