bisection_rc, an Octave code which demonstrates the simple bisection method for solving a scalar nonlinear equation in a change of sign interval, using reverse communication (RC).
The routine assumes that an interval [a,b] is known, over which the function f(x) is continuous, and for which f(a) and f(b) are of opposite sign. By repeatedly computing and testing the midpoint, the halving change of sign interval may be reduced, so that either the uncertainty interval or the magnitude of the function value becomes small enough to satisfy the user as an approximation to the location of a root of the function.
This routine is in part a demonstration of the idea of reverse communication. Many zero finders require that the user define f(x) by writing a function with a very specific set of input and output arguments, and sometimes with a specific name, so that the user can call the zero finder, which in turn can call the function. This is sometimes an awkward formulation to follow. Reverse communication instead allows the user's calling program to retain control of the function evaluation.
To use the reverse communication zero finder, the user defines the values of A and B, and sets a parameter JOB to zero to indicate that this is the first call. From then on, the zero finder repeatedly returns a value X, asking the user to evaluate the function there. Once the user has evaluated FX = f(X), the user may accept this approximation to the root, or else call the zero finder again, passing the just-computed value of FX so that it can take another bisection step.
The computer code and data files described and made available on this web page are distributed under the MIT license
bisection_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.
backtrack_binary_rc, an Octave code which carries out a backtrack search for a set of binary decisions, using reverse communication (RC).
bisection_integer, an Octave code which seeks an integer solution to the equation F(X)=0, using bisection within a user-supplied change of sign interval [A,B].
cg_rc, an Octave code which implements the conjugate gradient method for solving a positive definite sparse linear system A*x=b, using reverse communication (RC).
local_min_rc, an Octave 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.
newton_rc, an Octave code which solves a system of nonlinear equations by Newton's method, using reverse communication (RC).
root_rc, an Octave 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, an Octave code which seeks a solution of a system of nonlinear equations f(x) = 0, using reverse communication (RC), by Gaston Gonnet.
sort_rc, an Octave code which can sort a list of any kind of objects, using reverse communication (RC).
test_zero, an Octave code which implements test problems for the solution of a single nonlinear equation in one variable.
zero_rc, an Octave code which seeks a solution of a scalar nonlinear equation f(x) = 0, using reverse communication (RC), by Richard Brent.