Newton's method and the Computational Complexity of the Fundamental Theorem of Algebra (Q4918038): Difference between revisions

@@ Property / cites work @@
+Improvement of a convergence condition for Durand-Kerner iteration
+Normal rank
@@ Property / cites work @@
+Bounds for the variation of the roots of a polynomial and the eigenvalues of a matrix
+Normal rank
@@ Property / cites work @@
+Sums of powers of complex numbers
@@ Property / cites work: Sums of powers of complex numbers / rank @@
+Normal rank
@@ Property / cites work @@
+ON THE DISTANCE BETWEEN ROOTS OF INTEGER POLYNOMIALS
+Normal rank
@@ Property / cites work @@
+Circular arithmetic and the determination of polynomial zeros
+Normal rank
@@ Property / cites work @@
+On Algorithms for Solvingf(x)=0
@@ Property / cites work: On Algorithms for Solvingf(x)=0 / rank @@
+Normal rank
@@ Property / cites work @@
+Partial fraction decomposition in \(\mathbb{C}(z)\) and simultaneous Newton iteration for factorization in \(\mathbb{C}^{[z]}\)
+Normal rank
@@ Property / cites work @@
+Der Fundamentalsatz der Algebra und der Intuitionismus
+Normal rank
@@ Property / cites work @@
+Ergänzung zu einer Arbeit von Hellmuth Kneser über den Fundamentalsatz der Algebra
+Normal rank
@@ Property / cites work @@
+A Machine Method for Solving Polynomial Equations
@@ Property / cites work: A Machine Method for Solving Polynomial Equations / rank @@
+Normal rank
@@ Property / cites work @@
+An inequality for the discriminant of a polynomial
+Normal rank
@@ Property / cites work @@
+Families of rational maps and iterative root-finding algorithms
+Normal rank
@@ Property / cites work @@
+An efficient algorithm for the complex roots problem
+Normal rank
@@ Property / cites work @@
+Q4060241
@@ Property / cites work: Q4060241 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3128885
@@ Property / cites work: Q3128885 / rank @@
+Normal rank
@@ Property / cites work @@
+Solving a Polynomial Equation: Some History and Recent Progress
+Normal rank
@@ Property / cites work @@
+On the Efficiency of Newton's Method in Approximating All Zeros of a System of Complex Polynomials
+Normal rank
@@ Property / cites work @@
+On the worst-case arithmetic complexity of approximating zeros of polynomials
+Normal rank
@@ Property / cites work @@
+On a theorem of S. Smale about Newton's method for analytic mappings
+Normal rank
@@ Property / cites work @@
+Q3126790
@@ Property / cites work: Q3126790 / rank @@
+Normal rank
@@ Property / cites work @@
+<i>Computational Complexity</i>: On the Geometry of Polynomials and a Theory of Cost: II
+Normal rank
@@ Property / cites work @@
+Complexity of Bezout's Theorem I: Geometric Aspects
+Normal rank
@@ Property / cites work @@
+The fundamental theorem of algebra and complexity theory
+Normal rank
@@ Property / cites work @@
+On the efficiency of algorithms of analysis
@@ Property / cites work: On the efficiency of algorithms of analysis / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial root finding by means of continuation
@@ Property / cites work: Polynomial root finding by means of continuation / rank @@
+Normal rank
@@ Property / cites work @@
+Some remarks on Smale's “Algorithms for solving equations”
+Normal rank
@@ Property / cites work @@
+Q4953977
@@ Property / cites work: Q4953977 / rank @@
+Normal rank