全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

New Eighth-Order Derivative-Free Methods for Solving Nonlinear Equations

DOI: 10.1155/2012/493456

Full-Text   Cite this paper   Add to My Lib

Abstract:

A new family of eighth-order derivative-free methods for solving nonlinear equations is presented. It is proved that these methods have the convergence order of eight. These new methods are derivative-free and only use four evaluations of the function per iteration. In fact, we have obtained the optimal order of convergence which supports the Kung and Traub conjecture. Kung and Traub conjectured that the multipoint iteration methods, without memory based on n evaluations could achieve optimal convergence order of . Thus, we present new derivative-free methods which agree with Kung and Traub conjecture for . Numerical comparisons are made to demonstrate the performance of the methods presented. 1. Introduction In this paper, we present a new family of the eighth-order methods to find a simple root of the nonlinear equation: where is a scalar function on an open interval and it is sufficiently smooth in a neighbourhood of . It is well known that the techniques to solve nonlinear equations have many applications in science and engineering. We will compare our new methods with well-known methods, namely, the classical Steffensen method for its simplicity [1, 2] and recently introduced eighth-order methods [3–5]. The eighth-order methods presented in this paper are derivative-free and only use four evaluations of the function per iteration. In fact, we have obtained the optimal order of convergence which supports the Kung and Traub conjecture. Kung and Traub conjectured that the multipoint iteration methods, without memory based on n evaluations, could achieve optimal convergence order . Thus, we present new derivative-free methods which agree with the Kung and Traub conjecture for . In addition, these new eighth-order derivative-free methods have an equivalent efficiency index to the established eighth-order derivative based methods presented in [3–5]. Furthermore, the new eighth-order derivative-free methods have a better efficiency index than the sixth-order derivative-free methods presented recently in [6, 7] and in view of this fact, the new methods are significantly better when compared with the established methods. Consequently, we have found that the new eighth-order derivative-free methods are consistent, stable, and convergent. This paper is organised as follows. In Section 2, we describe the eighth-order methods that are free from derivatives and prove the important fact that the methods obtained preserve their convergence order. In Section 3, we will briefly state the established methods in order to compare the effectiveness of the new methods.

References

[1]  S. D. Conte and C. de Boor, Elementary Numerical Analysis: An Algorithmic Approach, McGraw-Hill Book, New York, NY, USA, 1981.
[2]  J. F. Steffensen, “Remark on iteration,” Skandinavisk Aktuarietidskrift, vol. 16, pp. 64–72, 1933.
[3]  W. Bi, H. Ren, and Q. Wu, “A new family of eighth-order iterative methods for solving nonlinear equations,” Applied Mathematics and Computation, vol. 214, no. 1, pp. 236–245, 2009.
[4]  J. R. Sharma and R. Sharma, “A new family of modified Ostrowski's methods with accelerated eighth order convergence,” Numerical Algorithms, vol. 54, no. 4, pp. 445–458, 2010.
[5]  R. Thukral, “A new eighth-order iterative method for solving nonlinear equations,” Applied Mathematics and Computation, vol. 217, no. 1, pp. 222–229, 2010.
[6]  A. Cordero, J. L. Hueso, E. Martinez, and J. R. Torregrosa, “Steffensen type methods for solving nonlinear equations,” Applied Mathematics and Computation, vol. 194, no. 2, pp. 527–533, 2007.
[7]  S. K. Khattri and I. K. Argyros, “Sixth order derivative free family of iterative methods,” Applied Mathematics and Computation, vol. 217, no. 12, pp. 5500–5507, 2011.
[8]  S. Weerakoon and T. G. I. Fernando, “A variant of Newton's method with accelerated third-order convergence,” Applied Mathematics Letters, vol. 13, no. 8, pp. 87–93, 2000.
[9]  W. Gautschi, Numerical Analysis: An Introduction, Birkh?user, Boston, Mass, USA, 1997.
[10]  J. F. Traub, Iterative Methods for Solution of Equations, Chelsea Publishing, New York, NY, USA, 1977.
[11]  H. T. Kung and J. F. Traub, “Optimal order of one-point and multipoint iteration,” Journal of the Association for Computing Machinery, vol. 21, pp. 643–651, 1974.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133