Numerical primary decomposition

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

Volumn , Issue , 2008, Pages 165-172

  Leykin, Anton ^a  

^a UNIVERSITY OF MINNESOTA   (United States)

Author keywords

Deflation; Numerical algebraic geometry; Polynomial homotopy continuation; Primary decomposition

Indexed keywords

COMPLEX SPACES; DEFLATION; EMBEDDED COMPONENTS; EXISTING METHODS; HIGHER DIMENSIONS; IRREDUCIBLE DECOMPOSITIONS; MEMBERSHIP PROBLEMS; NUMERICAL ALGEBRAIC GEOMETRY; PRIMARY DECOMPOSITION; PRIMARY DECOMPOSITIONS;

NUMERICAL METHODS;

EID: 57449089938     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1390768.1390793     Document Type: Conference Paper

References (20)

1. G. Attardi and C. Traverso. Strategy-accurate parallel Buchberger algorithms. J. Symbolic Comput., 21(4-6):411-425, 1996.
2. D. J. Bates, J. D. Hauenstein, A. J. Sommese, and C. W. Wampler. Bertini: software for numerical algebraic geometry. Available at http://www.nd.edu/ ̃sommese/bertini,
3. M. Caboara, P. Conti, and C. Traverso. Yet another ideal decomposition algorithm. In Applied algebra, algebraic algorithms and error-correcting codes (Toulouse, 1997), volume 1255 of Lecture Notes in Comput. Sci., pages 39-54. Springer, Berlin, 1997.
4. B. Dayton and Z. Zeng. Computing the multiplicity structure in solving polynomial systems. In M. Kauers, editor, Proceedings of the 2005 International Symposium on Symbolic and Algebraic Computation, pages 116-123. ACM, 2005.
5. W. Decker, G.-M. Greuel, and G. Pfister. Primary decomposition: algorithms and comparisons. In Algorithmic algebra and number theory (Heidelberg, 1997), pages 187-220. Springer, Berlin, 1999.
6. D. Eisenbud, C. Huneke, and W. Vasconcelos. Direct methods for primary decomposition. Invent. Math., 110(2):207-235, 1992.
7. P. Gianni, B. Trager, and G. Zacharias. Gröbner bases and primary decomposition of polynomial ideals. J. Symbolic Comput., 6(2-3):149-167, 1988. Computational aspects of commutative algebra.
8. D. R. Grayson and M. E. Stillman. Macaulay 2, a software system for research in algebraic geometry. Available at http://www.math.uiuc.edu/Macaulay2/ .
9. G. Lecerf. Quadratic Newton iteration for systems with multiplicity. Found. Comput. Math., 2:247-293, 2002.
10. A. Leykin. Numerical primary decomposition (webpage). www.math.umn.edu/̃leykin/NPD.
11. A. Leykin. PHCmaple: A Maple interface to the numerical homotopy algorithms in PHCpack. www.math.umn.edu/̃leykin/PHCmaple.
12. A. Leykin, J. Verschelde, and A. Zhao. Newton's method with deflation for isolated singularities of polynomial systems. Theoretical Computer Science, 359(1-3):111-122, 2006.
13. A. Leykin, J. Verschelde, and A. Zhao. Higher-order deflation for polynomial systems with isolated singular solutions. In A. Dickenstein, F.-O. Schreyer, and A. J. Sommese, editors, Algorithms in Algebraic Geometry, volume 146 of The IMA Volumes in Mathematics and its Applications. Springer, 2008.
14. F. S. Macaulay. The algebraic theory of modular systems. Cambridge Mathematical Library. Cambridge University Press, Cambridge, 1994. Revised reprint of the 1916 original, With an introduction by Paul Roberts.
15. B. Mourrain. Isolated points, duality and residues. J. Pure Appl. Algebra, 117/118:469-493, 1997. Algorithms for algebra (Eindhoven, 1996).
16. T. Shimoyama and K. Yokoyama. Localization and primary decomposition of polynomial ideals. J. Symbolic Comput., 22(3):247-277, 1996.
17. A. Sommese, J. Verschelde, and C. Wampler. Numerical decomposition of the solution sets of polynomial systems into irreducible components. SIAM J. Numer. Anal, 38(6): 2022-2046, 2001.
18. A. J. Sommese and C. W. Wampler, II. The numerical solution of systems of polynomials. World Scientific Publishing Co. Pte. Ltd., Hackensack, NJ, 2005.
19. A. Steel. Conquering inseparability: primary decomposition and multivariate factorization over algebraic function fields of positive characteristic. J. Symbolic Comput., 40(3): 1053-1075, 2005.
20. J. Verschelde. Algorithm 795: PHCpack: A general-purpose solver for polynomial systems by homotopy continuation. ACM Trans. Math. Softw., 25(2):251-276, 1999. Software available at http://www.math.uic.edu/̃Jan.