×

The link on extraneous non-repelling cycles of Schröder’s methods of the first and second kind. (English) Zbl 1537.37053

Summary: 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 \geq 2)\), respectively. Based on unrefined algebra characterizations of \(S_{f, n}\) and \(K_{f, n}\), we obtain some sufficient conditions on \(f\) such that both \(S_{f, n}\) and \(K_{f, n}\) possess given finite pairs of extraneous non-repelling cycles. Here, these conditions are a pair of equations, which have infinitely many polynomials or transcendental entire functions as its solutions. For obtaining some solutions \(f\) of such equations, we provide a step-by-step method. We start from any solution \(g\) in corresponding equations so that the function \(S_{g, 2}\) possesses the above finite pairs of extraneous cycles but all are super-attracting, and then \(f\) can be obtained by a series of formulas concerning the function \(g\), points and multipliers of those cycles. Note that \(S_{f, 2} = K_{f, 2}\) is identical with Newton’s method for \(f\). In a sense, this fact reveals that some extraneous super-attracting cycles of Newton’s method imply certain extraneous non-repelling cycles of any method from the two families of methods. More generally, for any given orders \(n\) and \(m\), some extraneous non-repelling cycles of \(S_{f, n}\) or \(K_{f, n}\) imply that of \(S_{F, m}\) or \(K_{F, m}\) for some entire functions \(f\) and \(F\). These give a partial answer for the problem of finding possible link between the two families of methods, which was posed by S. Smale [private communication] in 1994.

MSC:

37F10 Dynamics of complex polynomials, rational maps, entire and meromorphic functions; Fatou and Julia sets
37F20 Combinatorics and topology in relation with holomorphic dynamical systems
37F15 Expanding holomorphic maps; hyperbolicity; structural stability of holomorphic dynamical systems
Full Text: DOI

References:

[1] Argyropoulos, N.; Böhm, A.; Drakopoulos, V., Julia and Madelbrot-like sets for higher order König rational iteration functions, (Novak, M. M.; Dewey, T. G., Fractal Frontiers (1997), World Scientific: World Scientific Singapore) · Zbl 1025.37503
[2] Beardon, A. F., Iteration of Rational Functions (1991), Springer: Springer Berlin · Zbl 0742.30002
[3] Buff, X.; Hendriksen, C., On König’s root-finding algorithms, Nonlinearity, 16, 989-1015 (2003) · Zbl 1030.37030
[4] Campbell, J. T.; Collins, J. T., Specifying attracting cycles for Newton maps of polynomials, J. Differ. Equ. Appl., 19, 8, 1361-1379 (2013) · Zbl 1283.30060
[5] Carleson, L.; Gamelin, T. W., Complex Dynamics (1991), Springer: Springer Berlin
[6] Collins, J. T., Constructing attracting cycles for Halley and Schröder maps of polynomials, Discrete Contin. Dyn., 37, 10, 5455-5465 (2017) · Zbl 1379.30015
[7] Drakopoulos, V., On the additional fixed points of Schröder iteration functions associated with a one-parameter family of cubic polynomials, Comput. Graph., 22, 5, 629-634 (1998)
[8] Drakopoulos, V., How is the dynamics of König iteration functions affected by their additional fixed points?, Fractals, 7, 327-334 (1999) · Zbl 1020.37025
[9] Drakopoulos, V., Schröder iteration functions associated with a one-parameter family of biquadratic polynomials, Chaos Solitons Fractals, 13, 233-243 (2002) · Zbl 0986.37032
[10] Drakopoulos, V.; Argyropoulos, N.; Böhm, A., Generalized computation of Schröder iteration functions to motivate families of Julia and Mandelbrot-like sets, SIAM J. Numer. Anal., 36, 417-435 (1999) · Zbl 0928.30011
[11] Dubeau, F., Polynomial and rational approximations and the link between Schröder’s processes of the first and second kind, Abstr. Appl. Anal., ID, Article 719846 pp. (2014) · Zbl 1474.65138
[12] Gutiérrez, J. M.; Varona, J. L., Superattracting extraneous fixed points and n-cycles for Chebyshev’s method on cubic polynomials, Qual. Theory Dyn. Syst., 19, Article 54 pp. (2020) · Zbl 1440.37053
[13] Honorato, G., Dynamics and limiting behavior of Julia set of König’s method for multiple roots, Topol. Appl., 233, 16-32 (2018) · Zbl 1378.65101
[14] Kalantari, B., On extraneous fixed-points of the basic family of iteration functions, BIT Numer. Math., 43, 453-458 (2003) · Zbl 1037.65047
[15] Kalantari, B., Polynomial Root-Finding and Polynomiography (2009), World Scientific: World Scientific New Jersey · Zbl 1218.37003
[16] Kalantari, B.; Kalantari, I.; Zaare-Nahandi, R., A basic family of iteration functions for polynomial root finding and its characterizations, J. Comput. Appl. Math., 80, 2, 209-226 (1997) · Zbl 0874.65037
[17] König, J., Über eine Eigenschaft der Potenzreihen, Math. Anal., 23, 447-449 (1884) · JFM 16.0202.01
[18] Liu, G.; Ponnusamy, S., Prescribed cycles of König’s method for polynomials, J. Comput. Appl. Math., 336, 468-476 (2018) · Zbl 1382.37045
[19] Liu, G.; Ponnusamy, S., Finite pairs of prescribed cycles of König’s and Steffensen’s methods for entire functions, J. Comput. Appl. Math., 368, Article 112549 pp. (2020) · Zbl 1437.37055
[20] McMullen, C. T., Families of rational maps and iterative root-finding algorithms, Ann. Math., 125, 467-493 (1987) · Zbl 0634.30028
[21] McMullen, C. T., The Mandelbrot set is universal, (Lei, Tan, The Mandelbrot Set, Theme and Variations (2000), Cambridge University Press: Cambridge University Press Cambridge), 1-18 · Zbl 1062.37042
[22] Milnor, J., Dynamics in One Complex Variable (2006), Princeton University Press: Princeton University Press Princeton and Oxford · Zbl 1085.30002
[23] Petković, M. S.; Herceg, D., On rediscovered iteration methods for solving equations, J. Comput. Appl. Math., 107, 275-284 (1999) · Zbl 0940.65046
[24] Petković, M. S.; Petković, L. D., Dynamic study of Schröder’s families of first and second kind, Numer. Algorithms, 78, 847-865 (2018) · Zbl 1391.65141
[25] Petković, M. S.; Petković, L. D.; Herceg, D., On Schröder’s families of root-finding methods, J. Comput. Appl. Math., 233, 8, 1755-1762 (2010) · Zbl 1184.65052
[26] Plaza, S.; Vergara, V., Existence of attracting cycles for Newton’s method, Scientia, Ser. A, Math. Sci., 7, 31-36 (2001) · Zbl 1137.37317
[27] Schröder, E., Über unendlich viele Algorithmen zur Auflösung der Gleichungen, Math. Ann., 2, 317-365 (1870) · JFM 02.0042.02
[28] Suzuki, T.; Sugiura, H.; Hasegawa, T., Estimating convergence regions of Schröder’s iteration formula: how the Julia set shrinks to the Voronoi boundary, Numer. Algorithms, 82, 183-199 (2019) · Zbl 1420.65065
[29] Suzuki, T.; Sugiura, H.; Hasegawa, T., Regions of convergence and dynamics of Schröder-like iteration formulae as applied to complex polynomial equations with multiple roots, Numer. Algorithms, 85, 133-144 (2020) · Zbl 1450.65043
[30] G.W. Stewart, On infinitely many algorithms for solving equations, fttp://thales.cs.umd.edu/pub/reports/imase.ps.
[31] Traub, J. F., Iterative Methods for the Solution of Equations (1964), Prentice-Hall: Prentice-Hall Englewood Cliffs, New Jersey · Zbl 0121.11204
[32] Vrscay, E. R., Julia sets and Mandelbrot-like sets as associated with higher order Schröder rational iteration functions: a computer assisted study, Math. Comput., 46, 151-169 (1986) · Zbl 0597.58013
[33] Vrscay, E. R.; Gilbert, W. J., Extraneous fixed points, basin boundaries and chaotic dynamics for Schröder and König rational functions, Numer. Math., 52, 1-16 (1988) · Zbl 0612.30025
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.