Artifact ff38b28c1ef7bee88695bedbbd0f904e67cd2872e1a21c3d5f23e838190f7e7c:

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

<A NAME=VAROPT>

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



<B>VAROPT</B> _ _ _  _ _ _  _ _ _  _ _ _ <B>switch</B><P>
<P>
 
 <P>
<P>
When <em>varopt</em> is on, the sequence of variables is optimized by 

<A HREF=r37_0179.html>solve</A> with respect to execution speed. Otherwise, the 
sequence 
given in the call to 
<A HREF=r37_0179.html>solve</A> is preserved. Default is <em>on</em>. 
<P>
<P>
In combination with the switch 
<A HREF=r37_0268.html>arbvars</A>, <em>varopt</em> can be used 
to control variable elimination. 
<P>
<P>
 <P> <H3> 
examples: </H3>
<P><PRE><TT>
off arbvars; 

solve({x+2z,x-3y},{x,y,z});				

           x      x
  		   {{y=-,z= - -}} 
           3      2


solve({x*y=1,z=x},{x,y,z});				

               1
  		   {{z=x,y=-}} 
               x


off varopt; 

solve({x+2z,x-3y},{x,y,z});				

                       2*z
  		   {{x= - 2*z,y= - ---}} 
                        3


solve({x*y=1,z=x},{x,y,z});				

           1
  		   {{y=-,x=z}} 
           z

</TT></PRE><P>