Generalizations of an algorithm of Sebastião e Silva (Q2540163): Difference between revisions

For a given polynomial \(f(z)\), the algorithm of Sebastião e Silva provides sequences of polynomials whose limits are polynomials whose zeros are zeros of \(f(z)\) of equal modulus. The algorithm begins by forming successive remainders \(g_{\nu+1}(z)\) after dividing \(zg_\nu(z)\) by \(f(z)\), and proceeds to form sequences of polynomials of lower degrees by successive elimination of leading terms. It is shown that multiplication by an almost arbitrary polynomial \(g(z)\) instead of by \(z\) can be used in forming the initial sequence, and that the sequences of lower degrees can be formed in either of two distinct ways.