In this paper, we first recall the definition of a family of root-finding algorithms known as
König's algorithms. We establish some local and some global properties of those algorithms …

Schröder iteration functions, a generalization of the Newton--Raphson method to determine
roots of equations, are generally rational functions which possess some critical points free to …

Let S f, n and K f, n be the functions defined in Schröder's method of the first and second kind
for an entire function f with given order n (n≥ 2), respectively. Based on unrefined algebra …

A well known result of J. Hubbard, D. Schleicher and S. Sutherland (see [27]) shows that if f
is a complex polynomial of degree d, then there is a finite set S d depending only on d such …

On the dynamics of the Euler iterative function - ScienceDirect Skip to main contentSkip to
article Elsevier logo Journals & Books Search RegisterSign in View PDF Download full issue …

König iteration functions are a generalization of Newton–Raphson method to determine
roots of equations. These higher-degree rational functions possess additional fixed points …

As is well known, the Julia set of Newton's method applied to complex polynomials is
connected. The family of König's root–finding algorithms is a natural generalization of …

CONJUGACIES CLASSES OF SOME NUMERICAL METHODS∗ Page 1 CONJUGACIES
CLASSES OF SOME NUMERICAL METHODS∗ SERGIO PLAZA Universidad de Santiago …

Schröder iteration functions, a generalization of the Newton–Raphson method to determine
roots of equations, are generally rational functions which possess some critical points, free …

For polynomials some of whose zeros are complex, little is known about the overall
convergence properties of the Laguerre's method. The existence of free critical points of the …