Approximate factorization of multivariate polynomials using singular value decomposition

Journal of Symbolic Computation

Volumn 43, Issue 5, 2008, Pages 359-376

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

^a NORTH CAROLINA STATE UNIVERSITY   (United States)

^b UNIVERSITY OF WATERLOO   (Canada)

^c AMSS   (China)

Author keywords

Approximate factorization; Gauss Newton optimization; Multivariate polynomial factorization; Numerical algebra; Singular value decomposition

Indexed keywords

EID: 40849130160     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jsc.2007.11.005     Document Type: Article

References (46)

1. Botting, B., Giesbrecht, M., May, J., 2005. Using Riemannian SVD for problems in approximate algebra. In: Wang and Zhi (2005), pp. 209-219, distributed at the Workshop in Xi'an, China, July 19-21
2. Chèze, G., 2004. Absolute polynomial factorization in two variables and the knapsack problem. In: Gutierrez (2004), pp. 87-94
3. Corless, R.M., Galligo, A., Kotsireas, I.S., Watt, S.M., 2002. A geometric-numeric algorithm for absolute factorization of multivariate polynomials. In: Mora (2002), pp. 37-45
4. Corless R.M., Gianni P.M., Trager B.M., and Watt S.M. The singular value decomposition for polynomial systems. In: Levelt A.H.M. (Ed). Proc. 1995 Internat. Symp. Symbolic Algebraic Comput. ISSAC'95 (1995), ACM Press, New York, NY 96-103
5. Corless, R.M., Giesbrecht, M.W., van Hoeij, M., Kotsireas, I.S., Watt, S.M., 2001. Towards factoring bivariate approximate polynomials. In: Mourrain (2001), pp. 85-92
6. In: Dumas J.-G. (Ed). ISSAC MMVI Proc. 2006 Internat. Symp. Symbolic Algebraic Comput (2006), ACM Press, New York, NY
7. Emiris I.Z., Galligo A., and Lombardi H. Certified approximate univariate GCDs (Algorithms for Algebra). J. Pure Appl. Algebra 117-118 (1997) 229-251 (special issue)
8. Galligo, A., Rupprecht, D., 2001. Semi-numerical determination of irreducible branches of a reduced space curve. In: Mourrain (2001), pp. 137-142
9. Galligo A., and Rupprecht D. Irreducible decomposition of curves. J. Symbolic Comput. 33 5 (2002) 661-677
10. Galligo A., and Watt S. A numerical absolute primality test for bivariate polynomials. In: Küchlin W. (Ed). ISSAC 97 Proc. 1997 Internat. Symp. Symbolic Algebraic Comput (1997), ACM Press, New York, NY 217-224
11. Gao S. Factoring multivariate polynomials via partial differential equations. Math. Comput. 72 242 (2003) 801-822
12. Gao, S., Kaltofen, E., May, J.P., Yang, Z., Zhi, L., 2004. Approximate factorization of multivariate polynomials via differential equations. In: Gutierrez (2004), pp. 167-174, ACM SIGSAM's ISSAC 2004 Distinguished Student Author Award (May and Yang)
13. 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
14. Giesbrecht, M., Labahn, G., Lee, W., 2004. Symbolic-numeric sparse interpolation of multivariate polynomials (extended abstract). In: Proc. Ninth Rhine Workshop on Computer Algebra, RWCA'04, University of Nijmegen, the Netherlands. pp. 127-139
15. Giesbrecht, M., Labahn, G., Lee, W., 2006. Symbolic-numeric sparse interpolation of multivariate polynomials. In: Dumas (2006), pp. 116-123
16. In: Gutierrez J. (Ed). ISSAC 2004 Proc. 2004 Internat. Symp. Symbolic Algebraic Comput (2004), ACM Press, New York, NY
17. Hitz M.A., Kaltofen E., and Lakshman Y.N. Efficient algorithms for computing the nearest polynomial with a real root and related problems. In: Dooley S. (Ed). Proc. 1999 Internat. Symp. Symbolic Algebraic Comput., ISSAC'99 (1999), ACM Press, New York, NY 205-212
18. Huang Y., Stetter H.J., Wu W., and Zhi L. Pseudofactors of multivariate polynomials. In: Traverso C. (Ed). Internat. Symp. Symbolic Algebraic Comput. ISSAC 2000 Proc. 2000, Internat. Symp. Symbolic Algebraic Comput (2000), ACM Press, New York, NY 161-168
19. 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)
20. 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
21. Kaltofen, E., May, J., 2003. On approximate irreducibility of polynomials in several variables. In: Sendra (2003), pp. 161-168
22. Kaltofen, E., Yang, Z., Zhi, L., 2006. Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials. In: Dumas (2006), pp. 169-176, full version, 21 pages. December 2006 (submitted for publication)
23. Kaltofen E., Yang Z., and Zhi L. Structured low rank approximation of a Sylvester matrix. In: Wang D., and Zhi L. (Eds). Symbolic-Numeric Computation, (Trends in Mathematics) (2007), Birkhäuser Verlag, Basel, Switzerland 69-83 preliminary version in Wang and Zhi (2005), pp. 188-201
24. Kelley C.T. Iterative Methods for Optimization. No. 18 in Frontiers in Applied Mathematics. SIAM, Philadelphia (1999). http://www.siam.org/books/textbooks/fr18_book.pdf
25. Lemmerling P., Mastronardi N., and Van Huffel S. Fast algorithm for solving the Hankel/Toeplitz Structured Total Least Squares problem. Numerical Algorithms 23 (2000) 371-392
26. Li B., Yang Z., and Zhi L. Fast low rank approximation of a Sylvester matrix by structured total least norm. J. JSSAC (Japan Society for Symbolic and Algebraic Computation) 11 3,4 (2005) 165-174
27. May, J., 2005. Approximate factorization of polynomials in many variables and other problems in approximate algebra via singular value decomposition methods. Ph.D. thesis, North Carolina State University
28. In: Mora T. (Ed). ISSAC 2002, Proc. 2002 Internat. Symp. Symbolic Algebraic Comput (2002), ACM Press, New York, NY
29. In: Mourrain B. (Ed). Proc. 2001, Internat. Symp. Symbolic Algebraic Comput. ISSAC 2001 (2001), ACM Press, New York, NY
30. Nagasaka, K., 2002. Towards certified irreducibility testing of bivariate approximate polynomials. In: Mora (2002), pp. 192-199
31. Nagasaka K. Towards more accurate separation bounds of empirical polynomials II. In: Ganzha V.G., Mayr E.W., and Vorozhtsov E.V. (Eds). Computer Algebra in Scientific Computing (8th International Workshop, CASC 2005, Kalamata, Greece, September 12-16, 2005, Proceedings). Lecture Notes Comput. Sci vol. 3718 (2005), Springer Verlag, Heidelberg, Germany 318-329
32. Olshevsky V. Pivoting on structured matrices and rational tangential interpolation. In: Olshevsky V. (Ed). Fast Algorithms for Structured Matrices: Theory and Applications. In: Contemporary Mathematics, No. CONM/323 (2003), AMS 1-75
33. Pan V.Y. Structured Matrices and Polynomials: Unified Superfast Algorithms (2001), Birkhäuser, Boston
34. Park H., Zhang L., and Rosen J.B. Low rank approximation of a Hankel matrix by structured total least norm. BIT 39 4 (1999) 757-779
35. Ruppert W.M. Reduzibilität ebener Kurven. J. Reine Angew. Math. 369 (1986) 167-191
36. Ruppert W.M. Reducibility of polynomials f (x, y) modulo p. J. Number Theory 77 (1999) 62-70
37. Rupprecht D. Semi-numerical absolute factorization of polynomials with integer coefficients. J. Symbolic Comput. 37 5 (2004) 557-574
38. Sasaki, T., 2001. Approximate multivariate polynomial factorization based on zero-sum relations. In: Mourrain (2001), pp. 284-291
39. Sasaki T., Saito T., and Hilano T. Analysis of approximate factorization algorithm I. Japan J. Industrial and Applied Mathem. 9 3 (1992) 351-368
40. Sasaki T., Suzuki M., Kolár ̌ M., and Sasaki M. Approximate factorization of multivariate polynomials and absolute irreducibility testing. Japan J. Industrial and Applied Mathem. 8 3 (1991) 357-375
41. In: Sendra J.R. (Ed). ISSAC 2003 Proc. 2003 Internat. Symp. Symbolic Algebraic Comput (2003), ACM Press, New York, NY
42. Sommese A.J., Verschelde J., and Wampler C.W. Numerical factorization of multivariate complex polynomials (Algebraic and Numerical Algorithms). Theoret. Comput. Sci. 315 2-3 (2004) 651-669 (special issue)
43. D. Wang, and L. Zhi (Eds.), 2005. Internat. Workshop on Symbolic-Numeric Comput. SNC 2005 Proc. Distributed at the Workshop in Xi'an, China, July 19-21
44. Zeng, Z., 2003. A method computing multiple roots of inexact polynomials. In: Sendra (2003), pp. 266-272
45. Zeng, Z., Dayton, B.H., 2004. The approximate GCD of inexact polynomials part II: A multivariate algorithm. In: Gutierrez (2004), pp. 320-327
46. Zhi L. Displacement structure in computing approximate GCD of univariate polynomials. In: Li Z., and Sit W. (Eds). Proc. Sixth Asian Symposium on Computer Mathematics, ASCM 2003. Lecture Notes Series on Computing vol. 10 (2003), World Scientific, Singapore 288-298