Article citationsMore>>

Jenkins, M.A. and Traub, J.F. (1972) Algorithm 419: Zeros of a Complex Polynomial. Communications of the ACM, 15, 97-99.
https://doi.org/10.1145/361254.361262

has been cited by the following article:

• TITLE: Method of Successive Polynomial Substitutions for Computing Roots of Polynomials

  AUTHORS: Serdar Beji

  KEYWORDS: Real and Complex Roots of Polynomials, Method of Successive Polynomial Substitutions, Accurate and Efficient Computation of Zeros of Polynomials

  JOURNAL NAME: Advances in Pure Mathematics, Vol.16 No.6, June 16, 2026

  ABSTRACT: A recursive technique, termed method of successive polynomial substitutions for computing all the real and complex roots of a polynomial of any given degree, is introduced. The method proceeds by reducing the degree of polynomial by one at each stage of successive polynomial substitutions; extracts a root, and continues until reaching a second-degree polynomial whose roots are obtained analytically. Coefficients of the polynomial may be real or complex; no initial guess is needed and the results are highly accurate. Sample computations for polynomials of various degrees and the code used in computations are given.