Artifact 319b9f87859c0f7858c0587043f5dd9802d1aec6ec957e1c443e93290c641647:

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

<A NAME=Roots_Package>

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



<B>ROOTS PACKAGE</B> _ _ _  _ _ _  _ _ _  _ _ _ <B>introduction</B><P>
<P>
 
 <P>
<P>
The root finding package is designed so that it can 
be used to find some or all of the roots of univariate 
polynomials with real or complex coefficients, to the accuracy 
specified by the user. 
<P>
<P>
Not all operators of <em>roots package</em> are described here. For using 
the operators 
<P>
<P>
<em>isolater</em>(intervals isolating real roots) 
<P>
<P>
<em>rlrootno</em>(number of real roots in an interval) 
<P>
<P>
<em>rootsat-prec</em>(roots at system precision) 
<P>
<P>
<em>rootval</em>(result in equation form) 
<P>
<P>
<em>firstroot</em>(computing only one root) 
<P>
<P>
<em>getroot</em>(selecting roots from a collection) 
<P>
<P>
please consult the full documentation of the package. 
<P>
<P>