Schröder iteration functions associated with a one-parameter family of biquadratic polynomials (Q5950947)

The author shows an extension of results by \textit{D. C. Arney} and \textit{B. T. Robinson} [Comput. Math. Appl. 19, No. 3, 1-11 (1989; Zbl 0728.68131)] and by \textit{V. Drakopoulos}, \textit{N. Argyropoulos} and \textit{A. Böhm} [SIAM J. Numer. Anal. 36, No. 2, 417-435 (1998; Zbl 0928.30011)]. Schröder iteration functions, a generalization of the Newton-Raphson method to determine roots of equations, are generally rational functions which posses some critical points free to converge to attracting cycles. These free critical points, however, satisfy some higher-degree polynomial equations. The author presented in the cited paper a new algorithmic construction to compute in general all of the Schröder functions' terms as well as to maximize the computational efficiency of these functions associated with a one-parameter family of cubic polynomials. First, all of the observations in the paper by \textit{Arney} and \textit{Robinson} (loc. cit.) are extended to Schröder iteration functions by examining the Julia sets of these functions as applied to the particular one-parameter family of quartic polynomials. Second, by means of the methods in the author's former paper, the dynamics of Schröder maps, associated with the one-parameter family, is examined by solving some polynomial equations to find all of the critical points of these maps. Finally, all the types of behaviour of theses points are observed by projecting the parameter space of Schröder iteration functions.