The approximate GCD of inexact polynomials part II: A multivariate algorithm

Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC

Volumn , Issue , 2004, Pages 320-327

  Zeng, Zhonggang ^a   Dayton, Barry H ^a  

^a NORTHEASTERN ILLINOIS UNIVERSITY   (United States)

Author keywords

Factorization; Greatest common divisor; Polynomial; Squarefree

Indexed keywords

FACTORIZATION; GREATEST COMMON DIVISOR (GCD); SQUAREFREE;

ALGORITHMS; COMPUTATIONAL METHODS; COMPUTER SOFTWARE; POLYNOMIALS;

MULTIVARIABLE SYSTEMS;

EID: 27644526086     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. W. S. Brown. On Euclid algorithm and the computation of polynomial greatest common divisors. J. Assoc. Comput. Mach., 18:478-504, 1971.
2. R. M. Corless, P. M. Gianni, B. M. Trager, and S. M. Watt. The singular value decomposition for polynomial systems. Proc. ISSAC '95, ACM Press, pp 195-207, 1995.
3. R. M. Corless, M. Giesbrecht, M. van Hoeij, I. Kotsireas, and S. Watt. Towards factoring bivariate approximate polynomials. Proc. ISSAC'01, ACM Press, pages 85-92, 2001.
4. I. Z. Emiris, A. Galligo, and H. Lombardi. Certified approximate univariate GCDs. J. Pure Appl. Algebra, 117/118:229-251, 1997.
5. S. Gao. Factoring multivariate polynomials via partial differential equations. Math. Comp., 72:801-822, 2003.
6. V. Hribernig and H. J. Stetter. Detection and validation of clusters of polynomial zeros. J. Symb. Comput., 24:667-681, 1997.
7. E. Kaltofen. Challenges of symbolic computation: my favorite open problems. J. Symb. Comput., 29:161-168, 2000.
8. N. K. Karmarkar and Y. N. Lakshman. Approximate polynomial greatest common divisors and nearest singular polynomials. Proc. ISSAC'96, pp 35-42, ACM Press, 1996.
9. T. Y. Li and Z. Zeng. A rank-revealing method and its applications, to appear: SIAM J. Matrix Anal. Appl.
10. H.-C. Liao and R. J. Fateman. Evaluation of the heuristic polynomial GCD. Proc. ISSAC'95, ACM Press, 1995.
11. M.-A. Ochi, M. Noda, and T. Sasaki. Approximate greatest common divisor of multivariate polynomials and its application to ill-conditioned system of algebraic equations. J. Inf. Proces, 12:292-300, 1991.
12. S. Pillai and B. Liang. Blind image deconvolution using GCD approach. IEEE Trans. Image Processing, 8:202-219, 1999.
13. D. Rupprecht. An algorithm for computing certified approximate GCD of n univariate polynomials. J. Pure and Appl. Alg., 139:255-284, 1999.
14. T. Sasaki and M. Sasaki. Polynomial remainder sequence and approximate GCD. ACM SIGSAM Bulletin, 31:4-10, 1997.
15. H. J. Stetter. Numerical Polynomial Algebra. SIAM, 2004.
16. F. Šroubek and J. Flusser. Multichannel blind iterative image restoration. IEEE Trans. Image Processing, 9:1094-1106, 2003.
17. D. Y. Y. Yun. On square-free decomposition algorithms. Proc. ISSAC '76, ACM Press, pp 26-35, 1976.
18. Z. Zeng. The approximate GCD of inexact polynomials. Part I: a univariate algorithm. Preprint, 2004.
19. Z. Zeng. A method computing multiple roots of inexact polynomials. Proc. ISSAC '03, ACM Press, pp 266-272, 2003.
20. Z. Zeng. Multroot - a Matlab package for computing polynomial roots and multiplicities, to apprear: ACM Trans. Math. Software, 2004.
21. L. Zhi, K. Li, and M.-T. Noda. Approximate GCD of multivariate polynomials using Hensel lifting. MM Research Preprint 241-248, MMRC, AMSS, Academia, Sinica, Beijing, China, No. 21, 2001, 2001.
22. L. Zhi and M.-T. Noda. Approximate GCD of multivariate polynomials. Proc. ASCM 2000, World Scientific Press, pages 9-18, 2000.