Artifact 06085d4930268017ce7733ee70eadb81dd5f75cf48ab6a8961fe03811d42e7ce:

• Executable file r37/lisp/csl/html/r37_0365.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: 914) [annotate] [blame] [check-ins using] [more...]

<A NAME=matrix_term_order>

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



<B>MATRIX TERM ORDER</B><P>
<P>
 
 <P>
<P>
Any arbitrary term order mode can be installed by a matrix with 
integer elements where the row length corresponds to the variable 
number. The matrix must have at least as many rows as columns. 
It must have full rank, and the top nonzero element of each column 
must be positive. 
<P>
<P>
The matrix <em>term order mode</em> 
defines a term order where the exponent vectors of the monomials are 
first multiplied by the matrix and the resulting vectors are compared 
lexicographically. 
<P>
<P>
If the switch 
<A HREF=r37_0273.html>comp</A> is on, the matrix is converted into 
a compiled LISP program for faster execution. A matrix can also be 
compiled explicitly, see 
<A HREF=r37_0355.html>torder_compile</A>. 
<P>
<P>