Computational aspects of deciding if all roots of a polynomial lie within the unit circle
- 1 December 1976
- journal article
- Published by Springer Nature in Computing
- Vol. 16 (4) , 293-304
- https://doi.org/10.1007/bf02252078
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Integer Arithmetic Algorithms for Polynomial Real Zero DeterminationJournal of the ACM, 1971
- The Calculation of Multivariate Polynomial ResultantsJournal of the ACM, 1971
- On Euclid's Algorithm and the Computation of Polynomial Greatest Common DivisorsJournal of the ACM, 1971
- On Euclid's Algorithm and the Theory of SubresultantsJournal of the ACM, 1971
- On decreasing the computing time for modular arithmeticPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1971
- The SAC-1 systemPublished by Association for Computing Machinery (ACM) ,1971
- Subresultants and Reduced Polynomial Remainder SequencesJournal of the ACM, 1967
- ON THE DISTRIBUTION OF THE ZEROS OF A POLYNOMIALThe Quarterly Journal of Mathematics, 1965
- A modified stability table for linear discrete systemsProceedings of the IEEE, 1965
- A Simplified Stability Criterion for Linear Discrete SystemsProceedings of the IRE, 1962