SOME EFFICIENT METHODS FOR ENCLOSING SIMPLE ZEROS OF NONLINEAR EQUATIONS

In the present paper we propose three new methods for computing sequences of enclosing intervals for a zero of a real function without convexity assumptions. The new methods have been tested on a series of published examples. The numerical experiments show that our methods are comparable in terms of efficiency with the well-known algorithms of Dekker and Brent.