Multipoint Iterative Methods for Finding All the Simple Zeros in an Interval

<table><tr><td><table class="algorithm" id="alg2"><tr><td colspan="2"><span style="font-family:monospace">s</span><span style="font-family:monospace">eeds = Cases[Normal[p], Point[z_]:&gt; z[[</span><svg height="10.9125" id="M178" style="vertical-align:-0.0pt" version="1.1" viewbox="0 0 8.2875004 10.9125" width="8.2875004" xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink">
<g transform="matrix(.017,-0,0,-.017,.062,10.862)"><path d="M384 0h-275v27q67 5 81.5 18.5t14.5 68.5v385q0 38 -7.5 47.5t-40.5 10.5l-48 2v24q85 15 178 52v-521q0 -55 14.5 -68.5t82.5 -18.5v-27z" id="x31"></path></g>
</svg><span style="font-family:monospace">]], Infinity]; </span></td></tr><tr><td colspan="2"><span style="font-family:monospace">setInitial = Sort[seeds] </span></td></tr><tr><td colspan="2"><span style="font-family:monospace">NumberOfGuesses = Length[setInitial] </span></td></tr></table></td></tr></table>

Journal of Applied Mathematics

alg2

Algorithm 2

Algorithm 2: Multipoint Iterative Methods for Finding All the Simple Zeros in an Interval 