Computing real radicals and \(S\)-radicals of polynomial systems

DOI10.1016/j.jsc.2019.10.018zbMath1448.14061OpenAlexW2985176282MaRDI QIDQ2200311

Lihong Zhi, Mohab Safey El Din, Zhi-Hong Yang

Publication date: 19 September 2020

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

Full work available at URL: https://doi.org/10.1016/j.jsc.2019.10.018

zbMATH Keywords

semi-algebraic setpolynomial systemreal algebraic geometryreal radical\(S\)-radical ideal

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Semialgebraic sets and related spaces (14P10) Computational real algebraic geometry (14Q30)

Related Items (2)

A Direttissimo Algorithm for Equidimensional Decomposition ⋮ Generators for the \(C^m\)-closures of ideals

Uses Software

• Kronecker
• RAGlib

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Real ideal and the duality of semidefinite programming for polynomial optimization
• A certificate for semidefinite relaxations in computing positive-dimensional real radical ideals
• Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers
• Properness defects and projections and computation of at least one point in each connected component of a real algebraic set
• Computing with polynomials given by black boxes for their evaluations: greatest common divisors, factorization, separation of numerators and denominators
• A zero-dimensional approach to compute real radicals
• The Voronoi diagram of three lines
• Semidefinite characterization and computation of zero-dimensional real radical ideals
• Gröbner bases and primary decomposition of polynomial ideals
• A new method for solving algebraic systems of positive dimension
• Decomposing polynomial systems into simple systems
• Complexity of finding irreducible components of a semialgebraic set
• Radicals of binomial ideals
• Computation of real radicals of polynomial ideals. II
• Computing parametric geometric resolutions
• The computational complexity of the Chow form
• On the complexity of computing with zero-dimensional triangular sets
• Moment matrices, border bases and real radical computation
• Anneaux preordonnes
• A concise proof of the Kronecker polynomial system solver from scratch
• Testing sign conditions on a multivariate polynomial and applications
• A nullstellensatz for ordered fields
• A Nullstellensatz and a Positivstellensatz in semialgebraic geometry
• Computing generators of the ideal of a smooth affine algebraic variety
• Validating the Completeness of the Real Solution Set of a System of Polynomial Equations
• A Nearly Optimal Algorithm for Deciding Connectivity Queries in Smooth and Bounded Real Algebraic Sets
• Computing an equidimensional decomposition of an algebraic variety by means of geometric resolutions
• Computing with semi-algebraic sets represented by triangular decomposition
• Exact certification of global optimality of approximate factorizations via rationalizing sums-of-squares with floating point scalars
• Triangular decomposition of semi-algebraic systems
• Triangular decomposition of semi-algebraic systems
• A Gröbner free alternative for polynomial system solving

This page was built for publication: Computing real radicals and \(S\)-radicals of polynomial systems