Recommendations
- A fast version of the Schur-Cohn algorithm.
- Algebraic computation of the number of zeros of a complex polynomial in the open unit disk by a polynomial representation
- On the root distribution of general polynomials with respect to the unit circle
- Schur-Cohn sub-transforms of a polynomial
- A Schur-Cohn theorem for matrix polynomials
Cited in
(15)- scientific article; zbMATH DE number 3854340 (Why is no real title available?)
- A Routh-Hurwitz approach to a Schur-Cohn problem
- Geometry and dynamics of the Schur-Cohn stability algorithm for one variable polynomials
- Revisiting the Gentry-Szydlo Algorithm
- Towards a nonlinear Schwarz's list
- The Schaper formula and the Lascoux, Leclerc and Thibon algorithm.
- A fast version of the Schur-Cohn algorithm.
- Symbolic computation and number of zeros of a real parameter polynomial in the unit disk
- scientific article; zbMATH DE number 1163431 (Why is no real title available?)
- Symmetric subresultants and applications
- scientific article; zbMATH DE number 3860292 (Why is no real title available?)
- Schur-Cohn sub-transforms of a polynomial
- A complete, nonredundant algorithm for reversed Skolemization
- On efficient computer algebra implementation of the Schur-Cohn-Fujiwara criterion
- scientific article; zbMATH DE number 3886105 (Why is no real title available?)
This page was built for publication: The Schur-Cohn algorithm revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1269745)
