Solving systems of polynomial inequalities in subexponential time
Journal of Symbolic Computation
A toolkit for non-linear algebra
WAFR Proceedings of the workshop on Algorithmic foundations of robotics
On the combinatorial and algebraic complexity of quantifier elimination
Journal of the ACM (JACM)
On the theories of triangular sets
Journal of Symbolic Computation - Special issue on polynomial elimination—algorithms and applications
Design of regular nonseparable bidimensional wavelets using Grobnerbasis techniques
IEEE Transactions on Signal Processing
ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
Algorithms to compute the topology of orientable real algebraic surfaces
Journal of Symbolic Computation - Special issue: International symposium on symbolic and algebraic computation (ISSAC 2002)
Stability analysis of biological systems with real solution classification
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Generalized polar varieties: geometry and algorithms
Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage
Rational Univariate Reduction via toric resultants
Journal of Symbolic Computation
Computing the global optimum of a multivariate polynomial over the reals
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
Generalized polar varieties: geometry and algorithms
Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage
Notes on triangular sets and triangulation-decomposition algorithms I: polynomial systems
SNSC'01 Proceedings of the 2nd international conference on Symbolic and numerical scientific computation
Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
Tackling Multiplicity of Equilibria with Gröbner Bases
Operations Research
Deciding reachability of the infimum of a multivariate polynomial
Proceedings of the 36th international symposium on Symbolic and algebraic computation
Journal of Symbolic Computation
An algorithm for computing the complete root classification of a parametric polynomial
AISC'06 Proceedings of the 8th international conference on Artificial Intelligence and Symbolic Computation
Critical points and Gröbner bases: the unmixed case
Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation
Computing real solutions of polynomial systems via low-rank moment matrix completion
Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation
Verified error bounds for real solutions of positive-dimensional polynomial systems
Proceedings of the 38th international symposium on International symposium on symbolic and algebraic computation
Numerically Computing Real Points on Algebraic Sets
Acta Applicandae Mathematicae: an international survey journal on applying mathematics and mathematical applications
Hi-index | 0.00 |
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. Although numerous studies have been done on the subject, only a small number of efficient implementations exist.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 zeros contain at least one point on each semi-algebraically connected component of the studied variety, without any assumption either on the variety (smoothness or compactness for example) or on the system of equations which define it.From the output of our algorithm, one can then apply, for each computed zero-dimensional system, any symbolic or numerical algorithm for counting or approximating the real solutions. We report some 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, unlike the existing methods based on a similar strategy.