A Fortran program for solving a nonlinear equation by Muller's method

Abstract Computational experience with Muller's method indicates that it is very efficient algorithm for computing real, complex, and multiple zeros of arbitrary functions. Furthermore, it does not require accurate initial estimates of the zeros, nor does it require the evaluation of the derivative of the function. We present a Fortran program for Muller's method and, using numerical examples, we compare its efficiency to that of a good bracketing algorithm.