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
• 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.