On rediscovered iteration methods for solving equations (Q1300719): Difference between revisions

The authors show the equivalence of several classes of iterative methods for solving a single equation \(f(x)=0,\) with arbitrary rate of convergence.

0 references

zbMATH Keywords

iteration method

0 references

convergence

0 references

reviewed by

Matthew X. He

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

On types of convergence and on the behavior of approximations in the neighborhood of a multiple root of an equation

0 references

A class of Iteration functions for improving, simultaneously, approximations to the zeros of a polynomial

0 references

Accelerated Convergence in Newton’s Method

0 references

Accelerated Convergence in Newton’s Method

0 references

Relationships between order and efficiency of a class of methods for multiple zeros of polynomials

0 references

Q5672080

0 references

High order iterative methods for approximating square roots

0 references

A basic family of iteration functions for polynomial root finding and its characterizations

0 references

Über eine Verallgemeinerung des Newtonschen Näherungsverfahrens

0 references

Computational complexity. On the geometry of polynomials and a theory of cost. I

0 references

Q5732060

0 references

Q5594858

0 references

full work available at URL

https://doi.org/10.1016/s0377-0427(99)00105-3

0 references

Identifiers

zbMATH Open document ID

0940.65046

0 references

DOI

10.1016/S0377-0427(99)00105-3

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1300719

@@ Property / reviewed by @@
+Matthew X. He
@@ Property / reviewed by: Matthew X. He / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+On types of convergence and on the behavior of approximations in the neighborhood of a multiple root of an equation
+Normal rank
@@ Property / cites work @@
+A class of Iteration functions for improving, simultaneously, approximations to the zeros of a polynomial
+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 @@
+Accelerated Convergence in Newton’s Method
@@ Property / cites work: Accelerated Convergence in Newton’s Method / rank @@
+Normal rank
@@ Property / cites work @@
+Relationships between order and efficiency of a class of methods for multiple zeros of polynomials
+Normal rank
@@ Property / cites work @@
+Q5672080
@@ Property / cites work: Q5672080 / rank @@
+Normal rank
@@ Property / cites work @@
+High order iterative methods for approximating square roots
+Normal rank
@@ Property / cites work @@
+A basic family of iteration functions for polynomial root finding and its characterizations
+Normal rank
@@ Property / cites work @@
+Über eine Verallgemeinerung des Newtonschen Näherungsverfahrens
+Normal rank
@@ Property / cites work @@
+Computational complexity. On the geometry of polynomials and a theory of cost. I
+Normal rank
@@ Property / cites work @@
+Q5732060
@@ Property / cites work: Q5732060 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5594858
@@ Property / cites work: Q5594858 / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0377-0427(99)00105-3
+Normal rank
@@ Property / OpenAlex ID @@
+W2002195613
@@ Property / OpenAlex ID: W2002195613 / rank @@
+Normal rank