TOMS365
Complex Root Finding

TOMS365 is a FORTRAN77 library which implements ACM TOMS algorithm 365, for finding a root of a complex analytic function.

The text of many ACM TOMS algorithms is available online through ACM: http://www.acm.org/pubs/calgo or NETLIB: http://www.netlib.org/toms/index.html.

Usage:

call crf ( zs, hs, hm, dm, func, ds, ze, he, de, n )

where ZS (complex) is the starting estimate for the root, HS is the initial stepsize, HM is the minimum stepsize, DM is the maximum acceptable norm of the function, FUNC is a routine which evaluates the function, DS (output) is the norm of the function at the initial point, ZE (output) is the final estimate for the root, HE (output) is the last step length, DE (output) is the norm of the function at ZE, N is the number of iterations.

Languages:

TOMS365 is available in a FORTRAN77 version.

Reference:

1. Henning Bach,
   On the Downhill Method,
   Communications of the ACM,
   Volume 121, Number 12, page 675-678, December 1969.
2. Henning Bach,
   Algorithm 365: Complex Root Finding,
   Communications of the ACM,
   Volume 121, Number 12, page 686-687, December 1969.

Source Code:

• toms365.f, the source code.
• toms365.sh, commands to compile the source code.

Examples and Tests:

• toms365_prb.f, a sample calling program.
• toms365_prb.sh, commands to compile and run the sample program.
• toms365_prb_output.txt, the output file.

List of Routines:

• CRF determines a root of a complex transcendental equation.

You can go up one level to the FORTRAN77 source codes.