A cubically convergent class of root finding iterative methods
African Journal of Mathematics and Computer Science Research · 2014
DOI: 10.5897/ajmcsr12.036 ↗Kurz gefasst
Fachartikel in der Zeitschrift African Journal of Mathematics and Computer Science Research, 2014. Verfasst von N. Rezaei A. und 1 weiteren Autor:innen. Die Arbeit nennt 18 Literaturangaben.
Abstract (Originalsprache)
In this paper, we propose a new two-parameter class of iterative methods to solve a nonlinear equation. It is proved that any method in this class is cubically convergent if and only if the parameters sum up to one. Some of the existing third-order methods, by suitable selection of parameters, can be put in this class. Every iteration of the class requires an evaluation of the function, three of the first derivative, and none of the second derivative. Hence, its efficiency index is 31/4 = 1.316 that is worse than all other cubically convergent methods considered. However, numerical experiments show that a special method in our class is comparable to those in terms of iterations number. Key words: Nonlinear equations, root finding, iterative method, third-order convergence.
Zitieren
APA
A., N. R., & H., E. (2014). A cubically convergent class of root finding iterative methods. African Journal of Mathematics and Computer Science Research. https://doi.org/10.5897/ajmcsr12.036
Vancouver
A. NR, H. E. A cubically convergent class of root finding iterative methods. African Journal of Mathematics and Computer Science Research. 2014. doi:10.5897/ajmcsr12.036
BibTeX
@article{A2014,
author = {A., N. Rezaei and H., Esmaeili},
title = {A cubically convergent class of root finding iterative methods},
journal = {African Journal of Mathematics and Computer Science Research},
year = {2014},
doi = {10.5897/ajmcsr12.036}
}
EUVIMED