Lee, Mi Young; Chun, Changbum Attracting periodic cycles for an optimal fourth-order nonlinear solver. (English) Zbl 1237.65072 Abstr. Appl. Anal. 2012, Article ID 263893, 8 p. (2012). Summary: We consider an optimal fourth-order method for solving nonlinear equations and construct polynomials such that the rational map arising from the method applied to these polynomials has an attracting periodic orbit of any prescribed period. Cited in 2 Documents MSC: 65L06 Multistep, Runge-Kutta and extrapolation methods for ordinary differential equations 34C05 Topological structure of integral curves, singular points, limit cycles of ordinary differential equations PDF BibTeX XML Cite \textit{M. Y. Lee} and \textit{C. Chun}, Abstr. Appl. Anal. 2012, Article ID 263893, 8 p. (2012; Zbl 1237.65072) Full Text: DOI References: [1] C. Chun, M. Y. Lee, B. Neta, and J. D, “On optimal fourth-order iterative methods free from second derivative and their dynamics,” Applied Mathematics and Computation, vol. 218, no. 11, pp. 6427-6438, 2012. · Zbl 1277.65031 [2] H. T. Kung and J. F. Traub, “Optimal order of one-point and multipoint iteration,” Journal of the Association for Computing Machinery, vol. 21, pp. 643-651, 1974. · Zbl 0289.65023 [3] S. Amat, S. Busquier, and S. Plaza, “A construction of attracting periodic orbits for some classical third-order iterative methods,” Journal of Computational and Applied Mathematics, vol. 189, no. 1-2, pp. 22-33, 2006. · Zbl 1113.65047 [4] J. Milnor, Dynamics in One Complex Variable, vol. 160 of Annals of Mathematics Studies, Princeton University Press, Princeton, NJ, USA, 3rd edition, 2006. · Zbl 1085.30002 [5] S. Amat, S. Busquier, and S. Plaza, “Iterative root-finding methods,” Unpublished Report, 2004. · Zbl 1137.37316 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. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.