File r37/lisp/csl/html/r37_0405.html artifact b0118855eb part of check-in a57e59ec0d



<A NAME=gspoly>

<TITLE>gspoly</TITLE></A>
<b><a href=r37_idx.html>INDEX</a></b><p><p>



<B>GSPOLY</B> _ _ _  _ _ _  _ _ _  _ _ _ <B>operator</B><P>
<P>
 
 <P>
<P>
 <P> <H3> 
syntax: </H3>
<em>gspoly</em>(&lt;p1&gt;,&lt;p2&gt;); 
<P>
<P>
<P>
<P>
where &lt;p1&gt; and &lt;p2&gt; are polynomials. 
<P>
<P>
The <em>subtraction</em> polynomial of p1 and p2 is computed 
corresponding to the method of the Buchberger algorithm for 
computing <em>groebner bases</em>: p1 and p2 are multiplied 
with terms such that when subtracting them the leading terms 
cancel each other. 
<P>
<P>


REDUCE Historical
REDUCE Sourceforge Project | Historical SVN Repository | GitHub Mirror | SourceHut Mirror | NotABug Mirror | Chisel Mirror | Chisel RSS ]