Gröbner bases and primary decomposition of polynomial ideals
Journal of Symbolic Computation
On the theories of triangular sets
Journal of Symbolic Computation - Special issue on polynomial elimination—algorithms and applications
Bounds on numers of vectors of multiplicities for polynomials which are easy to compute
ISSAC '00 Proceedings of the 2000 international symposium on Symbolic and algebraic computation
ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
Injectivity of real rational mappings: the case of a mixture of two Gaussian laws
Mathematics and Computers in Simulation - Special issue: Applications of computer algebra in science, engineering, simulation and special software
Complexity of the resolution of parametric systems of polynomial equations and inequations
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Complexity of the resolution of parametric systems of polynomial equations and inequations
Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Computing the global optimum of a multivariate polynomial over the reals
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
Symbolic optimization of algebraic functions
Proceedings of the twenty-first international symposium on Symbolic and algebraic computation
Algebraic Analysis of Bifurcation and Limit Cycles for Biological Systems
AB '08 Proceedings of the 3rd international conference on Algebraic Biology
Thirty years of Polynomial System Solving, and now?
Journal of Symbolic Computation
Dynamic balancing of planar mechanisms using toric geometry
Journal of Symbolic Computation
On delineability of varieties in CAD-based quantifier elimination with two equational constraints
Proceedings of the 2009 international symposium on Symbolic and algebraic computation
A parametric representation of totally mixed Nash equilibria
Computers & Mathematics with Applications
Sweeping algebraic curves for singular solutions
Journal of Computational and Applied Mathematics
Cylinders through five points: complex and real enumerative geometry
ADG'06 Proceedings of the 6th international conference on Automated deduction in geometry
A package for solving parametric polynomial systems
ACM Communications in Computer Algebra
Computing with semi-algebraic sets represented by triangular decomposition
Proceedings of the 36th international symposium on Symbolic and algebraic computation
Solving parametric piecewise polynomial systems
Journal of Computational and Applied Mathematics
The midpoint locus of a triangle in a corner
ADG'10 Proceedings of the 8th international conference on Automated Deduction in Geometry
Computing with semi-algebraic sets: Relaxation techniques and effective boundaries
Journal of Symbolic Computation
Automatic deduction in (dynamic) geometry: Loci computation
Computational Geometry: Theory and Applications
Hi-index | 0.00 |
We present a new algorithm for solving basic parametric constructible or semi-algebraic systems of the form C={x@?C^n,p"1(x)=0,...,p"s(x)=0,f"1(x)0,...,f"l(x)0} or S={x@?R^n,p"1(x)=0,...,p"s(x)=0,f"1(x)0,...,f"l(x)0}, where p"i,f"i@?Q[U,X], U=[U"1,...,U"d] is the set of parameters and X=[X"d"+"1,...,X"n] the set of unknowns. If @P"U denotes the canonical projection onto the parameter's space, solving C or S is reduced to the computation of submanifolds U@?C^d or U@?R^d such that (@P"U^-^1(U)@?C,@P"U) is an analytic covering of U (we say that U has the (@P"U,C)-covering property). This guarantees that the cardinality of @P"U^-^1(u)@?C is constant on a neighborhood of u, that @P"U^-^1(U)@?C is a finite collection of sheets and that @P"U is a local diffeomorphism from each of these sheets onto U. We show that the complement in @P"U(C)@? (the closure of @P"U(C) for the usual topology of C^n) of the union of all the open subsets of @P"U(C)@? which have the (@P"U,C)-covering property is a Zariski closed set which is called the minimal discriminant variety ofCw.r.t.@P"U, denoted as W"D. We propose an algorithm to compute W"D efficiently. The variety W"D can then be used to solve the parametric system C (resp. S) as long as one can describe @P"U(C)@?@?W"D (resp. R^d@?(@P"U(C)@?@?W"D)). This can be done by using the critical points method or an ''open'' cylindrical algebraic decomposition.