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-5zbMATH Open1067.14057OpenAlexW2018701055MaRDI QIDQ705131FDOQ705131
É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
Recommendations
- scientific article; zbMATH DE number 1984327
- Real solving for positive dimensional systems.
- CAD and topology of semi-algebraic sets
- Computing cylindrical algebraic decomposition via triangular decomposition
- Complexity of deciding connectivity in real algebraic sets
- scientific article
- Cylindrical algebraic decomposition in the RegularChains library
- Choosing a variable ordering for truth-table invariant cylindrical algebraic decomposition by incremental triangular decomposition
- Cylindrical algebraic decomposition using local projections
- Cylindrical algebraic sub-decompositions
Cited In (24)
- Symbolic computation in hyperbolic programming
- A concise proof of the Kronecker polynomial system solver from scratch
- Title not available (Why is that?)
- A hybrid procedure for finding real points on a real algebraic set
- Global optimization of polynomials over real algebraic sets
- Algorithms of intrinsic complexity for point searching in compact real singular hypersurfaces
- A probabilistic algorithm for computing data-discriminants of likelihood equations
- Properness defects of projection and minimal discriminant variety
- A Direttissimo Algorithm for Equidimensional Decomposition
- On the intrinsic complexity of point finding in real singular hypersurfaces
- On the geometry of polar varieties
- Practical and Theoretical Issues for the Computation of Generalized Critical Values of a Polynomial Mapping
- Rational univariate reduction via toric resultants
- Solving parametric piecewise polynomial systems
- Finding at least one point in each connected component of a real algebraic set defined by a single equation
- The Voronoi diagram of three lines
- Real solving for positive dimensional systems.
- Computing real radicals and \(S\)-radicals of polynomial systems
- Sweeping algebraic curves for singular solutions
- Exact algorithms for linear matrix inequalities
- Computing real witness points of positive dimensional polynomial systems
- Solving parametric polynomial systems
- Quadric Arrangement in Classifying Rigid Motions of a 3D Digital Image
- Early Ending in Homotopy Path-Tracking for Real Roots
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
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q705131)
