Properness defects and projections and computation of at least one point in each connected component of a real algebraic set
From MaRDI portal
Publication:705131
DOI10.1007/s00454-004-1107-5zbMath1067.14057OpenAlexW2018701055MaRDI QIDQ705131
Éric Schost, Mohab Safey El Din
Publication date: 25 January 2005
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-004-1107-5
Related Items (21)
A probabilistic algorithm for computing data-discriminants of likelihood equations ⋮ Symbolic computation in hyperbolic programming ⋮ A Direttissimo Algorithm for Equidimensional Decomposition ⋮ Early Ending in Homotopy Path-Tracking for Real Roots ⋮ A concise proof of the Kronecker polynomial system solver from scratch ⋮ Computing real radicals and \(S\)-radicals of polynomial systems ⋮ Algorithms of intrinsic complexity for point searching in compact real singular hypersurfaces ⋮ Solving parametric piecewise polynomial systems ⋮ Global optimization of polynomials over real algebraic sets ⋮ A hybrid procedure for finding real points on a real algebraic set ⋮ Solving parametric polynomial systems ⋮ Sweeping algebraic curves for singular solutions ⋮ On the geometry of polar varieties ⋮ Practical and Theoretical Issues for the Computation of Generalized Critical Values of a Polynomial Mapping ⋮ Properness defects of projection and minimal discriminant variety ⋮ On the intrinsic complexity of point finding in real singular hypersurfaces ⋮ Rational univariate reduction via toric resultants ⋮ The Voronoi diagram of three lines ⋮ Quadric Arrangement in Classifying Rigid Motions of a 3D Digital Image ⋮ Exact Algorithms for Linear Matrix Inequalities ⋮ Computing real witness points of positive dimensional polynomial systems
Uses Software
This page was built for publication: Properness defects and projections and computation of at least one point in each connected component of a real algebraic set
