Testing sign conditions on a multivariate polynomial and applications

Mathematics in Computer Science

Volumn 1, Issue 1, 2007, Pages 177-207

  Safey El Din, Mohab ^a  

^a SORBONNE UNIVERSITÉ   (France)

Author keywords

Complexity; Inequalities; Optimization; Polynomial systems; Real solutions

Indexed keywords

EID: 49449109671     PISSN: 16618270     EISSN: 16618289     Source Type: Journal    
DOI: 10.1007/s11786-007-0003-9     Document Type: Article

References (49)

1. P. Aubry, F. Rouillier, and M. Safey El Din. Real solving for positive dimensional systems. Journal of Symbolic Computation, 34(6):543-560, 2002.
2. 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.
3. B. Bank, M. Giusti, J. Heintz, and L.-M. Pardo. Generalized polar varieties and efficient real elimination procedure. Kybernetika, 40(5):519-550, 2004.
4. B. Bank, M. Giusti, J. Heintz, and L.-M. Pardo. Generalized polar varieties: Geometry and algorithms. Journal of Complexity, 2005.
5. 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.
6. 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: Quantifier elimination and cylindrical algebraic decomposition. Springer-Verlag, 1998.
7. S. Basu, R. Pollack, and M.-F. Roy. Algorithms in real algebraic geometry. Springer-Verlag, 2003.
8. E. Becker and R. Neuhaus. Computation of real radicals for polynomial ideals. Computational Algebraic Geometry, vol. 109 of Progress in Mathematics, pp. 1-20, Birkhäuser, 1993.
9. R. Benedetti and J.-J. Risler. Real algebraic and semi-algebraic sets. Actualités Mathématiques, Hermann, 1990.
10. J.-B. Bost, H. Gillet, and C. Soulet. Heights of projective varieties and positive Green forms, J. Amer. Math. Soc., 7(4):903-1027, 1994.
11. G. E. Collins. Quantifier elimination for real closed fields by cylindrical algebraic decomposition. Lecture notes in computer science, 33:515-532, 1975.
12. S. Corvez and F. Rouillier. Using computer algebra tools to classify serial manipulators, Proceedings of Automated Deduction in Geometry, F. Winkler (eds), Lecture Notes in Artificial Intelligence, 2930:31-43, 2003.
13. D. Cox, J. Little, and D. O'Shea. Ideals, varieties and algorithms: An introduction to computational algebraic geometry and commutative algebra. Springer-Verlag, 1992.
14. 3. Proceedings of Symposium on Computational Geometry, ACM Press, South-Korea, 2007.
15. J.-C. Faugère. Gb/FGb. Available at http://fgbrs.lip6.fr.
16. J.-C. Faugère. A new efficient algorithm for computing Gröbner bases (F4). 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 without reduction to zero (F5). In: Proceedings of ISSAC 2002, pp. 75-83. ACM Press, 2002.
18. W. Fulton. Intersection Theory. Ergebnisse der Mathematik und ihrer Grenzgebiete, 2. Springer-Verlag, 1984.
19. 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, number 117, 118 in Journal of Pure and Applied Algebra, pages 277-317, 1997.
20. 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.
21. M. Giusti, J. Heintz, J.-E. Morais, and L.-M. Pardo. When polynomial equation systems can be solved fast? In: Proceedings of AAECC-11, volume 948 of LNCS, pages 205-231. Springer, 1995.
22. M. Giusti, G. Lecerf, and B. Salvy. A Gröbner free alternative for polynomial system solving. Journal of Complexity, 17(1):154-211, 2001.
23. D. Grigoriev and N. Vorobjov. Solving systems of polynomials inequalities in subexponential time. Journal of Symbolic Computation, 5:37-64, 1988.
24. J. Heintz, M.-F. Roy, and P. Solernò. On the complexity of semi-algebraic sets. In Proceedings IFIP'89 San Francisco, North-Holland, 1989.
25. J. Heintz, M.-F. Roy, and P. Solernò. On the theoretical and practical complexity of the existential theory of the reals. The Computer Journal, 36(5):427-431, 1993.
26. Z. Jelonek. Testing sets for properness of polynomial mappings. Mathematische Annalen, 315(1):1-35, 1999.
27. Z. Jelonek. Topological characterization of finite mappings. Bull. Polish Acad. Sci. Math., 49(3):279-283, 2001.
28. Z. Jelonek and K. Kurdyka. On asymptotic critical values of a complex polynomial. Journal für die Reine und Angewandte Mathematik, 565:1-11, 2003.
29. D. Lazard. Quantifier elimination: optimal solution for two classical examples. Journal of Symbolic Computation, 5(1-2):261-266, 1988.
30. D. Lazard and F. Rouillier. Solving parametric polynomial systems. Journal of Symbolic Computation, 42:636-667, 2007.
31. G. Lecerf. Kronecker magma package for solving polynomial systems. Available at http://www.math.uvsq.fr/~lecerf/software/.
32. Y. N. Lakshman. A single exponential bound of the complexity of computing Gröbner bases of zero-dimensional ideals. In: C. Traverso, T. Mora, editor, Proc. Effective Methods in Algebraic Geometry, MEGA, vol. 94 of Progress in Mathematics, pp. 227-234. Birkhäuser, 1991.
33. A. Lax and P. Lax, On sums of squares, Linear Algebra App., 20:71-75, 1978.
34. G. Lecerf. Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers. Journal of Complexity, 19(4):564-596, 2003.
35. K. Kurdyka, P. Orro, and S. Simon, Semi-algebraic Sard's theorem for generalized critical values. Journal of Differentiable Geometry, 56:67-92, 2000.
36. J. Renegar. On the computational complexity and geometry of the first-order theory of the reals. Journal of Symbolic Computation, 13(3):255-352, 1992.
37. F. Rouillier. RS, RealSolving. available at http://fgbrs.lip6.fr.
38. F. Rouillier. Solving zero-dimensional systems through the Rational Univariate Representation. AAECC Journal, 9(5):433-461, 1999.
39. 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.
40. F. Rouillier, M. Safey El Din, and E. Schost. Solving the Birkhoff Interpolation Problem via the Critical Point Method: An Experimental Study, Lecture Notes in Computer Science, Automated deduction in geometry, ADG'2000, Zurich, Switzerland, September 25-27, revised papers, Editors: J. Richter-Gebert, D. Wang, Springer-Verlag, Heidelberg, 2000.
41. F. Rouillier and P. Zimmermann. Efficient isolation of polynomial real roots. Journal of Computational and Applied Mathematics, 162(1):33-50, 2003.
42. M. Safey El Din. RAGLib (Real Algebraic Geometry Library). Available at http://www-spiral.lip6.fr/~safey/RAGLib, June, 2007.
43. M. Safey El Din and É. Schost. Polar varieties and computation of one point in each connected component of a smooth real algebraic set. In: Proceedings of the 2003 international symposium on Symbolic and algebraic computation, pages 224-231. ACM Press, 2003.
44. M. Safey El Din and É. Schost. Properness defects of projections and computation of one point in each connected component of a real algebraic set. Journal of Discrete and Computational Geometry, 32(3):417-430, 2004.
45. M. Safey El Din. Finding sampling points on real hypersurfaces is easier in singular situations. Electronic proceedings of MEGA, 2005.
46. M. Safey El Din. Generalized critical values and solving polynomial inequalities. Proceedings of International Conference on Polynomial Systems (2004).
47. E. Schost. Computing Parametric Geometric Resolutions. Journal of Applicable Algebra in Engineering, Communication and Computing, 13(5):349-393, 2003.
48. M. Schweighofer. Global optimization of polynomials using gradient tentacles and sums of squares, SIAM Journal on Optimization, 17(3):920-942, 2006.
49. I. Shafarevich, Basic Algebraic Geometry I, Springer-Verlag, (1977).