Improving the efficiency index in enclosing a root of an equation (Q676171)

The paper is based on a root enclosing algorithm [Alg. 4.2 in \textit{G. E. Alefeld}, \textit{F. A. Potra}, and \textit{Y. Shi}, Algorithm 748; enclosing zeros of continuous functions, ACM Trans. Math. Software 21, No. 3, 327-344 (1995; see the preceding review, Zbl 0872.65041)] which uses inverse cubic interpolation and, partially, approximate quadratic approximation. Now, the efficiency index of this algorithm which is about \(1.6686\dots\) is improved by using higher order inverse interpolation and by utilizing all the function values which have already been computed in the current step and the step before. Then the efficiency index is \(1.7282\dots\) for functions which are 6 times continuously differentiable.