Algebraic computation of the number of zeros of a complex polynomial in the open unit disk by a polynomial representation

From MaRDI portal
Publication:628241





The authors present an algorithm to compute the number of zeros of a complex polynomial inside the unit disk. Using the Schur-Cohn and Brown transforms they recursively associate to the given polynomial a sequence of polynomials and consider the number of sign changes in the sequence of their values at zero.











This page was built for publication: Algebraic computation of the number of zeros of a complex polynomial in the open unit disk by a polynomial representation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q628241)