The Schur-Cohn algorithm revisited

DOI10.1006/JSCO.1998.0220zbMATH Open0912.68066OpenAlexW2080659327MaRDI QIDQ1269745FDOQ1269745

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

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

zbMATH Keywords

complex polynomialSchur-Cohn algorithm

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Cited In (14)

• A Routh-Hurwitz approach to a Schur-Cohn problem
• 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
• Title not available (Why is that?)
• Symmetric subresultants and applications
• Title not available (Why is that?)
• 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
• Title not available (Why is that?)
• Title not available (Why is that?)

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)