A new algorithm for computing the approximate GCD of multivariate polynomials is proposed by modifying the PC-PRS algorithm for exact GCD. We have implemented the new algorithm and compared it by typical examples with (approximate) PRS, (approximate) EZ-GCD algorithms and two new algorithms based on SVD. The experiment shows a good performance of our algorithm.
CITATION STYLE
Sanuki, M. (2007). Computing approximate GCD of multivariate polynomials. In Trends in Mathematics (Vol. 41, pp. 55–68). Springer International Publishing. https://doi.org/10.1007/978-3-7643-7984-1_4
Mendeley helps you to discover research relevant for your work.