zero_muller

zero_muller, a Fortran77 code which seeks a root of a nonlinear equation using Muller's method, with complex arithmetic.

Licensing:

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

Languages:

zero_muller is available in a Fortran77 version and a Fortran90 version and a MATLAB version and an Octave version.

Related Data and Programs:

zero_muller_test

bisection_integer, a Fortran77 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 Fortran77 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.

nms, a Fortran77 code which includes versions of Brent's zero finder.

test_zero, a Fortran77 code which defines some test functions for which zeroes can be sought.

toms419, a Fortran77 code which seeks all the roots of a polynomial with complex coefficients, commonly known as cpoly(); this is a version of ACM TOMS algorithm 419.

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

zero_chandrupatla, a Fortran77 code which finds a zero of a scalar function of a scalar variable, starting from a change of sign interval, using the Chandrupatla method, which can converge faster than bisection, regula falsi, or Brent's method, by Tirupathi Chandrapatla.

zero_itp, a Fortran77 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.

Reference:

1. Gisela Engeln-Muellges, Frank Uhlig,
   Numerical Algorithms with C,
   Springer, 1996,
   ISBN: 3-540-60530-4,
   LC: QA297.E56213.

Source Code:

• zero_muller.f, the source code;
• zero_muller.sh, compiles the source code;