Solving parametric polynomial systems

Journal of Symbolic Computation

Volumn 42, Issue 6, 2007, Pages 636-667

  Lazard, Daniel ^a   Rouillier, Fabrice ^a  

^a UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

Author keywords

Algorithms; Computer algebra; Constructible set; Discriminant variety; Parametric polynomial system; Polynomial system; Semi algebraic set; Solving

Indexed keywords

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

References (24)

1. Aubry P., Lazard D., and Moreno-Maza M. On the theories of triangular sets. Polynomial Elimination. Journal of Symbolic Computation 28 1 (1999) 105-124
2. Becker T., and Weispfenning V. Gröbner bases: A computational approach to commutative algebra. Graduate Texts in Mathematics: Readings in Mathematics (1993), Springer
3. Collins G.E. Quantifier elimination for real closed fields by cylindrical algebraic decomposition. Lecture Notes in Computer Science 33 (1975) 515-532
4. Corvez, S., 2005. Etude de systèmes polynomiaux: Contributions à la classification d'une famille de manipulateurs et au calculs des intersections de courbes A-splines. Ph.D. Thesis, Université de Rennes 1
5. Corvez S., and Rouillier F. Using computer algebra tools to classify serial manipulators. Automated Deduction in Geometry. Lecture Notes in Artificial Intelligence vol. 2930 (2003), Springer 31-43
6. Cox D., Little J., and O'Shea D. Ideals, varieties, and algorithms: An introduction to computational algebraic geometry and commutative algebra. Undergraduate Texts in Mathematics (1992), Springer
7. Eisenbud D., Huneke C., and Vasconcelos W. Direct methods for primary decomposition. Inventiones Mathematicae 110 (1992) 207-235
8. Gianni P., Trager B., and Zacharias G. Gröbner bases and primary decomposition of polynomial ideals. Journal of Symbolic Computation 6 2 (1988) 149-168
9. Grigoriev, D., Vorobjov, N., 2000. Bounds on numbers of vectors of multiplicities for polynomials which are easy to compute. In: ISSAC: Proceedings of the ACM SIGSAM International Symposium on Symbolic and Algebraic Computation
10. Lazard D. On the specification for solvers of polynomial systems. 5th Asian Symposium on Computers Mathematics. ASCM 2001. Lecture Notes Series in Computing vol. 9 (2001), World Scientific 66-75
11. Lazard D. Injectivity of real rational mappings: The case of a mixture of two Gaussian laws. Mathematics and Computers in Simulation 67 1-2 (2004) 67-84
12. Lazard D. Computing with parameterized varieties. Mathematics and Visualization (2006), Springer 53-69
13. Matsumura H. Commutative Theory Ring. second ed. Cambridge Studies in Advanced Mathematics vol. 8 (1989), Cambridge University Press Translated from Japanese by M. Reid
14. Manubens M., and Montes A. Improving the DISPGB algorithm using the discriminant ideal. Journal of Symbolic Computation 41 11 (2006) 1245-1263 (special issue on the occasion of Volker Weispfennig's 60th Birthday)
15. Moroz, G., 2006. Complexity of the resolution of parametric systems of equations and inequations. In: proceedings of the ISSAC'06 conference, pp. 246-253. Best student paper award
16. Mumford D. Algebraic Geometry I, Complex Projective Varieties (1976), Springer
17. Mumford D. The red book of varieties and schemes. Lecture Notes in Mathematics vol. 1358 (1988)
18. Safey El Din M., and Schost E. Polar varieties and computation of one point in each connected component of a smooth real algebraic set. In: Sendra J.R. (Ed). International Symposium on Symbolic and Algebraic Computation 2003. ISSAC'2003, Philadelphia, USA (August 2003), ACM Press 224-231
19. Safey El Din M., and Schost E. Properness defects of projection functions and computation of at least one point in each connected component of a real algebraic set. Journal of Discrete and Computational Geometry 32 3 (September 2004) 417-430
20. Schost E. Computing parametric geometric resolutions. Applicable Algebra in Engineering, Communication and Computing 13 5 (2003) 349-393
21. Wang D. Elimination Methods (2001), Springer
22. Weispfenning V. Comprehensive Gröbner bases. Journal of Symbolic Computation 14 (1992) 1-29
23. Weispfenning V. Solving Parametric Polynomial Equations and Inequalities by Symbolic Algorithms (1995), World Scientific
24. Yang, L., Zeng, Z., 2000. Equi-Cevaline points on triangles. In: World Scientific (Ed.), Proceedings of the Fourth Asian Symposium. In: Computer Mathematics, pp. 130-137