High order algorithms for approximating<i>n</i>th roots (Q4828667): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1080/00207160410001714583
+Normal rank
@@ Property / OpenAlex ID @@
+W1997101671
@@ Property / OpenAlex ID: W1997101671 / rank @@
+Normal rank
@@ Property / cites work @@
+\(n\)th root extraction: Double iteration process and Newton's method
+Normal rank
@@ Property / cites work @@
+On Halley's Iteration Method
@@ Property / cites work: On Halley's Iteration Method / rank @@
+Normal rank
@@ Property / cites work @@
+Accelerated Convergence in Newton’s Method
@@ Property / cites work: Accelerated Convergence in Newton’s Method / rank @@
+Normal rank
@@ Property / cites work @@
+A family of Chebyshev-Halley type methods in Banach spaces
+Normal rank
@@ Property / cites work @@
+Calculus of \(n\)th roots and third order iterative methods.
+Normal rank
@@ Property / cites work @@
+Indices of convexity and concavity. Application to Halley method
+Normal rank
@@ Property / cites work @@
+A Modified Babylonian Algorithm
@@ Property / cites work: A Modified Babylonian Algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Several new methods for solving equations
@@ Property / cites work: Several new methods for solving equations / rank @@
+Normal rank
@@ Property / cites work @@
+Graphic and numerical comparison between iterative methods
+Normal rank
@@ Property / cites work @@
+Historical Development of the Newton–Raphson Method
+Normal rank