On rediscovered iteration methods for solving equations

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

Cites work

A basic family of iteration functions for polynomial root finding and its characterizations
A class of Iteration functions for improving, simultaneously, approximations to the zeros of a polynomial
Accelerated Convergence in Newton’s Method
Accelerated Convergence in Newton’s Method
Computational complexity. On the geometry of polynomials and a theory of cost. I
High order iterative methods for approximating square roots
scientific article; zbMATH DE number 3315684 (Why is no real title available?)
scientific article; zbMATH DE number 3407053 (Why is no real title available?)
scientific article; zbMATH DE number 3195683 (Why is no real title available?)
On types of convergence and on the behavior of approximations in the neighborhood of a multiple root of an equation
Relationships between order and efficiency of a class of methods for multiple zeros of polynomials
Über eine Verallgemeinerung des Newtonschen Näherungsverfahrens

Cited in

(20)

Iterative methods based on the signum function approach for solving nonlinear equations
Comments on some recent methods for the simultaneous determination of polynomial zeros
A note on determinantal representation of a Schröder-König-like simultaneous method for finding polynomial zeros
Dynamic study of Schröder's families of first and second kind
Polynomial and rational approximations and the link between Schröder's processes of the first and second kind
On the rediscovery of Halley's iterative method for computing the zero of an analytic function
Fixed point and Newton's methods in the complex plane
Schröder's processes and the best ways of increasing order of Newton's method
A non-iterative method for solving non-linear equations
On Schröder's families of root-finding methods
Means based modifications of Newton's method for solving nonlinear equations
An iteration method with maximal order based on standard information
Computer tools for the construction and analysis of some efficient root-finding simultaneous methods
The link on extraneous non-repelling cycles of Schröder's methods of the first and second kind
Newton's method's basins of attraction revisited
On an application of symbolic computation and computer graphics to root-finders: the case of multiple roots of unknown multiplicity
A note on some recent methods for solving nonlinear equations
New simultaneous root-finding methods with accelerated convergence for analytic functions
On a family of symmetric polynomials
Accelerating generators of iterative methods for finding multiple roots of nonlinear equations

This page was built for publication: On rediscovered iteration methods for solving equations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1300719)