Comparing the geometry of the basins of attraction, the speed and the efficiency of several numerical methods (Q1794682)

The authors consider simple equations in order to compare the basins of attraction on the complex plane, corresponding to a large collection of the following numerical methods: 1. The Newton-Raphson optimal method of second order; 2. The Halley method of third order; 3. The Chebyshev method of third order; 4. The super Halley method of fourth order; 5. The modified super Halley optimal method of fourth order; 6. The King method of fourth order; 7. The Jarratt method of fourth order; 8. The Kung-Traub optimal method of fourth order; 9. The Maheshwari optimal method of fourth order; 10. The Murakami method of fifth order; 11. The Neta method of sixth order; 12. The Chun-Neta method of sixth order; 13. The Neta-Johnson method of eighth order; 14. The Neta-Petkovic optimal method of eighth order; 15. The Neta method of fourteenth order; 16. The Neta method of sixteenth order. Two cases are considered, regarding the total number of the roots, which act as numerical attractors. For both cases the authors use the iterative schemes for performing a thorough and systematic classification of the nodes on the complex plane. The distributions of the required iterations as well as the probability and their correlations with the corresponding basins of convergence are also discussed. In the conclusions of each section, the user of such numerical analysis algorithms can find interesting conclusions revealing their inherent structure. The general conclusion is that, as the number of the roots (numerical attractors) increases, the geometry of the complex plane becomes more complicated, which leads to the following phenomena: (i) the amount of ill-behaved initial conditions increases, (ii) the required number of iterations increases, (iii) the degree of fractality, expressed through the basin entropy, increases. The graphical illustration has been created using CAS Mathematica.