Approximate factorization of multivariate polynomials via differential equations

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

Volumn , Issue , 2004, Pages 167-174

  Gao, Shuhong ^a   Kaltofen, Erich ^b   May, John ^b   Yang, Zhengfeng ^c   Zhi, Lihong ^c  

^a CLEMSON UNIVERSITY   (United States)

^b NORTH CAROLINA STATE UNIVERSITY   (United States)

^c AMSS   (China)

Author keywords

Approximate factorization; Approximate gcd; Multivariate gcd; Multivariate polynomial factorization; Singular value decomposition; Symbolic numeric hybrid method

Indexed keywords

ALGORITHMS; ERROR ANALYSIS; NUMERICAL ANALYSIS; PERTURBATION TECHNIQUES; POLYNOMIALS;

APPROXIMATE FACTORIZATION; APPROXIMATE GCD; MULTIVARIATE GCD; MULTIVARIATE POLYNOMIAL FACTORIZATION; SINGULAR VALUE DECOMPOSITION;

DIFFERENTIAL EQUATIONS;

EID: 27644556543     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1005285.1005311     Document Type: Conference Paper

References (34)

1. CHÈZE, G., AND GALLIGO, A. From an approximate to an exact absolute polynomial factorization. Paper submitted, 22 pages, 2003.
2. CORLESS, R. M., GALLIGO, A., KOTSIREAS, I. S., AND WATT, S. M. A geometric-numeric algorithm for absolute factorization of multivariate polynomials. In Mora [20], pp. 37-45.
3. CORLESS, R. M., GIANNI, P. M., TRAGER, B. M., AND WATT, S. M. The singular value decomposition for polynomial systems. In Proc. 1995 Internat. Symp. Symbolic Algebraic Comput. ISSAC'95 (New York, N. Y., 1995), A. H. M. Levelt, Ed., ACM Press, pp. 96-103.
4. CORLESS, R. M., GIESBRECHT, M. W., VAN HOEIJ, M., KOTSIREAS, I. S., AND WATT, S. M. Towards factoring bivariate approximate polynomials. In Mourrain [21], pp. 85-92.
5. EMIRIS, I. Z., GALLIGO, A., AND LOMBARDI, H. Certified approximate univariate GCDs. J. Pure Applied Algebra 117 & 118 (May 1997), 229-251. Special Issue on Algorithms for Algebra.
6. GALLIGO, A., AND WATT, S. A numerical absolute primality test for bivariate polynomials. In ISSAC 97 Proc. 1997 Internat. Symp. Symbolic Algebraic Comput. (New York, N. Y., 1997), W. Küchlin, Ed., ACM Press, pp. 217-224.
7. GAO, S. Factoring multivariate polynomials via partial differential equations. Math. Comput. 72, 242 (2003), 801-822
8. GELFOND, A. O. Transcendental and algebraic numbers. Translated from the 1st Russian ed. by Leo F. Boron. Dover, New York, 1960.
9. GIANNI, P., SEPPÄLÄ, M., SILHOL, R., AND TRAGER, B. Riemann surfaces, plane algebraic curves and their period matrices. J. Symbolic Comput. 26, 6 (1998), 789-803.
10. GIESBRECHT, M., LABAHN, G., AND LEE, W.-S. Symbolic-numeric sparse interpolation of multivariate polynomials (extended abstract). In Proc. Ninth Rhine Workshop on Computer Algebra (RWCA '04), University of Nijmegen, the Netherlands (2004), pp. 127-139. Full paper under preparation.
11. GOLUB, G. H., AND VAN LOAN. C. F. Matrix Computations, third ed. Johns Hopkins University Press, Baltimore, Maryland, 1996.
12. HITZ, M. A., KALTOFEN, E., AND LAKSHMAN Y. N. Efficient algorithms for computing the nearest polynomial with a real root and related problems. In Proc. 1999 Internat. Symp. Symbolic Algebraic Comput. (ISSAC'99) (New York, N. Y., 1999), S. Dooley, Ed., ACM Press, pp. 205-212.
13. HUANG, Y., WU, W., STETTER, H. J., AND ZHI, L. Pseudofactors of multivariate polynomials. In Internat. Symp. Symbolic Algebraic Comput. ISSAC 2000 Proc. 2000 Internat. Symp. Symbolic Algebraic Comput. (New York, N. Y., 2000), C. Traverso, Ed., ACM Press, pp. 161-168.
14. KALTOFEN, E. Fast parallel absolute irreducibility testing. J. Symbolic Comput. 1, 1 (1985), 57-67. Misprint corrections: J: Symbolic Comput. vol. 9, p. 320 (1989).
15. KALTOFEN, E. Challenges of symbolic computation my favorite open problems. J. Symbolic Comput. 29, 6 (2000), 891-919. With an additional open problem by R. M. Corless and D. J. Jeffrey.
16. KALTOFEN, E. The art of symbolic computation, Mar. 2002. Colloquium at the University of Waterloo. Transparencies at http://www.math.ncsu.edu/ ~kaltofan/bibliography/02/waterloo.pdf.
17. KALTOFEN, E., AND MAY, J. On approximate irreducibility of polynomials in several variables. In Sendra [29], pp. 161-168.
18. KALTOFEN, E., AND TRAGER, B. Computing with polynomials given by black boxes for their evaluations: Greatest common divisors, factorization, separation of numerators and denominators. J. Symbolic Comput. 9, 3 (1990), 301-320.
19. LI, T. Y., AND ZENG, Z. A rank-revealing method and its application. Manuscript available at http://www.neiu.edu/~zzeag/papera.htm, 2003.
20. MORA, T., Ed. ISSAC 2002 Proc. 2002 Internat. Symp. Symbolic Algebraic Comput. (New York, N. Y., 2002), ACM Press.
21. MOURRAIN, B., Ed. ISSAC 2001 Proc. 2001 Internat. Symp. Symbolic Algebraic Comput. (New York, N. Y., 2001), ACM Press.
22. NAGASAKA, K. Towards certified irreducibility testing of bivariate approximate polynomials. In Mora [20], pp. 192-199.
23. NAGASAKA, K., June 2003. Private email commun.
24. RUPPERT, W. M. Reductibility of polynomials f(x,y) modulo p. J. Number Theory 77 (1999), 62-70.
25. RUPPRECHT, D. Semi-numerical absolute factorization of polynomials with integer coefficients. J. Symbolic Comput. 37, 5 (2004), 557-574.
26. SASAKI, T. Approximate multivariate polynomial factorization based on zero-sum relations. In Mourrain [21], pp. 284-291.
27. SASAKI, T., SAITO, T., AND HILANO, T. Analysis of approximate factorization algorithm I. Japan J. of Industrial and Applied Mathem. 9, 3 (Oct. 1992), 351-368.
28. SASAKI, T., SUZUKI, M., KOLÁŘ, M., AND SASAKI, M. Approximate factorization of multivariate polynomials and absolute irreducibility testing. Japan J. of Industrial and Applied Mathem. 8, 3 (Oct. 1991), 357-375.
29. SENDRA, J. R., Ed. ISSAC 2003 Proc. 2003 Internat. Symp. Symbolic Algebraic Comput. (New York, N. Y., 2003), ACM Press.
30. SOMMESE, A. J., VERSCHELDE, J., AND WAMPLER, C. W. Numerical factorization of multivariate complex polynomials. Theoretical Comput. Sci. 315, 2-3 (2004), 651-669.
31. STEWART, G. W. Error and perturbation bounds for subspaces associated with certain eigenvalue problems. SIAM Review 15, 4 (Oct. 1973), 727-764.
32. ZENG, Z. A method computing multiple roots of inexact polynomials. In Sendra [29], pp. 266-272.
33. ZENG, Z., AND DAYTON, B. H. The approximate GCD of inexact polynomials part II: a multivariate algorithm. In ISSAC 2004 Proc. 2004 Internat. Symp. Symbolic Algebraic Comput. (New York, N. Y., 2004), J. Gutierrez, Ed., ACM Press. These proceedings.
34. ZHI, L. Displacement structure in computing approximate GCD of univariate polynomials. In Proc. Sixth Asian Symposium on Computer Mathematics (ASCM 2003) (Singapore, 2003), Z. Li and W. Sit, Eds., vol. 10 of Lecture Notes Series on Computing, World Scientific, pp. 288-298.