Computing the multiplicity structure in solving polynomial systems

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

Volumn 2005, Issue , 2005, Pages 116-123

  Dayton, Barry H ^a   Zeng, Zhonggang ^a  

^a NORTHEASTERN ILLINOIS UNIVERSITY   (United States)

Author keywords

Dual space; Multiplicity; Polynomial ideal

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; POLYNOMIALS; PROBLEM SOLVING;

DUAL SPACE THEORY; MULTIPLICITY; POLYNOMIAL IDEAL; POLYNOMIAL SYSTEMS;

COMPUTATION THEORY;

EID: 33746339066     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1073884.1073902     Document Type: Conference Paper

References (25)

1. R. M. CORLESS, P. M. GIANNI, AND B. M. TRAGER, A reordered Schur factorization method for zero-dimensional systems with multiple roots. Proc. ISSAC '97, AMS Press, pp 133-140.
2. D. COX, J. LITTLE, AND D. O'SHEA, Using Algebraic Geometry, Springer Verlag, 1998.
3. D. W. DECKER, H. B. KELLER, AND C. T. KELLY, Convergence rate for Newton's method at singular points, SIAM J. Nurner. Anal., 20 (1983), pp. 296-314.
4. J. C. FAUGÈRE, A new efficient algorithm for computing Göbner bases, Journal of Pure and Applied Algebra, 139 (1998), pp. 61-88.
5. W. FULTON, Intersection Theory, Springer Verlag, Berlin, 1984.
6. G.-M. GREUEL AND G. PFISTER, A Singular Introduction to Commutative Algebra, Springer Verlag, 2002.
7. G.-M. GREUEL, G. PFISTER, AND H. SCHÖNEMANN, SINGULAR 2.0. A Computer Algebra System for Polynomial Computations. Centre for Computer Algebra, University of Kaiserslautern (2001). http://www.singular.uni-kl.de.
8. H. KOBAYASHI, H. SUZUKI, AND Y. SAKAI, Numerical calculation of the multiplicity of a solution to algebraic equations, Math. Comp., 67 (1998), pp. 257-270.
9. A. LEYKIN, J. VERSCHELDE, AND A. ZHAO, Newton's method with deflation for isolated singularities of polynomial systems. Preprint, (2004).
10. T. Y. Li AND Z. ZENG, A rank-revealing method with updating, downdating and applications, to appear: SIAM J. Matrix Anal. Appl.
11. F. S. MACAULAY, The Algebraic Theory of Modular Systems, Cambridge Univ, Press, 1916.
12. D. MANOCHA AND J. DEMMEL, Algorithms for intersecting parametric and algebraic curves II: multiple intersections, Graphical Models and Image Processing, 57 (1995), pp. 81-100.
13. M. G. MARINARI, T. MORA, AND H. M. MÖLLER, On multiplicities in polynomial system solving, Trans. AMS, 348 (1996), pp. 3283-3321.
14. H. M. MÖLLER AND H. J. STETTER, Multivariate polynomial equations with multiple zeros solved by matrix eigenproblems, Numer. Math., 70 (1995), pp. 311-329.
15. T. MORA, Solving Polynomial Equation Systems II. manuscript.
16. S. MORITSUGU AND K. KURIYAMA, On multiple zeros of systems of algebraic equations. Proc. of ISSAC '99, ACM Press, pp 23-30, 1999, 1999.
17. T. OJIKA, Modified deflation algorithm for the solution of singular problems, J. Math. Anal. Appl., 123 (1987), pp. 199-221.
18. A. J. SOMMESE, J. VERSCHELDE, AND C. W. WAMPLER, Numerical decomposition of the solution sets of polynomial systems into irreducible components, SIAM J. Numer. Anal., 38 (2001), pp. 2022-2046.
19. R. P. STANLEY, Hilbert function of graded algebras, Advances in Math., 28 (1973), pp. 57-83.
20. H. J. STETTER, Analysis of zero clusters in multivariate polynomial systems. Proc. of ISSAC '96, ACM Press, pp 127-136, 1996.
21. _, Matrix eigenproblems are at the heart of polynomial system, solving, SIGSAM Bull., (1996), pp. 22-25.
22. _, Numerical Polynomial Algebra, SIAM, Philadelphia, 2004.
23. B. STURMFELS, Solving Systems of polynomial Equations, Number 97 in CBMS Regional Conference Series in Mathematics, AMS, 2002.
24. G. H. THALLINGER, Analysis of zero clusters in multivariate polynomial systems. Diploma Thesis, Tech, Univ. Vienna, 1996.
25. Z. ZENG AND B. H. DAYTON, The approximate GCD of inexact polynomials, II: a multivariate algorithm. Proc. of ISSAC '04, ACM Press, pp 320-327, 2004.