toms419, a Fortran77 code which implements ACM toms algorithm 419, commonly known as cpoly(), which seeks the roots of a polynomial with complex coefficients.
The text of many ACM toms algorithms is available online through ACM: https://www.acm.org/pubs/calgo or NETLIB: https://www.netlib.org/toms/index.html. in.
The information on this web page is distributed under the MIT license
toms419 is available in a Fortran77 version and a Fortran90 version.
brent, a Fortran77 code which contains Richard Brent's routines for finding the zero, local minimizer, or global minimizer of a scalar function of a scalar argument, without the use of derivative information.
test_zero, a Fortran90 code which defines some test functions for which zeroes can be sought.
toms365, a Fortran77 code which finds a root of an analytic complex function by the downhill method; this is a version of ACM toms algorithm 365.
toms429, a Fortran77 code which reports information about the estimated location of roots of a polynomial; this is ACM toms algorithm 429.
toms493, a Fortran77 code which seeks the roots of a real polynomial; this library is commonly called rpoly(); this is ACM toms algorithm 493.
zoomin, a Fortran90 code which includes various zero finder routines.
Original Fortran77 version by Michael Jenkins, Joseph Traub. This version by John Burkardt.