Real Solving for Positive Dimensional Systems - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2000

Real Solving for Positive Dimensional Systems

Philippe Aubry
  • Function : Author
  • PersonId : 833585
Mohab Safey El Din
  • Function : Author


Finding one point on each semi-algebraically connected component of a real algebraic variety, or at least deciding if such a variety is empty or not, is a fundamental problem of computational real algebraic geometry. Even though numerous studies have been done on the subject, only a few number of efficient implementations exists. In this paper, we propose a new efficient and practical algorithm for computing such points. By studying the critical points of the restriction to the variety of the distance function to one well chosen point, we show how to provide a set of zero-dimensional systems whose zeroes contain at least one point on each semi-algebraically connected component of the studied variety, without any assumption neither on the variety (smoothness or compactness for example) nor on the system of equations that define it. Once such a result is computed, one can then apply, for each computed zero-dimensional system, any symbolic or numerical algorithm for counting or approximating the solutions. We have made experiments using a set of pure exact methods. The practical efficiency of our method is due to the fact that we do not apply any infinitesimal deformations, conversely to the existing methods based on similar strategy.
Fichier principal
Vignette du fichier
RR-3992.pdf (352.79 Ko) Télécharger le fichier

Dates and versions

inria-00072654 , version 1 (24-05-2006)


  • HAL Id : inria-00072654 , version 1


Philippe Aubry, Fabrice Rouillier, Mohab Safey El Din. Real Solving for Positive Dimensional Systems. [Research Report] RR-3992, INRIA. 2000, pp.20. ⟨inria-00072654⟩
222 View
293 Download


Gmail Facebook Twitter LinkedIn More