On solving parametric polynomial systems
From MaRDI portal
Publication:1949089
DOI10.1007/s11786-012-0136-3zbMath1274.13047OpenAlexW1977906522MaRDI QIDQ1949089
Bican Xia, Marc Moreno Maza, Rong Xiao
Publication date: 25 April 2013
Published in: Mathematics in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11786-012-0136-3
Symbolic computation and algebraic computation (68W30) Solving polynomial systems; resultants (13P15)
Related Items (3)
Automatic deduction in (dynamic) geometry: Loci computation ⋮ On solving parametric polynomial systems ⋮ On the extended Hensel construction and its application to the computation of real limit points
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algorithms for computing triangular decomposition of polynomial systems
- Minimal canonical comprehensive Gröbner systems
- A new method for solving algebraic systems of positive dimension
- Partial cylindrical algebraic decomposition for quantifier elimination
- Comprehensive Gröbner bases
- A generalized Euclidean algorithm for computing triangular representations of algebraic varieties
- Testing sets for properness of polynomial mappings
- Computing parametric geometric resolutions
- A new algorithm for discussing Gröbner bases with parameters.
- An effective description of the Jelonek set
- On the theories of triangular sets
- On solving parametric polynomial systems
- Solving parametric polynomial systems
- Comprehensive Triangular Decomposition
- Computing with semi-algebraic sets represented by triangular decomposition
- Triangular decomposition of semi-algebraic systems
- Algorithms in real algebraic geometry
This page was built for publication: On solving parametric polynomial systems
