zero_rc, a C code which seeks a solution of a scalar nonlinear equation f(x)=0, using reverse communication (RC), by Richard Brent.

One of the standard problems in numerical analysis is to determine an approximate solution to a scalar nonlinear equation of the form f(x)=0.

Reliable and efficient procedures for this task, sometimes called "zero finders" or "root solvers" are available in many libraries. These procedures typically require the user to write a sub-procedure to evaluate the function for any argument x; the form and list of arguments for this sub-procedure are strictly prescribed by the library procedure. The user must somehow make this sub-procedure available to the solver, either by using a fixed name for the sub-procedure, or by passing in the actual name as an argument.

In many cases, it can be inconvenient to use such a library routine, because it is inserted between the main user program and the user function. This means that data defining the function, which might be chosen in the main program, must then somehow be communicated to the user function, perhaps by declaring some kind of global memory, or by sneaking the data through in an extra argument provided by the library procedure, or by the use of auxilliary data files.

Moreover, the user essentially loses control of the process until the library procedure returns. It might, however, be the case that the user could detect important error conditions, or gather useful information, if the intermediate x values generated by the library procedure were visible.

If we denote this typical method of interaction between a user and a library an instance of "forward communication", then there is an alternative approach, known as "reverse communication", which allows the user much more freedom in designing the function evaluation, and in observing and intervening in the iteration that is seeking the solution.

An idealized version of the use of a reverse communication zero finder might look like this:

        x = initial approximation.
        while ( not satisfied )
          fx = f(x)
          x = root ( x, fx )
Here, "not satisfied" might simply be a test of the magnitude of f(x). But note two things:

Reverse communication zero finders can be very useful in situations where the function to be evaluated is actually the outcome of a complicated process. For instance, if we are seeking an eigenvalue x that makes the determinant of some matrix zero, then our function evaluation may require us to form a large matrix and to factor it in order to evaluate the determinant. This may be cumbersome to do if we must perform all these operations in a sub-procedure.

Similarly, we might be solving a boundary value problem using the shooting method, and f(x) might be the deviation at the final time between the computed and desired boundary values. In that case, a subprocedure formulation would require us to set up and solve a boundary value problem repeatedly in an isolated piece of code.


The information on this web page is distributed under the MIT license.


zero_rc is available in a C version and a C++ version and a Fortran90 version and a MATLAB version and an Octave version and a Python version.

Related Data and Programs:


backtrack_binary_rc, a C code which carries out a backtrack search for a set of binary decisions, using reverse communication (RC).

bisection, a C code which applies the bisection method to seek a root of f(x) over a change-of-sign interval a <= x <= b.

bisection_rc, a C 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 (RC).

cg_rc, a C code which implements the conjugate gradient (CG) method for solving a positive definite sparse linear system A*x=b, using reverse communication (RC).

local_min_rc, a C code which finds a local minimum of a scalar function of a scalar variable, without the use of derivative information, using reverse communication (RC), by Richard Brent.

root_rc, a C code which seeks a solution of a scalar nonlinear equation f(x) = 0, or a system of nonlinear equations, using reverse communication (RC), by Gaston Gonnet.

roots_rc, a C code which seeks a solution of a system of nonlinear equations f(x) = 0, using reverse communication (RC), by Gaston Gonnet.

sort_rc, a C code which can sort a list of any kind of objects, using reverse communication (RC).

test_zero, a C code which implements test problems for the solution of a single nonlinear equation in one variable.

zero_brent, a C code which seeks a solution of a scalar nonlinear equation f(x) = 0, by Richard Brent.

zero_itp, a C code which finds a zero of a scalar function of a scalar variable, starting from a change of sign interval, using the Interpolate/Truncate/Project (ITP) method, which has faster convergence than the bisection method.

zero_laguerre, a C code which uses Laguerre's method to find the zero of a function. The method needs first and second derivative information. The method almost always works when the function is a polynomial.

zero_muller, a C code which seeks a root of a nonlinear equation using the Muller method, with complex arithmetic.


  1. Richard Brent,
    Algorithms for Minimization without Derivatives,
    Dover, 2002,
    ISBN: 0-486-41998-3,
    LC: QA402.5.B74.
  2. Werner Rheinboldt,
    Algorithms for finding zeros of a function,
    UMAP Journal,
    Volume 2, Number 1, 1981, pages 43-72.

Source Code:

Last revised on 29 May 2021.