Solving systems of polynomial inequalities in subexponential time
Journal of Symbolic Computation
Journal of Symbolic Computation
Some algebraic and geometric computations in PSPACE
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Efficient incremental algorithms for the sparse resultant and the mixed volume
Journal of Symbolic Computation
On the combinatorial and algebraic complexity of quantifier elimination
Journal of the ACM (JACM)
A computational method for diophantine approximation
Algorithms in algebraic geometry and applications
Polar varieties, real equation solving, and data structures: the hypersurface case
Journal of Complexity
ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation
Complexity estimates depending on condition and round-off error
Journal of the ACM (JACM)
A Gröbner free alternative for polynomial system solving
Journal of Complexity
Kronecker's and Newton's approaches to solving: a first comparison
Journal of Complexity
Real solving for positive dimensional systems
Journal of Symbolic Computation
Testing polynomials which are easy to compute (Extended Abstract)
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
Computing the global optimum of a multivariate polynomial over the reals
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
A numerical algorithm for zero counting, I: Complexity and accuracy
Journal of Complexity
On the intrinsic complexity of point finding in real singular hypersurfaces
Information Processing Letters
Hi-index | 0.00 |
Let V be a closed algebraic subvariety of the n-dimensional projective space over the complex or real numbers and suppose that V is non-empty and equidimensional. The classic notion of a polar variety of V associated with a given linear subvariety of the ambient space of V was generalized and motivated in Bank et al. (Kybernetika 40 (2004), to appear). As particular instances of this notion of a generalized polar variety one reobtains the classic one and an alternative type of a polar variety, called dual. As main result of the present paper we show that for a generic choice of their parameters the generalized polar varieties of V are empty or equidimensional and smooth in any regular point of V. In the case that the variety V is affine and smooth and has a complete intersection ideal of definition, we are able, for a generic parameter choice, to describe locally the generalized polar varieties of V by explicit equations. Finally, we indicate how this description may be used in order to design in the context of algorithmic elimination theory a highly efficient, probabilistic elimination procedure for the following task: In case, that the variety V is Q-definable and affine, having a complete intersection ideal of definition, and that the real trace of V is non-empty and smooth, find for each connected component of the real trace of V an algebraic sample point.