From a dynamical point of view applied to complex polynomials, we study a number of root–
finding iterative methods. We consider Newton's method, Newton's method for multiple roots …

This book offers fascinating and modern perspectives into the theory and practice of the
historical subject of polynomial root-finding, rejuvenating the field via polynomiography, a …

The purpose of this article is to present results that amount to a description of the conjugacy
classes of two fourth-order root-finding iterative methods, namely King's family of iterative …

The purpose of this article is to present results that amount to a description of the conjugacy
classes of three third-order root-finding iterative methods that do not require the use of …

Schröder's formula of the second kind of order m of convergence (S2-m formula) is a
generalization of Newton's (m= 2) and Halley's (m= 3) iterative formulae for finding zeros of …

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 …

Schröder iteration functions are a generalization of Newton–Raphson's method to determine
roots of equations. These higher-degree rational functions, however, possess additional …

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 …

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 …