Superattracting Extraneous Fixed Points and n-cycles for Chebyshev’s Method on Cubic Polynomials

• Gutiérrez, José M ^[1] ; Varona, Juan L ^[1]
  1. [1] Universidad de La Rioja

     Universidad de La Rioja

     Logroño, España

     
• Localización: Qualitative theory of dynamical systems, ISSN 1575-5460, Vol. 19, Nº 2, 2020
• Idioma: inglés
• DOI: 10.1007/s12346-020-00390-5
• Enlaces
  • Texto completo
• Resumen

  • In this work we provide analytic and graphic arguments to explain the behaviour of Chebyshev’s method applied to cubic polynomials in the complex plane. In particular, we study the parameter plane related to this method and we compare it with other previously known, such as Newton’s or Halley’s methods. Our specific interest is to characterize “bad” polynomials for which Chebyshev’s method presents convergence to points distinct from the roots (i.e. the root-finding algorithm fails). In particular, we prove the existence of polynomials for which Chebyshev’s method has superattracting n-cycles and the existence of polynomials for which Chebyshev’s method has superattracting extraneous fixed points. The first fact is shared with other root-finding methods, such as Newton’s or Halley’s, but the second one is an established dynamic feature of Chebyshev’s method. Here we go depth on the study of the dynamics related to the superattracting n-cycles of Chebyshev’s method and its relationships with the superattracting extraneous fixed points, providing some analytical and geometric arguments to explain the related parameter plane. In particular, we prove the existence of a sequence of parameters for which the corresponding Chebyshev’s iterative method has a superattracting n-cycle.

• Referencias bibliográficas
  • 1. Amat, S., Busquier, S., Plaza, S.: Review of some iterative root-finding methods from a dynamical point of view. SCIENTIA Ser. A Math....
  • 2. Argyros, I.K., Hilout, S.: Computational Methods in Nonlinear Analysis: Efficient Algorithms. Fixed Point Theory and Applications. World...
  • 3. Beardon, A.F.: Iteration of Rational Functions. Springer, New York (1991)
  • 4. Blanchard, P., Cuzzocreo, D., Devaney, R.L., Fitzgibbon, E.: Accessible Mandelbrot sets in the family zn + λ/zn. Qual. Theory Dyn....
  • 5. Cordero, A., Torregrosa, J.R., Vindel, P.: Bulbs of period two in the family of Chebyshev-Halley iterative methods on quadratic polynomials....
  • 6. Cordero, A., Torregrosa, J.R., Vindel, P.: Dynamics of a family of Chebyshev–Halley type methods. Appl. Math. Comput. 219(16), 8568–8583...
  • 7. Curry, J.H., Garnett, L., Sullivan, D.: On the iteration of a rational function: computer experiments with Newton’s method. Commun. Math....
  • 8. Diloné, M.A., García-Olivo, M., Gutiérrez, J.M.: A note on the semilocal convergence of Chebyshev’s method. Bull. Aust. Math. Soc. 88(1),...
  • 9. García-Olivo, M., Gutiérrez, J.M., Magreñán, Á.A.: A complex dynamical approach of Chebyshev’s method. SeMA J. 71(1), 57–68 (2015)
  • 10. Gutiérrez, J.M.: The Cayley problem and the Chebyshev method. Gac. R. Soc. Math. Espanola 19(3), 542 (2016). (Spanish)
  • 11. Kneisl, K.: Julia sets for the super-Newton method, Cauchy’s method and Halley’s method. Chaos 11(2), 359–370 (2001)
  • 12. Lyubich, MYu.: The dynamics of rational transforms: the topological picture. Rus. Math. Surv. 41(4), 43–117 (1986)
  • 13. McMullen, C.: Families of rational maps and iterative root-finding algorithms. Ann. Math. (2) 125(3), 467–493 (1987)
  • 14. McMullen, C.: The Mandelbrot set is universal. In: The Mandelbrot Set, Theme and Variations. London Mathematical Society Lecture Note...
  • 15. Milnor, J.: Dynamics in One Complex Variable, 3rd edn. Annals of Mathematics Studies, vol. 160. Princeton University Press, Princeton...
  • 16. Roberts, G.E., Horgan-Kobelski, J.: Newton’s versus Halley’s methods: a dynamical systems approach. Int. J. Bifurc. Chaos Appl. Sci. Engrg....
  • 17. Smale, S.: On the efficiency of algorithms of analysis. Bull. Am. Math. Soc. (N.S.) 13(2), 87–121 (1985)
  • 18. Varona, J.L.: Graphic and numerical comparison between iterative methods. Math. Intell. 24(1), 37–46 (2002)
  • 19. Vrscay, E.R.: Julia sets and Mandelbrot-like sets associated with higher order Schröder rational iteration functions: a computer assisted...
  • 20. Vrscay, E.R., Gilbert, W.J.: Extraneous fixed points, basin boundaries and chaotic dynamics for Schröder and König rational iteration...
  • 21. Walsh, J.: The dynamics of Newton’s method for cubic polynomials. Coll. Math. J. 26(1), 22–28 (1995)