An algorithm for locating all zeros of a real polynomial
The authors present a globally convergent algorithm for calculating all zeros of a polynomial \(p_n\) with real coefficients. The calculation procedure starts with the stability test allowing to decide whether all zeros of \(p_n\) lie in the interior of the unit circle of the complex plane. It is also possible to get the exact number of zeros in the interior, on the boundary and in the exterior of a circle. Later the approximations of the zeros are calculated by appropriate iterative algorithms (e.g. Newton's or Bairstrow's type at the final stage).
scientific article; zbMATH DE number 769259
scientific article