An Improvement of Ostrowski’s and King’s Techniques with Optimal Convergence Order Eight
- 244 Downloads
In this paper, we first establish a new class of three-point methods based on the two-point optimal method of Ostrowski. Analysis of convergence shows that any method of our class arrives at eighth order of convergence by using three evaluations of the function and one evaluation of the first derivative per iteration. Thus, this order agrees with the conjecture of Kung and Traub (J. ACM 643–651, 1974) for constructing multipoint optimal iterations without memory. We second present another optimal eighth-order class based on the King’s fourth-order family and the first attained class. To support the underlying theory developed in this work, we examine some methods of the proposed classes by comparison with some of the existing optimal eighth-order methods in literature. Numerical experience suggests that the new classes would be valuable alternatives for solving nonlinear equations.
KeywordsSimple root Three-step iterative methods Derivative-involved methods Optimal convergence rate Weight function
Unable to display preview. Download preview PDF.
- 2.Iliev, A., Kyurkchiev, N.: Nontrivial Methods in Numerical Analysis: Selected Topics in Numerical Analysis. LAP Lambert Academic, Saarbrücker (2006) Google Scholar
- 4.Kung, H.T., Traub, J.F.: Optimal order of one-point and multipoint iteration. J. ACM 643–651 (1974) Google Scholar
- 10.Soleymani, F., Sharifi, M.: On a general efficient class of four-step root-finding methods. Int. J. Math. Comput. Simul. 5, 181–189 (2011) Google Scholar