Computing multivariate approximate GCD based on Barnett's theorem

Abstract

We present algorithms for multivariate GCD and approximate GCD by modifying Barnett's theorem, which is based on the LU-decomposition of Bézout 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.