Abstract
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.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
References
R. Corless, P. Gianni, B. Trager and S. Watt, The Singular Value Decomposition for Polynomial Systems, Proc. of ISSAC’ 95, ACM, 1995, 195–207.
I.Z. Emiris, A. Galligo and H. Lombarbi, Certified Approximate Univariate GCDs, J. Pure and Appl. Alge., 117&118 (1997), 229–251.
S. Gao, E. Kaltofen, J.P. May, Z. Yang and L. Zhi, Approximate Factorization of Multivariate Polynomials via Differential Equations, Proc. of ISSAC’ 04, ACM, 2004, 167–174.
G.H. Golub and C.F. Van Loan, Matrix Computations, Johns Hopkins Univ. Press, Baltimore, Maryland, 1989.
E. Kaltofen, http://www4.ncsu.edu/~kaltofen/software/appfac/issac04_mws/, 2004.
F. Kako and T. Sasaki, Proposal of “Effective Floating-point Number” for Approximate Algebraic Computation, Preprint of Tsukuba Univ., 1997.
K. Li, L. Zhi and M-T. Noda, Solving Approximate GCD of Multivariate Polynomial by Maple/Matlab/C Combination, Proc. of ATCM 2000, World Scientific, 2000, 492–499.
MATLAB Application Program Interface Guide, The Math Works, Inc.
J. Moses and D.Y.Y. Yun, The EZGCD Algorithm, Proc. of ACM National Conference, ACM, 1973, 159–166.
M. Ochi, M-T. Noda and T. Sasaki, Approximate Greatest Common Divisor of Multivariate Polynomials and Its Application to Ill-Conditioned Systems of Algebraic Equations, J. Inform. Proces., 14 (1991), 292–300.
T. Sasaki and M-T. Noda, Approximate Square-free Decomposition and Root-finding of Ill-conditioned Algebraic Equations, J. Inform. Proces., 12 (1989), 159–168.
T. Sasaki and M. Suzuki, Three New Algrithms for Multivariate Polynomial GCD, J. Symb. Comput., 13 (1992), 395–411.
T. Sasaki and S. Yamaguchi, An Analysis of Cancellation Error in Multivariate Hensel Construction with Floating-point Number Arithmetic, Proc. of ISSAC’ 98, ACM, 1998, 1–8.
P.S. Wang, The EEZ-GCD Algorithm, SIGSAM Bulletin 14 (1980), 50–60.
T.Y. Li and Z. Zeng, A Rank-Revealing Method with Updating, Downdating, and Applications, SIAM J. Matrix Anal. Appl., 26 (2005), no. 4, 918–946.
Z. Zeng and B.H. Dayton, The Approximate GCD of Inexact Polynomials Part I I: A Multivariate Algorithm, Proc. of ISSAC’ 04, ACM, 2004, 320–327.
Z. Zeng, mvGCD-http://www.neiu.edu/~zzeng/polynmat.htm, 2004.
L. Zhi, http://www.mmrc.iss.ac.cn/?lzhi/Research/issac04_mws.html, 2004.
L. Zhi and M-T. Noda, Approximate GCD of Multivariate Polynomials, Proc. of ASCM 2000, World Scientific, 2000, 9–18.
L. Zhi and Z. Yang, Computing Approximate GCD of Multivariate Polynomials by Structure Total Least Norm, MM Research Preprint, MMRC, AMSS, Academia, Sinica, 2004, No. 23, 388–401.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Birkhäuser Verlag Basel/Switzerland
About this paper
Cite this paper
Sanuki, M. (2007). Computing Approximate GCD of Multivariate Polynomials. In: Wang, D., Zhi, L. (eds) Symbolic-Numeric Computation. Trends in Mathematics. Birkhäuser Basel. https://doi.org/10.1007/978-3-7643-7984-1_4
Download citation
DOI: https://doi.org/10.1007/978-3-7643-7984-1_4
Publisher Name: Birkhäuser Basel
Print ISBN: 978-3-7643-7983-4
Online ISBN: 978-3-7643-7984-1
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)