Computational aspects of deciding if all roots of a polynomial lie within the unit circle
From MaRDI portal
Publication:1223130
DOI10.1007/BF02252078zbMath0321.65029MaRDI QIDQ1223130
Lee E. Heindel, Michael R. Garey, Peter G. Anderson
Publication date: 1976
Published in: Computing (Search for Journal in Brave)
65H05: Numerical computation of solutions to single equations
30C10: Polynomials and rational functions of one complex variable
Related Items
A fraction-free unit-circle zero location test for a polynomial with any singularity profile, Fraction-free unit circle stability tests, Bounds for resultants of univariate and bivariate polynomials, Reflections on Schur-Cohn matrices and Jury-Marden tables and classification of related unit circle zero location criteria
Cites Work
- Unnamed Item
- Fast modular transforms
- On homotopic mappings of Riemann surfaces
- A note on the modified stability table for linear discrete time systems
- ON THE DISTRIBUTION OF THE ZEROS OF A POLYNOMIAL
- Subresultants and Reduced Polynomial Remainder Sequences
- Integer Arithmetic Algorithms for Polynomial Real Zero Determination
- On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
- On Euclid's Algorithm and the Theory of Subresultants
- The Calculation of Multivariate Polynomial Resultants