The Schur-Cohn algorithm revisited

DOI10.1006/JSCO.1998.0220MaRDI QIDQ1269745zbMATH OpenOpenAlexFDO

Authors Philippe Saux Picart

Publication date 30 May 1999

Published in Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jsco.1998.0220

zbMATH Keywords

complex polynomialSchur-Cohn algorithm

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

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)

• On efficient computer algebra implementation of the Schur-Cohn-Fujiwara criterion
• A fast version of the Schur-Cohn algorithm.
• Symmetric subresultants and applications
• A complete, nonredundant algorithm for reversed Skolemization
• scientific article; zbMATH DE number 3886105 (Why is no real title available?)
• Towards a nonlinear Schwarz's list
• scientific article; zbMATH DE number 3860292 (Why is no real title available?)
• Geometry and dynamics of the Schur-Cohn stability algorithm for one variable polynomials
• A Routh-Hurwitz approach to a Schur-Cohn problem
• scientific article; zbMATH DE number 1163431 (Why is no real title available?)
• The Schaper formula and the Lascoux, Leclerc and Thibon algorithm.
• Revisiting the Gentry-Szydlo Algorithm
• Symbolic computation and number of zeros of a real parameter polynomial in the unit disk
• Schur-Cohn sub-transforms of a polynomial
• scientific article; zbMATH DE number 3854340 (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)