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 converge to attracting cycles. These free critical points, however, satisfy some higher-degree polynomial equations. We present 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. Finally, we examine the Julia sets of the Schröder functions constructed to converge to the nth roots of unity, these roots' basins of attraction, and the orbits of all free critical points of these functions for order higher than four, as applied to the one-parameter family of cubic polynomials mentioned above. Introduction.A number of mathematical applications lead to the problem of finding the roots of some equation using iterative methods. Unfortunately, the convergence of an iterative method is not assured independently of the starting value. There exist certain starting values that are not suitable in yielding the desired result. Looking at the set of all the starting values from a geometrical point of view will definitely help us to choose these initial approximations to a root and compare the convergence properties of various iterative methods.Ernst Schröder [12] in 1870 (see also [7]) described a method of finding a rational iterating function of any desired "order of convergence" to determine roots of equations. For polynomial equations this involves the iteration of rational functions over the Riemann sphere which is described by the classical theory of Julia [9] and Fatou [6] and its subsequent developments, also of paramount importance in the context of numerical analysis. In what follows we abbreviate as f k the k-fold composition f • f • · · · • f , by region we mean a connected open set on the extended complex plane C = C ∪ {∞}, and if we have a rational function of the form R = P/Q, where P and Q are complex polynomials with no common factors, the degree of R is defined by deg(R) = max{deg(P ), deg(Q)}.It appears that, for cases of practical interest, convergence of the sequence of iterates
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.