toms365

toms365, a FORTRAN77 code 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.

Licensing:

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

Languages:

toms365 is available in a FORTRAN77 version.

Related Data and Programs:

toms365_test

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:

Last revised on 10 November 2023.