Computational aspects of deciding if all roots of a polynomial lie within the unit circle
type: Item
instance of: scholarly article
title: Computational aspects of deciding if all roots of a polynomial lie within the unit circle
zbMATH Open document ID: 0321.65029
DOI: 10.1007/BF02252078
published in: Computing
publication date: 1976-01-01T00:00:00Z
Mathematics Subject Classification ID: 65H05
Mathematics Subject Classification ID: 30C10
zbMATH DE Number: 3502710
author: Peter G. Anderson
author: M. R. Garey
author: Lee E. Heindel
MaRDI profile type: Publication
cites work: ON THE DISTRIBUTION OF THE ZEROS OF A POLYNOMIAL
cites work: On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
cites work: On Euclid's Algorithm and the Theory of Subresultants
cites work: Subresultants and Reduced Polynomial Remainder Sequences
cites work: The Calculation of Multivariate Polynomial Resultants
cites work: Integer Arithmetic Algorithms for Polynomial Real Zero Determination
cites work: A note on the modified stability table for linear discrete time systems
cites work: Q5585021
cites work: On homotopic mappings of Riemann surfaces
cites work: Fast modular transforms
full work available at URL: https://doi.org/10.1007/bf02252078
OpenAlex ID: W173069192
description: scientific article; zbMATH DE number 3502710