Raymond F. Boyce, Donald D. Chamberlin, et al.
CACM
An always converging method is given for the solution of the equation F(t)=0. If F(t) has only one root Z in the basic interval [a, b] then optimal bounds for Z can be evaluated. The algorithm given uses the method of interval-halfing several times. It is essential for the construction of the bounds for Z that the value of the function F(t) be computed with the aid of an errorbound-arithmetic. © 1967 Springer-Verlag.
Raymond F. Boyce, Donald D. Chamberlin, et al.
CACM
Elliot Linzer, M. Vetterli
Computing
Yvonne Anne Pignolet, Stefan Schmid, et al.
Discrete Mathematics and Theoretical Computer Science
N.K. Ratha, A.K. Jain, et al.
Workshop CAMP 2000