Numerical algebraic geometry and symbolic computation

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

Volumn , Issue , 2004, Pages 3-

  Verschelde, Jan ^a  

^a UNIVERSITY OF ILLINOIS AT CHICAGO   (United States)

Author keywords

Approximate factorization; Irreducible decomposition; Numerical homotopy continuation; Polynomial systems

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL METHODS; MATRIX ALGEBRA; MEMBERSHIP FUNCTIONS; NUMERICAL METHODS; POLYNOMIALS;

APPROXIMATE FACTORIZATION; IRREDUCIBLE DECOMPOSITION; NUMERICAL HOMOTOPY CONTINUATION; POLYNOMIAL SYSTEMS;

COMPUTATIONAL GEOMETRY;

EID: 27644452721     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1005285.1005288     Document Type: Conference Paper

References (10)

1. R. Corless, M. Giesbrecht, M. van Hoeij, I. Kotsireas, and S. Watt. Towards factoring bivariate approximate polynomials. In B. Mourrain, editor, Proceedings of ISSAC 2001, pages 85-92. ACM, 2001.
2. R. Corless, A. Galligo, I. Kotsireas, and S. Watt. A geometric-numeric algorithm for factoring multivariate polynomials. In T. Mora, editor, Proceedings of ISSAC 2002. pages 37-45. ACM, 2002.
3. A. Galligo and D. Rupprecht. Semi-numerical determination of irreducible branches of a reduced space curve. In B. Mourrain, editor, Proceedings of ISSAC 2001, pages 137-142. ACM, 2001.
4. A. Galligo and D. Rupprecht. Irreducible decomposition of curves. J. Symbolic Computation, 33(5):661-677, 2002.
5. S. Gao, E. Kaltofen, J. May, Z. Yang, and L. Zhi. Approximate factorization of multivariate polynomials via differential equations. In J. Gutierrez, editor, Proceedings of ISSAC 2004 (this volume).
6. M. Giusti and J. Heintz. La détermination de la dimension et des points isolées d'une variété algébrique peuvent s'effectuer en temps polynomial. In D. Eisenbud and L. Robbiano, editors, Computational Algebraic Geometry and Commutative Algebra, Cortona 1991, pages 216-256. Cambridge UP, 1993.
7. M. Giusti, G. Lecerf, and B. Salvy. A Gröbner free alternative for polynomial system solving. Journal of Complexity, 17(1):154-211, 2001.
8. E. Kaltofen. Challenges of symbolic computation: my favorite open problems. J. Symbolic Computation, 29(6):891-919, 2000.
9. G. Lecerf. Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers. Journal of Complexity, 19(4):564-596, 2003.
10. T. Sasaki. Approximate multivariate polynomial factorization based on zero-sum relations. In B. Mourrain, editor, Proceedings of ISSAC 2001, 284-291. ACM, 2001.