Abstract
In this paper we revisit Popovski’s family of methods for simple roots. We compare several members using basins of attraction visually and qualitatively by comparing the run-time on several examples, the average number of iterations and the number of divergent points. We chose 5 different members of the family. We also develop an equivalent family of methods for multiple roots and compare several members on six different numerical examples.
Publisher
Academia Romana Filiala Cluj
Reference20 articles.
1. J. F. Traub, Iterative methods for the solution of equations, Prentice-Hall, Englewood Cliffs, 1964.
2. M. Petkovic, B. Neta, L. Petkovic, J. Dzunic, Multipoint Methods for Solving Nonlinear Equations. Academic Press, Boston, 2013 https://doi.org/10.1016/j.amc.2013.10.072
3. D. B. Popovski, A family of one point iteration formulae for finding roots, Int. J.Comput. Math. 8 (1980), 85-88. https://doi.org/10.1080/00207168008803193
4. E. Halley, A new, exact and easy method of finding the roots of equations generally and that without any previous reduction, Phil. Trans. Roy. Soc. London 18 (1694) 136-148.http://dx.doi.org/10.1098/rstl.1694.0029
5. A. Cauchy, Sur la Determination Approximative des Racines d’une Equation Algebrique ou Transcendante, Oeuvres Completes Serie 2, Tome 4, Gauthier Villars, Paris, 1899, pp. 573-609.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献