Real solving for positive dimensional systems.

DOI10.1006/JSCO.2002.0563zbMath1046.14031OpenAlexW2007391649MaRDI QIDQ1867000

Fabrice Rouillier, Philippe Aubry, Mohab Safey El Din

Publication date: 2 April 2003

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/inria-00072654/file/RR-3992.pdf

zbMATH Keywords

real algebraic varietyefficient algorithmsemi-algebraically connected component

Mathematics Subject Classification ID

Real algebraic sets (14P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Semialgebraic sets and related spaces (14P10) Computational aspects in algebraic geometry (14Q99)

Related Items (27)

Algorithms to compute the topology of orientable real algebraic surfaces ⋮ Generalized polar varieties: geometry and algorithms ⋮ Tensor decomposition and homotopy continuation ⋮ A Direttissimo Algorithm for Equidimensional Decomposition ⋮ VerifyRealRoots: a Matlab package for computing verified real solutions of polynomials systems of equations and inequalities ⋮ Beyond linear algebra ⋮ Algorithms of intrinsic complexity for point searching in compact real singular hypersurfaces ⋮ Symbolic Methods for Solving Algebraic Systems of Equations and Applications for Testing the Structural Stability ⋮ Numerically computing real points on algebraic sets ⋮ Exact certification in global polynomial optimization via sums-of-squares of rational functions with rational coefficients ⋮ Global optimization of polynomials over real algebraic sets ⋮ Solving determinantal systems using homotopy techniques ⋮ Unification and extension of intersection algorithms in numerical algebraic geometry ⋮ A certificate for semidefinite relaxations in computing positive-dimensional real radical ideals ⋮ Homotopy techniques for solving sparse column support determinantal polynomial systems ⋮ 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 types of degenerate critical points of real polynomial functions ⋮ Rational univariate reduction via toric resultants ⋮ Computing Amoebas ⋮ Unnamed Item ⋮ Parts of quantum states ⋮ Euclidean distance degree and mixed volume ⋮ Smooth points on semi-algebraic sets ⋮ Computing critical points for invariant algebraic systems ⋮ Epsilon local rigidity and numerical algebraic geometry

Uses Software

• ISOLATE

Cites Work

• Solving systems of polynomial inequalities in subexponential time
• On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination
• Solving zero-dimensional systems through the rational univariate representation
• On the theories of triangular sets
• A new decision method for elementary algebra
• On the Theoretical and Practical Complexity of the Existential Theory of Reals
• On the combinatorial and algebraic complexity of quantifier elimination
• Finding at least one point in each connected component of a real algebraic set defined by a single equation
• Polar varieties and efficient real elimination
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Real solving for positive dimensional systems.