Artifact 56acc41fe0364167876722a9ce1ba29036e005c318192d0e24a079d6f4c38f3e:

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

<A NAME=NEARESTROOT>

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



<B>NEARESTROOT</B> _ _ _  _ _ _  _ _ _  _ _ _ <B>operator</B><P>
<P>
 
 <P>
<P>
The operator <em>nearestroot</em> finds one root of a polynomial 
with an iteration using a given starting point. 
<P>
<P>
 <P> <H3> 
syntax: </H3>
<em>nearestroot</em>(&lt;p&gt;,&lt;pt&gt;) 
<P>
<P>
<P>
where &lt;p&gt; is a univariate polynomial 
and &lt;pt&gt; is a number. 
<P>
<P>
 <P> <H3> 
examples: </H3>
<P><PRE><TT>
nearestroot(x^2+2,2);

  {x=1.41421*i}

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

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