Real solving for positive dimensional systems

Journal of Symbolic Computation

Volumn 34, Issue 6, 2002, Pages 543-560

  Aubry, Philippe ^a   Rouillier, Fabrice ^b   Safey El Din, Mohab ^a  

^a UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

^b INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0036901031     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1006/jsco.2002.0563     Document Type: Article

References (27)

1. Aubry, P. (1999). Ensembles triangulaires de polynômes et résolution de systèmes algébriques. Ph.D. Thesis, Université Paris 6, France.
2. Aubry, P., Lazard, D., Moreno Maza, M. (1999). On the theories of triangular sets. J. Symb. Comput., 28, 105-124.
3. Bank, B., Giusti, M., Heintz, J., MBakop, G. (2001). Polar varieties and efficient real elimination. Math. Z., 238, 115-144.
4. Basu, S., Pollack, R., Roy, M. F. (1994). A new algorithm to find a point in every cell defined by a family of polynomials. In Caviness, B., Johnson, J. eds, Quantifier Elimination and Cylindrical Algebraic Decomposition, Texts and Mongraphs in Symbolic Computation, pp. 341-349. Wien, Springer.
5. Basu, S., Pollack, R., Roy, M. F. (1996). On the combinatorial and algebraic complexity of quantifier elimination. J. Assoc. Comput. Mach., 43, 1002-1045.
6. Becker, E., Neuhaus, R. (1993). Computation of real radicals for polynomial ideals. In Comput. Algebr. Geom, Volume 109 of Progress in Mathematics, pp. 1-20. Birkhaüser.
7. Bini, D., Mourrain, B. (2000). The FRISCO polynomial test suite. http://www-sop. inria.fr/saga/POL.
8. Canny, J. (1994). A toolkit for nonlinear algebra. In Goldberg, K. et al. eds, Algorithmic Foundations of Robotics, San Francisco, CA, USA, 17-19 February. Workshop on the Algorithmic Foundations of Robotics '94.
9. Collins, G. E. (1975). Quantifier elimination for real closed fields by cylindrical algebraic decomposition. Volume 33 of Springer Lecture Notes in Computer Science, pp. 515-532.
10. Conti, P., Traverso, C. (1998). Algorithms for the real radical. Unpublished manuscript.
11. Cox, D., Little, J., O'Shea, D. (1992). Ideals, Varieties and Algorithms, Undergraduate Texts in Mathematics. New York, Springer.
12. Faugère, J.-C., Moreau de Saint Martin, F., Rouillier, F. (1998). Design of nonseparable bidimensional wavelets and filter banks using Groebner basis techniques. IEEE SP Transactions Special Issue on Theory and Applications of Filter Banks and Wavelets, 46, 845-856.
13. Grigor'ev, D., Vorobjov, N. (1988). Solving systems of polynomial inequalities in sub-exponential time. J. Symb. Comput., 5, 37-64.
14. Heintz, J., Roy, M.-F., Solernó, P. (1989). On the complexity of semi-algebraic sets. In IFIP 89, pp. 293-298. San Francisco, CA, North-Holland.
15. Heintz, J., Roy, M.-F., Solernó, P. (1993). On the theoretical and practical complexity of the existential theory of the reals. Comput. J., 36, 427-431.
16. Hong, H. (1991). Comparison of several decision algorithms for the existential theory of the reals. Technical Report, RISC Linz.
17. Moreno Maza, M. (1997). Calculs de pgcd au-dessus des tours d'extensions simples et résolution des systèmes d'équations algébriques. Ph.D. Thesis, Université Paris 6, France.
18. Mumford, D. (1976). Algebraic Geometry I, Complex Projective Varieties. Berlin, Springer.
19. Renegar, J. (1992). On the computational complexity and geometry of the first-order theory of the reals. J. Symb. Comput., 13, 255-352.
20. Rouillier, F. (1996). Algorithmes efficaces pour l'étude des zéros réels des systèmes polynomiaux. Ph.D. Thesis, Université de Rennes I, France.
21. Rouillier, F. (1999). Solving zero-dimensional systems through the rational univariate representation. J. Appl. Algeb. Eng. Commun. Comput., 9, 433-461.
22. Rouillier, F., Roy, M. F., Safey El Din, M. (2000a). Finding at least one point in each connected component of a real algebraic set defined by a single equation. J. Complexity, to appear.
23. Rouillier, F., Safey El Din, M., Schost, É. (2000b). Solving the birkhoff interpolation problem via the critical point method: an experimental study. In Proceedings of ADG'2000.
24. Roy, M. F. (1996). Basic algorithms in real algebraic geometry: from Sturm theorem to the existential theory of reals. In Broglia, F. ed., Lectures on Real Geometry, Volume 23 of Expositions in Mathematics, pp. 1-67. New York, de Gruyter.
25. Safey El Din, M. (2001). Résolution réelle des systèmes polynomiaux en dimension positive. Ph.D. Thesis, Université Paris 6, France.
26. Seidenberg, A. (1954). A new decision method for elementary algebra. Ann. Math., 60, 365-374.
27. UMS Medicis, (2000). http://medicis.polytechnique.fr/.