zoomin, a FORTRAN90 code which seeks a root of a scalar function.

The code is based primarily on a book by Joseph Traub.

These routines are each intended to find one of more solutions of an equation in one unknown, written as

f(x) = 0
The wide variety of methods include special rules for polynomials, multiple roots, bisection methods, and methods that use no derivative information.


The computer code and data files described and made available on this web page are distributed under the MIT license


zoomin is available in a FORTRAN90 version.

Related Data and Programs:


bisection_integer, a FORTRAN90 code which seeks an integer solution to the equation F(X)=0, using bisection within a user-supplied change of sign interval [A,B].

bisection_rc, a FORTRAN90 code which seeks a solution to the equation F(X)=0 using bisection within a user-supplied change of sign interval [A,B]. The procedure is written using reverse communication.

brent, a FORTRAN90 code which contains Richard Brent's routines for finding the zero, local minimizer, or global minimizer of a scalar function of a scalar argument, without the use of derivative information.

test_zero, a FORTRAN90 code which defines functions which can be used to test zero finders.

zero_rc, a FORTRAN90 code which seeks solutions of a scalar nonlinear equation f(x) = 0, or a system of nonlinear equations, using reverse communication.


  1. Richard Brent,
    Algorithms for Minimization without Derivatives,
    Dover, 2002,
    ISBN: 0-486-41998-3,
    LC: QA402.5.B74.
  2. Harold Deiss,
    ZOOMIN technical report,
  3. Eldon Hansen, Merrell Patrick,
    A Family of Root Finding Methods,
    Numerische Mathematik,
    Volume 27, Number 3, September 1977, pages 257-269.
  4. P Jarratt,
    Some fourth-order multipoint iterative methods for solving equations,
    Mathematics of Computation,
    Volume 20, Number 95, July 1966, pages 434-437.
  5. Richard King,
    A family of fourth order methods,
    SIAM Journal on Numerical Analysis,
    Volume 10, 1973, pages 876-879.
  6. Richard King,
    Improving the van de Vel root-finding method,
    Volume 30, 1983, pages 373-378.
  7. Werner Rheinboldt,
    Algorithms for finding zeros of a function,
    UMAP Journal,
    Volume 2, Number 1, 1981, pages 43-72.
  8. Joseph Traub,
    Iterative Methods for the Solution of Equations,
    Prentice Hall, 1964.
  9. Hugo vandeVel,
    A method for computing a root of a single nonlinear equation, including its multiplicity,
    Volume 14, 1975, pages 167-171.

Source Code:

Last revised on 26 November 2022.