7.2
CiteScore
3.7
Impact Factor
Generic selectors
Exact matches only
Search in title
Search in content
Post Type Selectors
Search in posts
Search in pages
Filter by Categories
ABUNDANCE ESTIMATION IN AN ARID ENVIRONMENT
Case Study
Editorial
Invited review
Letter to the Editor
Original Article
REVIEW
Review Article
SHORT COMMUNICATION
7.2
CiteScore
3.7
Impact Factor
Generic selectors
Exact matches only
Search in title
Search in content
Post Type Selectors
Search in posts
Search in pages
Filter by Categories
ABUNDANCE ESTIMATION IN AN ARID ENVIRONMENT
Case Study
Editorial
Invited review
Letter to the Editor
Original Article
REVIEW
Review Article
SHORT COMMUNICATION
View/Download PDF

Translate this page into:

ORIGINAL ARTICLE
23 (
4
); 395-398
doi:
10.1016/j.jksus.2010.07.018

A new general fourth-order family of methods for finding simple roots of nonlinear equations

 Department of Nano Science, Kermanshah University of Technology, Kermanshah, Iran

*Address: Department of Mathematics, Faculty of Sciences, University of Guilan, P.C. 41938, Rasht, Iran b.ghanbary@yahoo.com (Behzad Ghanbari)

Received: , Accepted: ,
© The Author(s) 2010
Disclaimer:
This article was originally published by Elsevier and was migrated to Scientific Scholar after the change of Publisher.

Available online 21 July 2010

Peer-review under responsibility of King Saud University.

Abstract

In this paper, a new fourth-order family of methods free from second derivative is obtained. This new iterative family contains the King's family, which is one of the most well-known family of methods for solving nonlinear equations, and some other known methods as its particular case. To illustrate the efficiency and performance of proposed family, several numerical examples are presented. Numerical results illustrate better efficiency and performance of the presented methods in comparison with the other compared fourth-order methods. Due to that, they can be effectively used for solving nonlinear equations.

Keywords

Iterative methods
Simple-root of nonlinear equations
Newton's method
1

1 Introduction

In this paper, we propose an iterative methods to find a simple root a of a nonlinear equation f(x) = 0. i.e., f(a) = 0 and f′(a) ≠ 0.

Nonlinear equations arise in a wide variety of forms in all branches of science, engineering, and technology. In recent years, a large number of root-searching algorithms and methods of solutions of different orders are available in the literature. For example, we refer the readers to Babolian and Biazar (2002), Frontini and Sormani (2003), He (1998), Abbasbandy (2006), King (1973), Chun (2007), Ostrowski (1973), Chun (2008) and the references therein.

It is well-known that the Newton's method is the most widely used (second-order) method for solving such equations, giving by

(1)
x n + 1 = x n - f ( x n ) f ′ ( x n ) .

Our approach is based on the King's fourth-order defined by

(2)
x n + 1 = x n - f ( x n ) f ′ ( x n ) - f ( x n ) + ( α + 2 ) f ( y n ) f ( x n ) + α f ( y n ) f ( y n ) f ′ ( x n ) , where
(3)
y n = x n - f ( x n ) f ′ ( x n ) , (the notation of yn have used throughout).

This paper is organized as follows: In Section 2, we consider a general iterative scheme, analyze it to present a family of fourth-order methods then several known special cases of this family are listed. Section 3 is devoted to numerical comparisons between the results obtained in this work and some known iterative methods. Finally, conclusions are stated in the last section.

2

2 Development of method and convergence analysis

In this section to derive a fourth-order family of methods, motivated by King's family (2), we suggest and analyze the following iterative scheme:

(4)
x n + 1 = x n - f ( x n ) f ′ ( x n ) - Af ( x n )   2 + Bf ( y n ) f ( x n ) + Cf ( y n )   2 Df ( x n )   2 + Ef ( y n ) f ( x n ) + Ff ( y n )   2 f ( y n ) f ′ ( x n ) , where parameters A, B, C, D, E and F to be determined such that the iterative method defined by (4) has the order of convergence four. It can be obviously followed if the parameters are properly chosen as A = D = 1, C = F = 0, B = E + 2 then the iterative scheme (4), reduces to the King's family.

For the proposed family of methods (4) we have following analysis of convergence.

Theorem 1

Let a ∈ I be a simple root of a sufficiently differentiable function f : I → R on an open interval which contains x0 as a close initial approximation to a. In the case of A = B ≠ 0 and B = E + 2 A , the family of methods defined by (4), is of order four.

Proof

Using Taylor expansion of f(xn) about a and defining en = xn − a, we have

(5)
f ( x n ) = f ′ ( a ) e n + c 2 e n 2 + c 3 e n 3 + c 4 e n 4 + O ( e n 5 ) ,
(6)
f ′ ( x n ) = f ′ ( a ) 1 + 2 c 2 e n + 3 c 3 e n 2 + 4 c 4 e n 3 + O ( e n 4 ) , where ck = f(k)(a)/k!f′(a),k = 2,3,…

Substitution of (5) and (6) into (3), leads to

(7)
y n = a + c 2 e n 2 + 2 c 3 - c 2 2 e n 3 + - 7 c 2 c 3 + 4 c 2 3 + 3 c 4 e n 4 + O e n 5 . Besides, by Taylor's expansion, we have
(8)
f ( y n ) = f ′ ( a ) c 2 e n 2 + 2 c 3 - c 2 2 e n 3 + - 7 c 3 c 2 + 5 c 2 3 + 3 c 4 e n 4 + O e n 5 . Finally, using Eqs. (5)–(8) in (4) and some symbolic computational in Maple, we have x n + 1 = x n - e n + K 1 e n 2 + K 2 e n 3 + O e n 4 , where K 1 = - ( D - A ) c 2 D , K 2 = 2 D ( D - A ) c 3 + ( - 2 D 2 + 4 AD - BD + AE ) c 2 2 D 2 . It can be easily followed that, K1, K2 can be vanished, whenever A = D ≠ 0 and B = E + 2 A . □

Setting the parameters of A, B, C, D, E and F which satisfying the conditions of theorem in (4) then introducing α = E/A, θ = C/A and β = F/A leads to the following three-parameter family of fourth-order methods

(9)
x n + 1 = x n - f ( x n ) f ′ ( x n ) - f ( x n )   2 + ( 2 + α ) f ( y n ) f ( x n ) + θ f ( y n )   2 f ( x n )   2 + α f ( y n ) f ( x n ) + β f ( y n )   2 f ( y n ) f ′ ( x n ) , where y n = x n - f ( x n ) f ′ ( x n ) and α , β , θ ∈ R .

Family (9) contains some known fourth-order methods as particular cases, as follows:

  • Case 1:

    For θ = β = 0 and α ∈ R , we obtain the King's family of methods (1).

  • Case 2:

    For θ = β = 0, and α = −2, we obtain a fourth-order family of methods:

    (10)
    x n + 1 = x n - f ( y n ) - f ( x n ) 2 f ( y n ) - f ( x n ) f ( x n ) f ′ ( x n ) , which was obtained by Ostrowski (1973).

  • Case 3:

    For θ = 0, α = −2 and β = 2 β ′ ∈ R , we obtain following fourth-order family of methods: x n + 1 = x n - f ( x n ) f ′ ( x n ) - f ( x n )   2 f ( x n )   2 - 2 f ( x n ) f ( y n ) + 2 β ′ f ( y n )   2 f ( y n ) f ′ ( x n ) , and its two members with β = 1/2 and β = 1 x n + 1 = x n - f ( x n ) f ′ ( x n ) - f ( x n ) f ( x n ) - f ( y n ) 2 f ( y n ) f ′ ( x n ) , x n + 1 = x n - f ( x n ) f ′ ( x n ) - f ( x n )   2 f ( x n )   2 - 2 f ( x n ) f ( y n ) + 2 f ( y n )   2 f ( y n ) f ′ ( x n ) , respectively, which were introduced by Chun (2007).

  • Case 4:

    For α = −1/2, β = −1/4 and θ = 3/4, we obtain a fourth-order method: x n + 1 = x n - f ( x n ) f ′ ( x n ) - 4 f ( x n )   2 + 6 f ( y n ) f ( x n ) + 3 f ( y n )   2 4 f ( x n )   2 - 2 f ( y n ) f ( x n ) - f ( y n )   2 f ( y n ) f ′ ( x n ) , which was introduced by Chun (2008).

  • Case 5:

    For α = β = θ = 0, we obtain a fourth-order method

    (11)
    x n + 1 = x n - 1 + f ( y n ) f ( x n ) + 2 f ( y n )   2 f ( x n )   2 f ( x n ) f ′ ( x n ) , which was introduced by Chun (2008).

  • Case 6:

    For α = β = 0 and θ = 1, we obtain a fourth-order method:

    (12)
    x n + 1 = x n - 1 + f ( y n ) f ( x n ) + 2 f ( y n )   2 f ( x n )   2 + f ( y n )   3 f ( x n )   3 f ( x n ) f ′ ( x n ) , which was obtained by Chun (2008).

  • Case 7:

    For θ = β = 0 and α = −1, we obtain a fourth-order method: x n + 1 = x n - f ( x n )   2 + f ( y n )   2 f ′ ( x n ) ( f ( x n ) - f ( y n ) ) , which was obtained by Kou et al. (2007).

  • Case 8:

    For θ = β = 0 and α = −5/2,−3/2,−7/2, respectively, we have x n + 1 = x n - f ( x n ) f ′ ( x n ) - 2 f ( x n ) - f ( y n ) 2 f ( x n ) - 5 f ( x n ) f ( y n ) f ′ ( x n ) , x n + 1 = x n - f ( x n ) f ′ ( x n ) - 2 f ( x n ) + f ( y n ) 2 f ( x n ) - 3 f ( x n ) f ( y n ) f ′ ( x n ) , x n + 1 = x n - f ( x n ) f ′ ( x n ) - 2 f ( x n ) - 3 f ( y n ) 2 f ( x n ) - 7 f ( x n ) f ( y n ) f ′ ( x n ) , which were introduced by Chun and Ham (2008) (they are actually the special cases of the King's family).

Furthermore, family (9) introduces some new cases, as other its particular cases. For example:

In the Case of θ = 4, α = 2 and β = 1, we obtain the following fourth-order method

(13)
x n + 1 = x n - f ( x n ) f ′ ( x n ) - f ( x n ) + 2 f ( y n ) f ( x n ) + f ( y n ) 2 f ( y n ) f ′ ( x n ) . In the Case of α = −2, β = 1 and θ = −1, we obtain the following fourth-order method.
(14)
x n + 1 = x n - f ( x n ) f ′ ( x n ) - f ( x n ) + f ( y n ) f ( x n ) - f ( x n ) f ( y n ) f ′ ( x n ) . Obviously, the number of function evaluations per iteration required in the methods defined by (4) is three. We consider the definition of efficiency index (Grau and Diaz, 2006) as p r , where p is the order of the method and r is the number of function evaluations per iteration required by the method. We have that the family of methods defined by (4) has the efficiency index equal to 4 3 ≈ 1.5874 , which is much better than the 2 ≈ 1.4142 of Newton's method.

3

3 Numerical examples

In this section, some numerical test of some various root-finding methods as well as our new methods and Newton's method are presented. Compared methods were Newton's method (1) (NM), King’ method with β = 3 (KM), Chun’ method (11) (CM1) and another Chun’ method (12) (CM2) with the new presented methods by Eq. (13) (BGM1) and Eq. (14) (BGM2), introduced in this contribution. All computations were done using MAPLE with 128 digit floating point arithmetics (Digits = 128). Displayed in Table 1 are the number of iterations and functional evaluations required such that ∣f(xn)∣ < 10−15. The following functions (which are taken from Ostrowski, 1973; Chun, 2008; Kou et al., 2007), are used for the comparison and we display the approximate zeros x* found, up to the 28th decimal place. f 1 ( x ) = x 3 + 4 x 2 - 10 , x * = 1.3652300134140968457608068290 , f 2 ( x ) = x 2 - e x - 3 x + 2 , x * = 0.25753028543986076045536730494 f 3 ( x ) = xe x 2 - sin 2 ( x ) + 3 cos ( x ) + 5 , x * = - 1.2076478271309189270094167584 , f 4 ( x ) = sin ( x ) e x + ln ( x 2 + 1 ) , x * = 0 , f 5 ( x ) = ( x - 1 )   3 - 2 , x * = 2.2599210498948731647672106073 , f 6 ( x ) = ( x + 2 ) e x - 1 , x * = - 0.44285440100238858314132800000 , f 7 ( x ) = sin 2 ( x ) - x 2 + 1 , x * = 1.4044916482153412260350868178 . The results presented in Table 1 show that for the functions we tested, the new methods introduced in this contribution need reduce the number of iterations and needed functional evaluations show that this family can be competitive to the known fourth-order methods and Newton's method and converge more quickly than the other compared methods.

Table 1 Comparison of various fourth-order convergent iterative methods.
Number of iterations Number of function evaluations
NM KM CM1 CM2 BGM1 BGM2 NM KM CM1 CM2 BGM1 BGM2
f1, x0 = −0.3 55 49 25 25 8 7 110 147 75 75 24 21
f1, x0 = 1 6 4 4 4 3 3 12 12 12 12 9 9
f2, x0 = 0 5 3 3 3 2 2 10 9 9 9 6 6
f2, x0 = 1 5 3 3 3 3 3 10 9 9 9 9 9
f3, x0 = −1 6 5 5 3 3 4 12 15 15 9 12 9
f3, x0 = −2 9 5 5 6 6 5 18 15 18 18 15 15
f4, x0 = 2 6 5 5 5 4 4 12 12 15 15 12 12
f4, vx0 = −5 8 5 5 5 5 5 16 15 15 15 15 15
f5, x0 = 3 7 4 4 4 3 3 14 12 12 12 12 12
f5, x0 = 4 8 5 5 5 4 4 16 15 15 15 12 12
f6, x0 = 2 9 5 6 6 5 5 18 15 18 18 15 15
f6, x0 = 3.5 11 6 7 7 6 6 22 18 21 21 18 18
f7, x0 = 1 7 4 5 5 6 4 14 12 15 15 18 12
f7, x0 = 2 6 4 4 4 3 3 12 12 12 12 9 9

4

4 Conclusion

In this paper, we have constructed a new general fourth-order iterative family of methods for solving nonlinear equations with three parameters. This proposed iterative family contains King's family and several well-known methods as special case. This family has the advantage that one has more freedom than King’ family to choose the parameters. It is noteworthy that the presented methods show better performance and faster convergence than the King's method and some recent its variants.

Further researches are required to find the optimal values of parameters to achieve faster convergence can be considered as the next studies in this field.

References

  1. , . Modified homotopy perturbation method for nonlinear equations and comparison with Adomian decomposition method. Appl. Math. Comput.. 2006;172:431-438.
    [Google Scholar]
  2. , , . Solution of nonlinear equations by modified Adomian decomposition method. Appl. Math. Comput.. 2002;132:167-172.
    [Google Scholar]
  3. , . Some variants of King's fourth-order family of methods for nonlinear equations. Appl. Math. Comput.. 2007;190:57-62.
    [Google Scholar]
  4. , . Fourth-order iterative methods for solving nonlinear equations. Appl. Math. Comput. 2008:454-459.
    [Google Scholar]
  5. , , . Some fourth-order modifications of Newton's method. Appl. Math. Comput.. 2008;197:654-658.
    [Google Scholar]
  6. , , . Some variants of Newton's method with third-order convergence. J. Comput. Appl. Math.. 2003;140:419-426.
    [Google Scholar]
  7. , , . An improvement of the Euler–Chebyshev iterative method. J. Math. Anal. Appl.. 2006;315:1-7.
    [Google Scholar]
  8. , . Newton-like iteration methods for solving algebraic equations. Commun. Nonlinear Sci. Numer. Simul.. 1998;3(2):106-109.
    [Google Scholar]
  9. , . Family of fourth-order methods for nonlinear equations. SIAM J. Numer. Anal.. 1973;10(5):876-879.
    [Google Scholar]
  10. , , , . A composite fourth-order iterative method for solving non-linear equations. Appl. Math. Comput.. 2007;184:471-475.
    [Google Scholar]
  11. , . Solution of Equations in Euclidean and Banach Space. New York: Academic Press; .

Fulltext Views
29

PDF downloads
14
View/Download PDF
Download Citations
BibTeX
RIS
Show Sections

© Copyright 2025 – Journal of King Saud University – Science.

Published by Scientific Scholar on behalf of King Saud University.

ISSN (Print): 1018-3647
ISSN (Online): 2213-686X

Scientific Scholar CrossRef Creative Commons Open Acess Portico