Approximate Zeros of Quadratically Convergent Algorithms (Q4305971): Difference between revisions

@@ label / en / label / en @@
+Approximate Zeros of Quadratically Convergent Algorithms
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.2307/2153572
@@ Property / full work available at URL: https://doi.org/10.2307/2153572 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2007951771
@@ Property / OpenAlex ID: W2007951771 / rank @@
+Normal rank
@@ Property / title @@
+Approximate Zeros of Quadratically Convergent Algorithms (English)
+Normal rank
@@ Property / cites work @@
+On zero finding methods of higher order from data at one point
+Normal rank
@@ Property / cites work @@
+On Approximate Zeros and Rootfinding Algorithms for a Complex Polynomial
+Normal rank
@@ Property / cites work @@
+Computational complexity. On the geometry of polynomials and a theory of cost. I
+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 @@
+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 @@
+On a theorem of S. Smale about Newton's method for analytic mappings
+Normal rank