Artifact 51a3e36af116a9b954f206226d5f419e01a238481dbeed6fa8a9c01d90fcbd24:
- Executable file
r37/lisp/csl/html/r37_0397.html
— part of check-in
[f2fda60abd]
at
2011-09-02 18:13:33
on branch master
— Some historical releases purely for archival purposes
git-svn-id: https://svn.code.sf.net/p/reduce-algebra/code/trunk/historical@1375 2bfe0521-f11c-4a00-b80e-6202646ff360 (user: arthurcnorman@users.sourceforge.net, size: 991) [annotate] [blame] [check-ins using] [more...]
<A NAME=groebnert> <TITLE>groebnert</TITLE></A> <b><a href=r37_idx.html>INDEX</a></b><p><p> <B>GROEBNERT</B> _ _ _ _ _ _ _ _ _ _ _ _ <B>operator</B><P> <P> <P> <H3> syntax: </H3> <P> <P> <em>groebnert</em>({<v>=<exp>,...}) <P> <P> <P> <P> where <v> are <A HREF=r37_0002.html>kernel</A><em>s</em> (simple or indexed variables), <exp> are polynomials. <P> <P> <em>groebnert</em>is functionally equivalent to a <A HREF=r37_0382.html>groebner</A> call for {<exp>,...}, but the result is a set of equations where the left-hand sides are the basis elements while the right-hand sides are the same values expressed as combinations of the input formulas, expressed in terms of the names <v> <P> <H3> example: </H3> <P><PRE><TT> groebnert({p1=2*x**2+4*y**2-100,p2=2*x-y+1}); GB1 := {2*X - Y + 1=P2, 2 9*Y - 2*Y - 199= - 2*X*P2 - Y*P2 + 2*P1 + P2} </TT></PRE><P><P> <P>