factoring Buchberger algorithm
Solve(G, X, NZ, opts)
a list or set of polynomials or a PolynomialIdeal
(optional) a list or set of variables or a ShortMonomialOrder
(optional) a list or set of non-zero constraints
optional arguments of the form keyword=value.
The Solve command preprocesses an algebraic system for solving by computing a collection of reduced Groebner bases corresponding to subvarieties of the initial varieties. First G is subdivided by factorization. Then each component is passed to a variant of Buchberger's algorithm that factors all intermediate results. Multiplicities are removed.
The second argument X specifies the variables of the system and optionally the monomial order. If X is a list Solve(G, X) computes lexicographic Groebner bases for each component with the variables ordered according to X. When X is a set an order is chosen heuristically (see SuggestVariableOrder) and Solve again computes lexicographic Groebner bases for each component. If X is a ShortMonomialOrder then Solve will use X for all computations, however keep in mind that lexicographic orders tend to produce the most factorization.
The third argument NZ is used to prevent certain quantities from being considered in roots. If one of the polynomials in NZ vanishes identically on a component, then that component is removed. If NZ is is omitted then ∅ is assumed.
The optional argument characteristic=p can be used to specify the ring characteristic when G is a list or set of polynomials. The default characteristic is zero.
If G is a list or set of polynomials, Solve returns a set of elements each consisting of a Groebner basis, a monomial order, and a set of non-zero constraints. If G is a PolynomialIdeal then Solve combines the Groebner basis and monomial order into a PolynomialIdeal data structure. Either format can be selected using the optional argument output=basis or output=ideal, respectively.
Note that the gsolve command is deprecated. It may not be supported in a future Maple release.
G ≔ x2−2⁢x⁢z+5,x⁢y2+y⁢z3,3⁢y2−8⁢z3:
Example where the multiplicities change. The point (x,y) = (0,-1) is a double point of intersection for the two curves x^2 + y^2 - 1 = 0 and y - x^2 + 1 = 0, but appears only with multiplicity one in the result.
J ≔ x2+y2−1,y−x2+1
Download Help Document