Study of iterative methods through the Cayley Quadratic Test

• D.K.R. Babajee ^[2] ; A. Cordero ^[1] ; J.R. Torregrosa ^[1]
  1. [1] Universidad Politécnica de Valencia

     Universidad Politécnica de Valencia

     Valencia, España

     
  2. [2] Allied Network for Policy Research, Mauritius
• Localización: Journal of computational and applied mathematics, ISSN 0377-0427, Vol. 291, Nº 1 (1 January 2016), 2016, págs. 358-369
• Idioma: inglés
• DOI: 10.1016/j.cam.2014.09.020
• Enlaces
  • Texto completo
• Resumen

  • Many iterative methods for solving nonlinear equations have been developed recently. The main advantage claimed by their authors is the improvement of the order of convergence. In this work, we compare their dynamical behavior on quadratic polynomials with the one of Newton’s scheme. This comparison is defined in what we call Cayley Quadratic Test (CQT) which can be used as a first test to check the efficiency of such methods. Moreover we make a brief insight in cubic polynomials.