Abstract
The aim of the Schur–Cohn algorithm is to compute the number of roots of a complex polynomial in the open unit disk, each root counted with its multiplicity. Unfortunately, in its original form, it does not work with all polynomials. Using technics similar to those of the sub-resultants, we construct a new sequence of polynomials, the Schur–Cohn sub-transforms. For this, we propose an algorithm in only O(d2) arithmetical operations (dbeing the degree of the polynomial studied), which is well adapted to computer algebra and supports specialization. We then show how to use bezoutians and hermitian forms to compute the number of roots in the unit disk with the help of the Schur–Cohn sub-transforms we have built.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
