Polar varieties and efficient real elimination

DOI10.1007/S002090100248zbMath1073.14554arXivmath/0005041MaRDI QIDQ5949445

Marc Giusti, Bernd Bank, Joos Heintz, G. M. Mbakop

Publication date: 2001

Published in: Mathematische Zeitschrift (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0005041

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Real algebraic sets (14P05) Computational aspects in algebraic geometry (14Q99)

Related Items (31)

Sum of Squares Decompositions of Polynomials over their Gradient Ideals with Rational Coefficients ⋮ Generalized polar varieties: geometry and algorithms ⋮ Local polar varieties in the geometric study of singularities ⋮ Real root finding for low rank linear matrices ⋮ VerifyRealRoots: a Matlab package for computing verified real solutions of polynomials systems of equations and inequalities ⋮ Faster real root decision algorithm for symmetric polynomials ⋮ Bit complexity for multi-homogeneous polynomial system solving -- application to polynomial minimization ⋮ Real root finding for determinants of linear matrices ⋮ A concise proof of the Kronecker polynomial system solver from scratch ⋮ A baby steps/giant steps probabilistic algorithm for computing roadmaps in smooth bounded real hypersurface ⋮ Algorithms of intrinsic complexity for point searching in compact real singular hypersurfaces ⋮ Numerically computing real points on algebraic sets ⋮ Polar varieties, Bertini's theorems and number of points of singular complete intersections over a finite field ⋮ Solving determinantal systems using homotopy techniques ⋮ A certificate for semidefinite relaxations in computing positive-dimensional real radical ideals ⋮ Intrinsic complexity estimates in polynomial optimization ⋮ Certified non-conservative tests for the structural stability of discrete multidimensional systems ⋮ On sign conditions over real multivariate polynomials ⋮ On the geometry of polar varieties ⋮ On the intrinsic complexity of point finding in real singular hypersurfaces ⋮ On exact Reznick, Hilbert-Artin and Putinar's representations ⋮ The Bottleneck Degree of Algebraic Varieties ⋮ Polar Varieties Revisited ⋮ Unnamed Item ⋮ Exact Algorithms for Linear Matrix Inequalities ⋮ Fast computation of a rational point of a variety over a finite field ⋮ Degeneracy loci and polynomial equation solving ⋮ Bit complexity for computing one point in each connected component of a smooth real algebraic set ⋮ Point searching in real singularcomplete intersection varieties: algorithms of intrinsic complexity ⋮ Real solving for positive dimensional systems. ⋮ Systems of rational polynomial equations have polynomial size approximate zeros on the average

This page was built for publication: Polar varieties and efficient real elimination