File r37/lisp/csl/html/r37_0438.html artifact af1e63cd16 part of check-in 955d0a90a7



<A NAME=ROOTS>

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



<B>ROOTS</B> _ _ _  _ _ _  _ _ _  _ _ _ <B>operator</B><P>
<P>
 
 <P>
<P>
The operator <em>roots</em> 
is the main top level function of the roots package. 
It will find all roots, real and complex, of the polynomial p 
to an accuracy that is sufficient to separate them and which is 
a minimum of 6 decimal places. 
<P>
<P>
 <P> <H3> 
syntax: </H3>
<em>roots</em>(&lt;p&gt;) 
<P>
<P>
<P>
where &lt;p&gt; is a univariate polynomial. Result is a 
<A HREF=r37_0053.html>list</A> 
of equations which represent the roots of the polynomial at the 
given accuracy. In addition, <em>roots</em> stores 
separate lists of real roots and complex roots in the global 
variables 
<A HREF=r37_0441.html>rootsreal</A> and 
<A HREF=r37_0440.html>rootscomplex</A>. 
<P>
<P>
 <P> <H3> 
examples: </H3>
<P><PRE><TT>
roots(x^5-2);

  {x=-0.929316 + 0.675188*i,
    x=-0.929316 - 0.675188*i,
    x=0.354967 + 1.09248*i,
    x=0.354967 - 1.09248*i, 
    x=1.1487}

</TT></PRE><P>The minimal accuracy of the result values is controlled by 

<A HREF=r37_0437.html>rootacc</A>. 
<P>
<P>


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