A fast version of the Schur-Cohn algorithm.

DOI10.1006/JCOM.1999.0528MaRDI QIDQ1977142zbMATH OpenOpenAlexFDO

Authors Cyril Brunie, Philippe Saux Picart

Publication date 2000

Published in Journal of Complexity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jcom.1999.0528

Mathematics Subject Classification ID

Polynomials in real and complex fields: location of zeros (algebraic theorems) (12D10) Numerical computation of solutions to single equations (65H05) Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40)

Recommendations

• The Schur-Cohn algorithm revisited
• Schur-Cohn sub-transforms of a polynomial
• Counting Zeros of Real Polynomials within the Unit Disk
• Algebraic computation of the number of zeros of a complex polynomial in the open unit disk by a polynomial representation

Cites work

• Cauchy index computation
• Eine Verallgemeinerung des Sturmschen Wurzelzählverfahrens
• Fast computation of continued fraction expansions.
• Fast computation of GCDs
• Fast multiplication of large numbers
• scientific article; zbMATH DE number 3839766 (Why is no real title available?)
• scientific article; zbMATH DE number 3856407 (Why is no real title available?)
• scientific article; zbMATH DE number 3489473 (Why is no real title available?)
• scientific article; zbMATH DE number 1253989 (Why is no real title available?)
• scientific article; zbMATH DE number 1023365 (Why is no real title available?)
• scientific article; zbMATH DE number 3440002 (Why is no real title available?)
• Subresultants and Reduced Polynomial Remainder Sequences
• Sylvester-Habicht sequences and fast Cauchy index computation
• The Computational Complexity of Continued Fractions
• The method of symmetric and Hermitian forms in the theory of the separation of the roots of algebraic equations
• The Schur-Cohn algorithm revisited

Cited in

(11)

• The Schur-Cohn algorithm revisited
• Improvement on the Lehmer-Schur root detection method
• Schur-Cohn sub-transforms of a polynomial
• The Schaper formula and the Lascoux, Leclerc and Thibon algorithm.
• Real polynomial root-finding by means of matrix and polynomial iterations
• Accelerated approximation of the complex roots and factors of a univariate polynomial
• Symmetric subresultants and applications
• scientific article; zbMATH DE number 5013903 (Why is no real title available?)
• A remark on an algorithm for testing Pisot polynomials
• On efficient computer algebra implementation of the Schur-Cohn-Fujiwara criterion
• A fast iterative method for determining the stability of a polynomial

This page was built for publication: A fast version of the Schur-Cohn algorithm.

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