A fast version of the Schur-Cohn algorithm.
type: Item
instance of: scholarly article
title: A fast version of the Schur-Cohn algorithm.
zbMATH Open document ID: 1042.65034
author: Cyril Brunie
author: Philippe Saux Picart
published in: Journal of Complexity
publication date: 2000-01-01T00:00:00Z
Mathematics Subject Classification ID: 65H05
Mathematics Subject Classification ID: 12D10
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 1444121
MaRDI profile type: Publication
full work available at URL: jcom.1999.0528
OpenAlex ID: W2079547351
cites work: Q3309525
cites work: Subresultants and Reduced Polynomial Remainder Sequences
cites work: Eine Verallgemeinerung des Sturmschen Wurzelzählverfahrens
cites work: Q4072022
cites work: The method of symmetric and Hermitian forms in the theory of the separation of the roots of algebraic equations
cites work: Q4766043
cites work: Cauchy index computation
cites work: Sylvester-Habicht sequences and fast Cauchy index computation
cites work: Fast computation of GCDs
cites work: Q4226968
cites work: Q4341368
cites work: The Schur-Cohn algorithm revisited
cites work: Fast computation of continued fraction expansions.
cites work: Q3325040
cites work: Fast multiplication of large numbers
cites work: The Computational Complexity of Continued Fractions
DOI: 10.1006/JCOM.1999.0528
description: scientific article; zbMATH DE number 1444121