Schröder iteration functions
S
m
(
z
)
{S_m}(z)
, a generalization of Newton’s method (for which
m
=
2
m = 2
), are constructed so that the sequence
z
n
+
1
=
S
m
(
z
n
)
{z_{n + 1}} = {S_m}({z_n})
converges locally to a root
z
∗
{z^\ast }
of
g
(
z
)
=
0
g(z) = 0
as
O
(
|
z
n
−
z
∗
|
m
)
O(|{z_n} - {z^\ast }{|^m})
. For
g
(
z
)
g(z)
a polynomial, this involves the iteration of rational functions over the complex Riemann sphere, which is described by the classical theory of Julia and Fatou and subsequent developments. The Julia sets for the
S
m
(
z
)
{S_m}(z)
, as applied to the simple cases
g
n
(
z
)
=
z
n
−
1
{g_n}(z) = {z^n} - 1
, are examined for increasing m with the help of microcomputer plots. The possible types of behavior of
z
n
{z_n}
iteration sequences are catalogued by examining the orbits of free critical points of the
S
m
(
z
)
{S_m}(z)
, as applied to a one-parameter family of cubic polynomials.