๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

New eighth-order iterative methods for solving nonlinear equations

โœ Scribed by Xia Wang; Liping Liu


Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
310 KB
Volume
234
Category
Article
ISSN
0377-0427

No coin nor oath required. For personal study only.

โœฆ Synopsis


a b s t r a c t

In this paper, three new families of eighth-order iterative methods for solving simple roots of nonlinear equations are developed by using weight function methods. Per iteration these iterative methods require three evaluations of the function and one evaluation of the first derivative. This implies that the efficiency index of the developed methods is 1.682, which is optimal according to Kung and Traub's conjecture for four function evaluations per iteration. Notice that Bi et al.'s method in [2] and [3] are special cases of the developed families of methods. In this study, several new examples of eighth-order methods with efficiency index 1.682 are provided after the development of each family of methods. Numerical comparisons are made with several other existing methods to show the performance of the presented methods.


๐Ÿ“œ SIMILAR VOLUMES


Three-step iterative methods with eighth
โœ Weihong Bi; Hongmin Ren; Qingbiao Wu ๐Ÿ“‚ Article ๐Ÿ“… 2009 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 516 KB

A family of eighth-order iterative methods for the solution of nonlinear equations is presented. The new family of eighth-order methods is based on King's fourth-order methods and the family of sixth-order iteration methods developed by Chun et al. Per iteration the new methods require three evaluat

New high-order convergence iteration met
โœ Xinyuan Wu; Dongsheng Fu ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 341 KB

A family of new iteration methods without employing derivatives is proposed in this paper. We have proved that these new methods are quadratic convergence. Their efficiency is demonstrated by numerical experiments. The numerical experiments show that our algorithms are comparable to well-known metho

Alternative convergence criteria for ite
โœ Hamilton A. Chase ๐Ÿ“‚ Article ๐Ÿ“… 1984 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 877 KB

x,,, -J, m = 1, 2, 3 . . be an iteration method for solving the nonlinear problem F(X) = 0, where F(X) and its derivatives possess all of the properties required by T(x,,,). Then ifit can be established thatfor the problem at hand jlF(~,+ 1)i/ < &,, llF(x& V m > M,, (M, < co) and 0 < &,, < 1, dejini

An iterative method for solving nonlinea
โœ J.W Neuberger ๐Ÿ“‚ Article ๐Ÿ“… 1976 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 904 KB

TO THE MEMORY OF PASQUALE PORCELLI A successive approximation process for a class of nth order nonlinear partial differential equations on EV,, is given. Analytic solutions are found by iteration. The pairing between initial estimates and limiting functions forms a basis for the study of boundary co