Computational aspects of deciding if all roots of a polynomial lie within the unit circle (Q1223130): Difference between revisions

@@ Property / cites work @@
+ON THE DISTRIBUTION OF THE ZEROS OF A POLYNOMIAL
@@ Property / cites work: ON THE DISTRIBUTION OF THE ZEROS OF A POLYNOMIAL / rank @@
+Normal rank
@@ Property / cites work @@
+On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
+Normal rank
@@ Property / cites work @@
+On Euclid's Algorithm and the Theory of Subresultants
+Normal rank
@@ Property / cites work @@
+Subresultants and Reduced Polynomial Remainder Sequences
+Normal rank
@@ Property / cites work @@
+The Calculation of Multivariate Polynomial Resultants
+Normal rank
@@ Property / cites work @@
+Integer Arithmetic Algorithms for Polynomial Real Zero Determination
+Normal rank
@@ Property / cites work @@
+A note on the modified stability table for linear discrete time systems
+Normal rank
@@ Property / cites work @@
+Q5585021
@@ Property / cites work: Q5585021 / rank @@
+Normal rank
@@ Property / cites work @@
+On homotopic mappings of Riemann surfaces
@@ Property / cites work: On homotopic mappings of Riemann surfaces / rank @@
+Normal rank
@@ Property / cites work @@
+Fast modular transforms
@@ Property / cites work: Fast modular transforms / rank @@
+Normal rank