polynomsystem
Polynomsystem refers to a collection of polynomial equations in one or more variables. Formally, a polynomsystem over a field F consists of polynomials p1(x1,...,xn)=0, ..., pm(x1,...,xn)=0 and the problem is to find common solutions (a1,...,an) in an algebraic extension of F that satisfy all equations.
The set of solutions is the affine variety V(I) corresponding to the ideal I generated by the
There are linear and nonlinear cases. Linear polynomsystems are solvable by standard linear algebra. In general,
Solving methods: symbolic approaches such as Gröbner bases (Buchberger’s algorithm) enable elimination of variables and decision
Complexity and theory: the general problem of solving polynomial systems is computationally hard; Gröbner basis computation
Applications: robotics and kinematics, computer-aided design and vision, cryptography and error-correcting codes, chemistry and physics, and