# An Optimal Fourth Order Iterative Method for Solving Nonlinear Equations and Its Dynamics

Authors: Rajni Sharma; Ashu Bahl
Journal: Journal of Complex Analysis
 (2015)

---

## Abstract

We present a new fourth order method for finding simple roots of a nonlinear equationf(x)=0. In terms of computational cost, per iteration the method uses one evaluation of the function and two evaluations of its first derivative. Therefore, the method has optimal order with efficiency index 1.587 which is better than efficiency index 1.414 of Newton method and the same with Jarratt method and King’s family. Numerical examples are given to support that the method thus obtained is competitive with other similar robust methods.  The conjugacy maps and extraneous fixed points of the presented method and other existing fourth order methods are discussed, and their basins of attraction are also given to demonstrate their dynamical behavior in the complex plane.


---

## Body

## 1. Introduction

Solving nonlinear equations is a common and important problem in science and engineering [1, 2]. Analytic methods for solving such equations are almost nonexistent and therefore it is only possible to obtain approximate solutions by relying on numerical methods based on iterative procedures. With the advancement of computers, the problem of solving nonlinear equations by numerical methods has gained more importance than before.In this paper, we consider the problem of finding simple rootα of a nonlinear equation f(x)=0, where f(x) is a continuously differentiable function. Newton method is probably the most widely used algorithm for finding simple roots, which starts with an initial approximation x0 closer to the root (say, α) and generates a sequence of successive iterates {xk}0∞ converging quadratically to simple roots (see [3]). It is given by(1)xk+1=xk-fxkf′xk,k=0,1,2,3,….In order to improve the order of convergence of Newton method, many higher order multistep methods [4] have been proposed and analyzed by various researchers at the expense of additional evaluations of functions, derivatives, and changes in the points of iterations. An extensive survey of the literature dealing with these methods of improved order is found in [3, 5, 6] and references therein. Euler method and Chebyshev method (see Traub [3]) Weerakoon and Fernando [7], Ostrowski’s square root method [5], Halley [8], Hansen and Patrick [9], and so forth are well-known third order methods requiring the evaluation of f, f′, and f′′ per step. The famous Ostrowski’s method [5] is an important example of fourth order multipoint methods without memory. The method requires two f and one f′ evaluations per step and is seen to be efficient compared to classical Newton method. Another well-known example of fourth order multipoint methods with same number of evaluations is King’s family of methods [10], which contains Ostrowski’s method as a special case. Chun et al. [11–13], Cordero et al. [14], and Kou et al. [15, 16] have also proposed fourth order methods requiring two f evaluations and one f′ evaluation per iteration. Jarratt [17] proposed fourth order methods requiring one f evaluation and two f′ evaluations per iteration. All of these methods are classified as multistep methods in which a Newton or weighted-Newton step is followed by a faster Newton-like step.Through this work, we contribute a little more in the theory of iterative methods by developing the formula of optimal order four for computing simple roots of a nonlinear equation. The algorithm is based on the composition of two weighted-Newton steps and uses three function evaluations, namely, onef evaluation and two f′ evaluations.On the other hand, we analyze the behavior of this method in the complex plane using some tools from complex dynamics. Several authors have used these techniques on different iterative methods. In this sense, Curry et al. [18] and Vrscay and Gilbert [19, 20] described the dynamical behavior of some well-known iterative methods. The complex dynamics of various other known iterative methods, such as King’s and Chebyshev-Halley’s families, Jarratt method, has also been analyzed by various researchers; for example, see [13, 21–26].The paper is organized as follows. Some basic definitions relevant to the present work are presented in Section2. In Section 3, the method is developed and its convergence behavior is analyzed. In Section 4, we compare the presented method with some existing methods of fourth order in a series of numerical examples. In Section 5, we obtain the conjugacy maps and possible extraneous fixed points of these methods to make a comparison from dynamical point of view. In Section 6, the methods are compared in the complex plane using basins of attraction. Concluding remarks are given in Section 7.


## 2. Basic Definitions

Definition 1.
Letα be a simple root and let {xk}, k∈N, be a sequence of real or complex numbers that converges towards α. Then, one says that the order of convergence of the sequence is p if there exists p∈R+ such that(2)limk→∞⁡xk+1-αxk-αp=C;for some C≠0, C is known as the asymptotic error constant.Definition 2.
Letek=xk-α be the error in the kth iteration; one calls the relation(3)ek+1=Cekp+Oekp+1the error equation. If one can obtain error equation for any iterative method, then the value of p is the order of convergence.Definition 3.
Letd be the number of new pieces of information required by a method. A “piece of information” typically is any evaluation of a function or one of its derivatives. The efficiency of the method is measured by the concept of efficiency index [27] and is defined by(4)E=p1/d,where p is the order of the method.Definition 4.
Suppose thatxk-1, xk, and xk+1 are three successive iterations closer to the root α. Then, the computational order of convergence ρ (see [7]) is approximated by using (3) as(5)ρ≈ln⁡xk+1-α/xk-αln⁡xk-α/xk-1-α.


## 3. Development of the Method

Let us consider the two-step weighted-Newton iteration scheme of the type(6)yk=xk-θfxkf′xk,xk+1=xk-A+Bf′xkf′yk+Cf′ykf′xkfxkf′xk,where A, B, C, and θ are some constants which are to be determined. A natural question arises: is it possible to find A, B, C, and θ such that the iteration method (6) has maximum order of convergence? The answer to this question is affirmative and is proved in the following theorem.Theorem 5.
Letf(x) be a real or complex function. Assuming that f(x) is sufficiently differentiable in an interval I(⊆R), if f(x) has a simple root α∈I and x0 is sufficiently close to α, then (6) has fourth order convergence if A=-1/2, B=9/8, C=3/8, and θ=2/3.Proof.
Letek be the error at kth iteration, then ek=xk-α. Expanding f(xk) and f′(xk) about α and using the fact that fα=0, f′(α)≠0, we have(7)fxk=f′αek+A2ek2+A3ek3+A4ek4+Oek5,(8)f′xk=f′α1+2A2ek+3A3ek2+4A4ek3+Oek4,where Ak=f(k)(α)/k!f′(α), k=1,2,….
Using (7) and (8) and then simplifying, we obtain(9)fxkf′xk=ek-A2ek2+2A22-A3ek3+7A2A3-4A23-3A4ek4+Oek5.Substituting (9) in first substep of (6), we get (10)yk-α=1-θek+θA2ek2-2θA22-A3ek3-θ7A2A3-4A23-3A4ek4+Oek5.Expanding f′(yk) about α and using (10), we have (11)f′yk=f′α1+21-θA2ek+2θA22+31-θ2A3ek2+2θ5-3θA2A3-4θA23+41-θ3A4ek3+Oek4.From (8) and (11), we have (12)f′ykf′xk=1-2θA2ek+32θA22+-2θ+θ2A3ek2-44θA23+-7θ+3θ2A2A3+3θ-3θ2+θ3A4ek3+Oek4.Using (9) and (12) in second substep of (6), we obtain(13)ek+1=B1ek+B2ek2+B3ek3+B4ek4+Oek5,where(14)B1=1-A-B-C,B2=A+B+C+2C-BθA2,B3=-2A+B+C+8B-Cθ-4Bθ2A22+2A+B+C-6B-Cθ+3B-Cθ2A3,B4=4A+B+C-26B-Cθ+28Bθ2-8Bθ3A23+-7A+B+C+38B-Cθ+-39B+15Cθ2+12Bθ3A2A3+3A+B+C-12B-Cθ+12B-Cθ2-4B-Cθ3A4.
In order to achieve fourth order convergence, the coefficientsB1, B2, and B3 must vanish. Therefore, B1=0, B2=0, and B3=0 yield A=-1/2, B=9/8, C=3/8, and θ=2/3. With these values, error equation (13) turns out to be(15)ek+1=73A23-A2A3+19A4ek4+Oek5.
Thus, (15) establishes the fourth order convergence for iterative scheme (6). This completes proof of the theorem.Hence, the proposed scheme is given by(16)xk+1=xk--12+98f′xkf′yk+38f′ykf′xkfxkf′xk,where yk=xk-(2/3)(fxk/f′xk).We denote this method by SBM.Thus, we have derived fourth order method (16) for finding simple roots of a nonlinear equation. It is clear that this method requires three evaluations per iteration and therefore it is of optimal order.


## 4. Numerical Results

In this section, we present the numerical results obtained by employing the presented method SBM equation (16) to solve some nonlinear equations. We compare the presented method with quadratically convergent Newton method denoted by NM defined by (1) and some existing fourth order iterative methods, namely, the method proposed by Chun et al. [13], Cordero et al. method [14], King’s family of methods [10], and Kou et al. method [16]. These above-mentioned methods are given as follows.Chun et al. method (CLM) is(17)yk=xk-23fxkf′xk,xk+1=xk-1+34f′xk-f′ykf′xk+98f′xk-f′ykf′xk2fxkf′xk.Cordero et al. method (CM) is(18)yk=xk-fxkf′xk,zk=xk-fxk+fykf′xk,xk+1=zk-f2yk2fxk+fykf2xkf′xk. King’s family of methods (KM) is(19)yk=xk-fxkf′xk,xk+1=yk-fxk+afykfxk+a-2fykfykf′xk,where a∈R.Kou et al. method (KLM) is(20)yk=xk-fxkf′xk,xk+1=xk-f2xk+f2ykf′xkfxk-fyk.Test functions along with rootα correcting up to 28 decimal places are displayed in Table 1. Table 2 shows the values of initial approximation (x0) chosen from both sides to the root, values of the error ek=xk-α calculated by costing the same total number of function evaluations (NFE) for each method. Table 3 displays the computational order of convergence (ρ) defined by (5). The NFE is counted as sum of the number of evaluations of the function and the number of evaluations of the derivatives. In calculations, the NFE used for all the methods is 12. That means, for NM, the error ek is calculated at the sixth iteration, whereas for the remaining methods this is calculated at the fourth iteration.Table 1
Test functions.
f
(
x
)
Root (α)
f
1
x
=
∫
0
x
sin
⁡
x
t
t
d
t
-
1
2
1
2
X
0.712174684181616741647043448
f
2
x
=
arctan
⁡
x
-
x
+
1
2.13226772527288513162542070
f
3
x
=
x
-
3
log
⁡
x
1.85718386020783533645698098
f
4
x
=
x
2
+
2
x
+
5
-
2
sin
⁡
x
-
x
2
+
3
2.33196765588396401030804408
f
5
x
=
1
+
x
e
x
-
1
+
x
sin
⁡
x
-
3
x
2
cos
⁡
1
x
3
−1.00908567220810670132263656
f
6
x
=
arcsin
⁡
x
2
-
1
+
x
2
2
-
1
1.15289372243503862400901190
f
7
x
=
log
⁡
x
+
x
-
5
8.30943269423157179534695568Table 2
Error using same NFE = 12 for all methods.
f
(
x
)
x
0
e
k
=
x
k
-
α
NM
KMa=3
KLM
CM
CLM
SBM
f
1
0.5
5.63(−53)
1.27(−109)
8.41(−152)
1.97(−140)
1.02(−128)
6.31(−163)
0.8
5.54(−86)
8.53(−272)
5.66(−294)
1.04(−286)
1.91(−282)
6.55(−297)
f
2
2
6.96(−123)
5.29(−401)
1.05(−418)
1.61(−413)
4.37(−403)
1.82(−414)
3
1.87(−81)
1.91(−246)
2.71(−257)
4.18(−254)
7.81(−240)
8.37(−246)
f
3
1.7
4.07(−63)
2.10(−191)
1.69(−221)
3.39(−210)
3.53(−202)
3.71(−231)
2
6.91(−63)
1.86(−168)
4.66(−211)
1.52(−197)
1.13(−185)
3.19(−223)
f
4
2
1.92(−105)
1.48(−338)
4.62(−327)
2.61(−329)
3.89(−476)
7.84(−405)
2.5
9.33(−110)
1.07(−451)
8.45(−382)
1.03(−392)
4.90(−454)
5.42(−389)
f
5
-
1.1
7.02(−84)
1.29(−285)
6.80(−350)
3.99(−359)
3.48(−326)
9.60(−329)
-
0.8
1.10(−77)
5.17(−198)
1.28(−213)
5.77(−207)
7.75(−158)
1.28(−168)
f
6
1
1.81(−64)
2.56(−193)
3.85(−260)
7.18(−233)
1.45(−208)
1.45(−259)
1.2
3.37(−93)
4.96(−315)
1.02(−383)
6.56(−351)
4.89(−324)
3.29(−374)
f
7
8
1.53(−119)
3.08(−419)
2.56(−470)
2.12(−449)
2.74(−432)
2.20(−479)
8.5
1.99(−133)
1.39(−473)
9.83(−526)
1.03(−504)
2.51(−487)
4.23(−535)
Herea(-b)=a×10-b.Table 3
Computational order of convergence (ρ).
f
(
x
)
x
0
ρ
NM
KMa=3
KLM
CM
CLM
SBM
f
1
0.5
2
4
4
4
4
4
0.8
2
4
4
4
4
4
f
2
2
2
4
4
4
4
4
3
2
4
4
4
4
4
f
3
1.7
2
4
4
4
4
4
2
2
4
4
4
4
4
f
4
2
2
4
4
4
4
4
2.5
2
4
4
4
4
4
f
5
−1.1
2
4
4
4
4
4
−0.8
2
4
4
4
4
4
f
6
1
2
4
4
4
4
4
1.2
2
4
4
4
4
4
f
7
8
2
4
4
4
4
4
8.5
2
4
4
4
4
4The results in Table3 show that the computational order of convergence is in accordance with the theoretical order of convergence.The numerical results of Table2 clearly show that the presented method is competitive with other existing fourth order methods being considered for solving nonlinear equations. It can also be observed that there is no clear winner among the methods of fourth order in the sense that one behaves better in one situation while others take the lead in other situations. All computations are performed by Mathematica [28] using 600 significant digits.Since the present approach utilizes onef and two f′ evaluations per iteration, the newly developed method is very useful in the applications in which derivative f′ can be rapidly evaluated compared to f itself. Example of this kind occurs when f is defined by a polynomial or an integral.


## 5. Corresponding Conjugacy Maps for Quadratic Polynomials

In this section, we discuss the rational mapRp arising from various methods applied to a generic polynomial with simple roots.Theorem 6 (Newton method).
For a rational mapRp(z) arising from Newton method applied to p(z)=(z-a)(z-b), a≠b,Rp(z) is conjugate via the Möbius transformation given by M(z)=(z-a)/(z-b) to (21)Sz=z2.Proof.
Letp(z)=(z-a)(z-b), a≠b, and let M be Möbius transformation given by M(z)=(z-a)/(z-b) with its inverse M-1(u)=(ub-a)/(u-1), which may be considered as a map from C∪∞. We then get (22)Sz=MoRpoM-1z=z2.We can have the following results similarly.Theorem 7 (KM).
For a rational mapRp(z) arising from KM applied to p(z)=(z-a)(z-b), a≠b, Rp(z) is conjugate via the Möbius transformation given by M(z)=(z-a)/(z-b) to (23)Sz=z4z2+5z+77z2+5z+1.Theorem 8 (KLM).
For a rational mapRp(z) arising from KLM applied to p(z)=(z-a)(z-b), a≠b, Rp(z) is conjugate via the Möbius transformation given by M(z)=(z-a)/(z-b) to (24)Sz=z4z2+3z+33z2+3z+1.Theorem 9 (CM).
For a rational mapRp(z) arising from CM applied to p(z)=(z-a)(z-b), a≠b, Rp(z) is conjugate via the Möbius transformation given by M(z)=(z-a)/(z-b) to (25)Sz=z4z4+6z3+14z2+14z+44z4+14z3+14z2+6z+1.Theorem 10 (CLM).
For a rational mapRp(z) arising from CLM applied to p(z)=(z-a)(z-b), a≠b, Rp(z) is conjugate via the Möbius transformation given by M(z)=(z-a)/(z-b) to (26)Sz=z4z2+4z+55z2+4z+1.Theorem 11 (SBM).
For a rational mapRp(z) arising from SBM applied to p(z)=(z-a)(z-b), a≠b, Rp(z) is conjugate via the Möbius transformation given by M(z)=(z-a)/(z-b) to (27)Sz=z43z2+8z+77z2+8z+3.Remark. All the maps obtained above are of the form S(z)=zpR(z), where R(z) is either unity or a rational function and p is the order of the method.


### 5.1. Extraneous Fixed Points

The methods discussed above can be written in the fixed point iteration form as(28)xk+1=xk-Gfxkfxkf′xk,where the corresponding Gf(xk) of the methods are listed in Table 4.Table 4
G
f
(
x
k
) of the compared methods.
Method
G
f
(
x
k
)
Newton method
1
KM
1
+
1
+
a
f
y
k
/
f
x
k
1
+
a
-
2
f
y
k
/
f
x
k
f
(
y
k
)
f
(
x
k
)
KLM
1
+
f
(
y
k
)
/
f
(
x
k
)
2
1
-
f
y
k
/
f
x
k
CM
1
+
f
y
k
f
x
k
+
2
f
y
k
f
x
k
2
+
f
y
k
f
x
k
3
CLM
1
+
3
4
f
′
x
k
-
f
′
y
k
f
′
x
k
+
9
8
f
′
x
k
-
f
′
y
k
f
′
x
k
2
SBM
-
1
2
+
9
8
f
′
x
k
f
′
y
k
+
3
8
f
′
y
k
f
′
x
kClearly the rootα of f(x) is a fixed point of the method. However, the points ξ≠α at which Gf(ξ)=0 are also fixed points of the method as, with Gf(ξ)=0, second term on right side of (28) vanishes. These points are called extraneous fixed points (see [20]). Moreover, a fixed point ξ is called attracting if Rp′ξ<1, repelling if Rp′ξ>1, and neutral otherwise, where (29)Rpz=z-Gfzfzf′zis the iteration function. In addition, if Rp′ξ=0, the fixed point is superattracting.In this section, we will discuss the extraneous fixed points of each method for the polynomialz2-1.Theorem 12.
There are no extraneous fixed points for Newton method.Proof.
For Newton method (1), we have (30)Gf=1.This function does not vanish and therefore there are no extraneous fixed points.Theorem 13 (KM).
There are four extraneous fixed points for KM (assuminga=3).Proof.
The extraneous fixed points for KM are the roots of(27z4-14z2+3)/4z2(5z2-1)=0. For a=3, we get the fixed points as ±(0.544331±0.19245ι). These fixed points are repelling (the derivative at these points has its magnitude >1).Theorem 14 (KLM).
There are four extraneous fixed points for KLM.Proof.
The extraneous fixed points for KLM are at the roots of-(17z4-2z2+1)/4z2(3z2+1)=0. These extraneous fixed points are at ±(0.388175±0.303078ι). These fixed points are repelling (the derivative at these points has its magnitude >1).Theorem 15 (CM).
There are six extraneous fixed points for CM.Proof.
The extraneous fixed points for CM are given by(89z6-35z4+11z2-1)/64z6=0. On solving, we get the extraneous fixed points as ±0.466079±0.288008ι and ±0.353123. These fixed points are repelling (the derivative at these points has its magnitude >1).Theorem 16 (CLM).
The extraneous fixed points for CLM are±(0.491594±0.244636ι).Proof.
The extraneous fixed points for CLM method are those for which(31)1+34f′z-f′yf′z+98f′z-f′yf′z2=0.On substituting y(z)=z-f(z)/f′(z), we get the equation (99z4-36z2+9)/72z4=0. The four roots are ±(0.491594±0.244636ι). These fixed points are repelling (the derivative at these points has its magnitude >1).Theorem 17 (SBM).
There are four extraneous fixed points for SBM.Proof.
The extraneous fixed points for SBM are at the roots of-(23z4+1)/(16z4+8z2)=0. These extraneous fixed points are at ±(0.322889±0.322889ι). These fixed points are repelling (the derivative at these points has its magnitude >1).In the next section, we give the basins of attraction of these iterative methods in the complex plane.


## 5.1. Extraneous Fixed Points

The methods discussed above can be written in the fixed point iteration form as(28)xk+1=xk-Gfxkfxkf′xk,where the corresponding Gf(xk) of the methods are listed in Table 4.Table 4
G
f
(
x
k
) of the compared methods.
Method
G
f
(
x
k
)
Newton method
1
KM
1
+
1
+
a
f
y
k
/
f
x
k
1
+
a
-
2
f
y
k
/
f
x
k
f
(
y
k
)
f
(
x
k
)
KLM
1
+
f
(
y
k
)
/
f
(
x
k
)
2
1
-
f
y
k
/
f
x
k
CM
1
+
f
y
k
f
x
k
+
2
f
y
k
f
x
k
2
+
f
y
k
f
x
k
3
CLM
1
+
3
4
f
′
x
k
-
f
′
y
k
f
′
x
k
+
9
8
f
′
x
k
-
f
′
y
k
f
′
x
k
2
SBM
-
1
2
+
9
8
f
′
x
k
f
′
y
k
+
3
8
f
′
y
k
f
′
x
kClearly the rootα of f(x) is a fixed point of the method. However, the points ξ≠α at which Gf(ξ)=0 are also fixed points of the method as, with Gf(ξ)=0, second term on right side of (28) vanishes. These points are called extraneous fixed points (see [20]). Moreover, a fixed point ξ is called attracting if Rp′ξ<1, repelling if Rp′ξ>1, and neutral otherwise, where (29)Rpz=z-Gfzfzf′zis the iteration function. In addition, if Rp′ξ=0, the fixed point is superattracting.In this section, we will discuss the extraneous fixed points of each method for the polynomialz2-1.Theorem 12.
There are no extraneous fixed points for Newton method.Proof.
For Newton method (1), we have (30)Gf=1.This function does not vanish and therefore there are no extraneous fixed points.Theorem 13 (KM).
There are four extraneous fixed points for KM (assuminga=3).Proof.
The extraneous fixed points for KM are the roots of(27z4-14z2+3)/4z2(5z2-1)=0. For a=3, we get the fixed points as ±(0.544331±0.19245ι). These fixed points are repelling (the derivative at these points has its magnitude >1).Theorem 14 (KLM).
There are four extraneous fixed points for KLM.Proof.
The extraneous fixed points for KLM are at the roots of-(17z4-2z2+1)/4z2(3z2+1)=0. These extraneous fixed points are at ±(0.388175±0.303078ι). These fixed points are repelling (the derivative at these points has its magnitude >1).Theorem 15 (CM).
There are six extraneous fixed points for CM.Proof.
The extraneous fixed points for CM are given by(89z6-35z4+11z2-1)/64z6=0. On solving, we get the extraneous fixed points as ±0.466079±0.288008ι and ±0.353123. These fixed points are repelling (the derivative at these points has its magnitude >1).Theorem 16 (CLM).
The extraneous fixed points for CLM are±(0.491594±0.244636ι).Proof.
The extraneous fixed points for CLM method are those for which(31)1+34f′z-f′yf′z+98f′z-f′yf′z2=0.On substituting y(z)=z-f(z)/f′(z), we get the equation (99z4-36z2+9)/72z4=0. The four roots are ±(0.491594±0.244636ι). These fixed points are repelling (the derivative at these points has its magnitude >1).Theorem 17 (SBM).
There are four extraneous fixed points for SBM.Proof.
The extraneous fixed points for SBM are at the roots of-(23z4+1)/(16z4+8z2)=0. These extraneous fixed points are at ±(0.322889±0.322889ι). These fixed points are repelling (the derivative at these points has its magnitude >1).In the next section, we give the basins of attraction of these iterative methods in the complex plane.


## 6. Basins of Attraction

To study the dynamical behavior, we generate basins of attraction for two different polynomials using the above-mentioned methods. Following [29], we take a square -1,1×-1,1 (⊆C) of 1024×1024 points, which contains all roots of concerned nonlinear equation, and we apply the iterative method starting in every z0 in the square. We assign a color to each point z0 according to the simple root to which the corresponding orbit of the iterative method, starting from z0, converges. If the corresponding orbit does not reach any root of the polynomial, with tolerance ϵ=10-3 in a maximum of 25 iterations, we mark those points z0 with black color.For the first test problemp1(z)=z2-1, Figure 1 clearly shows that the proposed method SBM (Figure 1(f)) seems to produce larger basins of attraction than CLM (Figure 1(e)) and CM (Figure 1(d)), almost competitive basins of attraction as KLM (Figure 1(c)), and smaller basins of attraction than NM (Figure 1(a)) and KM (Figure 1(b)).Figure 1
Basins of attraction forf(z)=(z2-1) for various methods.
(a)
NM
(b)
KM
(c)
KLM
(d)
CM
(e)
CLM
(f)
SBMIn our next problem, we have taken the cubic polynomialp2(z)=z3-1. The results are given in Figure 2. Again the proposed method SBM (Figure 2(f)) seems to produce larger basins of attraction than KM (Figure 2(b)), CM (Figure 2(d)), and CLM (Figure 2(e)), almost competitive basins of attraction as KLM (Figure 2(c)), and smaller basins of attraction than NM (Figure 2(a)).Figure 2
Basins of attraction forf(z)=(z3-1) for various methods.
(a)
NM
(b)
KM
(c)
KLM
(d)
CM
(e)
CLM
(f)
SBM


## 7. Conclusion

In this work, we have proposed an optimal method of fourth order for finding simple roots of nonlinear equations. The advantage of the proposed method is that it does not require the use of second order derivative. The numerical results have confirmed the robustness and efficiency of the proposed method. The presented basins of attraction also show the good performance of the proposed method as compared to other existing fourth order methods in the literature.



---

*Source: 259167-2015-11-05.xml*