toms429

toms429, a FORTRAN77 code which implements ACM toms algorithm 429, for localization of the roots of a polynomial.

While 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, most of the early algorithms are not available. This is one of them. I typed it in.

This version of the algorithm incorporates corrections and improvements suggested by Driessen and Hunt.

Usage:

call polyan ( c, cm, n )
where C(1:N) contains the polynomial coefficients, omitting the leading coefficient, which is assumed by normalization to be 1, and starting with the coefficient of X^(N-1); CM(1:N) is a work vector and N is the degree of the polynomial.

Licensing:

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

Languages:

toms429 is available in a FORTRAN77 version.

Related Programs:

toms429_test

Reference:

  1. HB Driessen, EW Hunt,
    Remark on Algorithm 429,
    Communications of the ACM,
    September 1973, Volume 16, Number 9, page 579.
  2. Paul Saylor, James Sebastian,
    Algorithm 429: Localization of the Roots of a Polynomial,
    Communications of the ACM,
    Volume 15, Number 8, August 1972, pages 776-777.

Source Code:

Last revised on 15 November 2023.