A fast version of the Schur-Cohn algorithm.

DOI10.1006/jcom.1999.0528zbMath1042.65034OpenAlexW2079547351MaRDI QIDQ1977142

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

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

Related Items (3)

Symmetric subresultants and applications ⋮ Real polynomial root-finding by means of matrix and polynomial iterations ⋮ Accelerated approximation of the complex roots and factors of a univariate polynomial

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cauchy index computation
• The Schur-Cohn algorithm revisited
• Fast multiplication of large numbers
• Fast computation of continued fraction expansions.
• Eine Verallgemeinerung des Sturmschen Wurzelzählverfahrens
• 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
• Fast computation of GCDs
• Subresultants and Reduced Polynomial Remainder Sequences
• Sylvester-Habicht sequences and fast Cauchy index computation

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