The Incrementation Parameter in Square Root Iteration

Abstract
In the globally convergent adaptation of the square root algorithm for finding the real zeros of certain defined classes of entire functions, in order to re-start the iteration after a zero has been found it is necessary to advance the current value of the argument by a small increment. It is shown how to evaluate this increment so as to verify each zero to within some pre-assigned tolerance.

This publication has 0 references indexed in Scilit: