Properness defects of projections and computation of at least one point in each connected component of a real algebraic set

Discrete and Computational Geometry

Volumn 32, Issue 3, 2004, Pages 417-430

  Safey El Din, Mohab ^a   Schost, Éric ^b  

^a UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

^b ECOLE POLYTECHNIQUE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 4744362177     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00454-004-1107-5     Document Type: Article

References (56)

1. M. E. Alonso, E. Becker, M.-F. Roy, and T. Wörmann. Zeros, multiplicities and idempotents for zero-dimensional systems. In Algorithms in Algebraic Geometry and Applications. Proceedings MEGA '94, pages 1-15. Volume 142 of Progress in Mathematics. Birkhäuser, Boston, MA, 1996.
2. P. Aubry. Ensembles triangulaires de polynômes et résolution de systèmes algébriques. Ph.D. thesis, Université Paris 6, 1999.
3. P. Aubry, D. Lazard, and M. Moreno Maza. On the theories of triangular sets. Journal of Symbolic Computation, Special Issue on Polynomial Elimination, 28:105-124, 1999.
4. P. Aubry, F. Rouillier, and M. Safey El Din. Real solving for positive dimensional systems. Journal of Symbolic Computation, 34(6):543-560, December 2002.
5. B. Bank, M. Giusti, J. Heintz, and G.-M. Mbakop. Polar varieties and efficient real equation solving: the hypersurface case. Journal of Complexity, 13(1):5-27, 1997.
6. B. Bank, M. Giusti, J. Heintz, and G.-M. Mbakop. Polar varieties and efficient real elimination. Mathematische Zeitschrift, 238(1):115-144, 2001.
7. B. Bank, M. Giusti, J. Heintz, and L.-M. Pardo. A first approach to generalized polar varieties. To appear in Wybernetica, 2004.
8. B. Bank, M. Giusti, J. Heintz, and L.-M. Pardo. Generalized polar varieties: geometry and algorithms. Preprint, 2003.
9. S. Basu. Algorithms in Semi-Algebraic Geometry. Ph.D. thesis, New York University, 1996.
10. S. Basu, R. Pollack, and M.-F. Roy. On the combinatorial and algebraic complexity of quantifier elimination. Journal of ACM, 43(6): 1002-1045, 1996.
11. S. Basu, R. Pollack, and M.-F. Roy. A new algorithm to find a point in every cell defined by a family of polynomials. In B. Caviness and J. Johnson, editors, Quantifier Elimination and Cylindrical Algebraic Decomposition. Texts and Monographs in Symbolic Computation. Springer-Verlag, New York, 1998.
12. D. Bini and B. Mourrain. The FRISCO test-suite, http://www-sop.inria.fr/ saga/POL/, 2000.
13. B. Buchberger. Gröbner bases: an algorithmic method in polynomial ideal theory. In N. W. Bose and D. Reider, editors, Multidimensional System Theory, pages 374-383. Reidel, Dordrecht, 1985.
14. G. E. Collins. Quantifier elimination for real closed fields by cylindrical algebraic decomposition. Automata Theory and Formal Languages, pages 515-532. Volume 33 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1975.
15. I. Z. Emiris and B. Mourrain. Matrices in elimination theory. Journal of Symbolic Computation, 28(1-2):3-43, 1999.
16. 4). Journal of Pure and Applied Algebra, 139(1-3):61-88, 1999.
17. J.-C. Faugère. A new efficient algorithm for computing Gröbner bases without reduction to zero (F5). In ISSAC 2002, pages 75-83. ACM Press, New York, 2002.
18. J.C. Faugère. Gb. http://fgbrs.lip6.fr/Gb/index.html, 2003.
19. J.C. Faugère, P. Gianni, D. Lazard, and T. Mora. Efficient computation of zero-dimensional Gröbner bases by change of ordering. Journal of Symbolic Computation, 16(4):329-344, 1993.
20. J.-C. Faugère, F. Moreau de Saint Martin, and F. Rouillier. Design of regular nonseparable bidimensional wavelets using groebner basis techniques. IEEE SP Transactions, Special Issue on Theory and Applications of Filter Banks and Wavelets, 46(4):845-856, April 1998.
21. M. Giusti, K. Hägele, J. Heintz, J.-E Morais, J.-L. Montaña, and L.-M. Pardo. Lower bounds for Diophantine approximation. In Proceedings of MEGA '96, in Journal of Pure and Applied Algebra, 117-118: 277-317, 1997.
22. M. Giusti, J. Heintz, J.-E. Morais, J. Morgenstern, and L.-M. Pardo. Straight-line programs in geometric elimination theory. Journal of Pure and Applied Algebra, 124:101-146, 1998.
23. M. Giusti, J. Heintz, J.-E. Morais, and L.-M. Pardo. When polynomial equation systems can be solved fast? In Proceedings of AAECC-11, pages 205-231. Volume 948 of Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1995.
24. M. Giusti, G. Lecerf, and B. Salvy. A Gröbner free alternative for polynomial system solving. Journal of Complexity, 17(1):154-211, 2001.
25. D. Grigoriev and N. Vorobjov. Solving systems of polynomials inequalities in subexponential time. Journal of Symbolic Computation, 5:37-64, 1988.
26. J. Heintz, M.-F. Roy, and P. Solerno. On the complexity of semi-algebraic sets. In Proceedings IFIP, pages 233-298, 1989.
27. J. Heintz, M.-F. Roy, and P. Solerno. On the theoretical and practical complexity of the existential theory of the reals. The Computer Journal, 36(5):427-431, 1993.
28. H. Hong et al. QEPCAD, Quantifier Elimination by Partial Cylindrical Algebraic Decomposition. http://www.cs.usna.edu/~qepcad/B/QEPCAD.html, 2003.
29. E. Hubert. Notes on triangular sets and triangulation-decomposition algorithms, I: Polynomial systems. In U. Lager and F. Winkler, editors, Symbolic and Numerical Scientific Computations, pages 1-39. Springer-Verlag, New York, 2003.
30. Z. Jelonek. Testing sets for properness of polynomial mappings. Mathematische Annalen, 315(1):1-35, 1999.
31. M. Kalkbrener. Three Contributions to Elimination Theory. Ph.D. thesis, Kepler University, Linz, 1991.
32. D. Lazard. A new method for solving algebraic systems of positive dimension. Discrete Applied Mathematics, 33:147-160, 1991.
33. D. Lazard. Solving zero-dimensional algebraic systems. Journal of Symbolic Computation, 13:117-133, 1992.
34. D. Lazard. Stewart platform and Gröbner bases. In V. Parenti-Castelli and J. Lenaric, editors, Proceedings of the Third International Workshop on Advances of Robot Kinematics, pages 136-142. Ferrare, 1992.
35. G. Lecerf. Kronecker. http://fermat.math.uvsq.fr/~lecerf/software/ kronecker/, 2003.
36. C. Le Guernic and M. Safey El Din. On the practical computation of one point in each connected component of a semi-algebraic set defined by a polynomial system of equations and non-strict inequalities. Research Report 5079, INRIA, 2004.
37. F. Lemaire. Contribution à l'algorithmique en algèbre différentielle. Ph.D. thesis, Université des Sciences et Technologies de Lille, 2002.
38. M. Moreno Maza. 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, 1997.
39. M. Moreno Maza and R. Rioboo. Polynomial gcd computations over tower of algebraic extensions. In G. Cohen, M. Giusti, and T. Mora, editors, Proceedings AAECC-11, pages 365-382. Number 948 in Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1995.
40. ∞. Journal of Symbolic Computation, 28:631-656, 1999.
41. R. Rioboo. Towards faster real algebraic numbers. In ISSAC 2002, pages 221-228. ACM Press, New York, 2002.
42. F. Rouillier. Solving zero-dimensional systems through the rational univariate representation. Journal of Applicable Algebra in Engineering, Communication and Computing, 9(5):433-461, 1999.
43. F. Rouillier. RS. http://fgbrs.lip6.fr/RS/index.html, 2003.
44. F. Rouillier, M.-F. Roy, and M. Safey El Din. Finding at least one point in each connected component of a real algebraic set defined by a single equation. Journal of Complexity, 16:716-750, 2000.
45. F. Rouillier, M. Safey El Din, and É. Schost. Solving the Birkhoff interpolation problem via the critical point method: an experimental study. In Proceedings of ADG 2000, pages 26-40, 2000.
46. F. Rouillier and P. Zimmermann. Efficient isolation of polynomial real roots. Journal of Computational and Applied Mathematics, 162(1):33-50, 2003.
47. M.-F. Roy. Basic algorithms in real algebraic geometry: from Sturm's theorem to the existential theory of reals. In Lectures on Real Geometry in Memoriam of Mario Raimondo, pages 1-67. Volume 23 of Expositions in Mathematics, de Gruyter, New York, 1996.
48. M. Safey El Din. Résolution réelle des systèmes polynomiaux de dimension positive. Ph.D. thesis, Université Paris 6, January 2001.
49. M. Safey El Din. RAGLib. http://www-calfor.lip6.fr/~safey/RAGLib, 2003.
50. M. Safey El Din and É. Schost. Polar varieties and computation of one point in each connected component of a smooth real algebraic set. In ISSAC 2004, pages 224-231. ACM Press, New York, 2003.
51. É. Schost. Computing parametric geometric resolutions. Journal of Applicable Algebra in Engineering Communication and Computing, 13(4):349-393, 2003.
52. I. R. Shafarevich. Basic Algebraic Geometry, 1, second edition. Springer-Verlag, Berlin, second edition, 1994.
53. J. Uspensky. Theory of Equations. McGraw-Hill, New York, 1948.
54. J. Verscheide. Algorithm 795: Phcpack: a general-purpose solver for polynomial systems by homotopy continuation. ACM Transactions on Mathematical Software, 25(2):251-276, 1999.
55. D. Wang. An elimination method for polynomial systems. Journal of Symbolic Computation, 16:83-114, 1993.
56. D. Wang. Elimination Methods. Springer-Verlag, New York 2001.