# General Family of Third Order Methods for Multiple Roots of Nonlinear Equations and Basin Attractors for Various Methods

Authors: Rajni Sharma; Ashu Bahl
Journal: Advances in Numerical Analysis
 (2014)

---

## Abstract

A general scheme of third order convergence is described for finding multiple roots of nonlinear equations. The proposed scheme requires one evaluation off
,
f
′, and f
′′ each per iteration and contains several known one-point third order methods for finding multiple roots, as particular cases. Numerical examples are included to confirm the theoretical results and demonstrate convergence behavior of the proposed methods. In the end, we provide the basins of attraction for some methods to observe their dynamics in the complex plane.


---

## Body

## 1. Introduction

Solving nonlinear equations is one of the most important problems in numerical analysis [1, 2]. With the advancement of computers, the problem of solving nonlinear equations by numerical methods has gained more importance than before. A large number of such methods have been derived for simple roots. However, not many methods are known for multiple root case. In this paper, we consider iterative methods to find a multiple root α of multiplicity m
>
1, that is,f
(
j
)
(
α
)
=
0, j
=
0,1
,
…
m
-
1, and f
(
m
)
(
α
)
≠
0, of a nonlinear equation f
(
x
)
=
0, where f
(
x
) is the continuously differentiable real or complex function. The modified Newton method [3] is an important and basic method for finding multiple roots
(1)
x
k
+
1
=
x
k
-
m
f
(
x
k
)
f
′
(
x
k
)
,
which converges quadratically and requires the knowledge of multiplicity m of root α.In order to improve the order of convergence of (1), several third order methods with known multiplicity m have been proposed at the expense of an additional evaluation of second derivative (see [4–14]).Inspired by the work in this direction, here we present a third order scheme of one-point methods without memory for multiple roots. The proposed scheme involves one evaluation off,  f
′, and f
′′ each per step. It is also shown that the well known existing methods by Ostrowski [4], Hansen and Patrick [5], Traub [6], Neta [8], Osada [7], Chun et al. [9, 10], Biazar and Ghanbari [11], and J. R. Sharma and R. Sharma [12, 13] can be regarded as particular cases of the proposed family.The paper is organized in six sections. In Section2, the third order family of methods for multiple roots requiring one evaluation of f,  f
′, and f
′′ each per step is proposed and its convergence behavior is discussed. Some particular cases of the family are presented in Section 3. In Section 4, the new methods are compared with the closest competitors in a series of numerical examples. In Section 5, we investigate the basins of attraction for some of the methods to provide the chaotic behavior of such schemes. Concluding remarks are given in Section 6.


## 2. The Method and Its Convergence Analysis

Consider the following iterative scheme:(2)
x
k
+
1
=
x
k
-
H
(
f
(
x
k
)
f
′′
(
x
k
)
f
′
(
x
k
)
2
)
f
(
x
k
)
f
′
(
x
k
)
,
where the function H
(
·
)
∈
C
2
(
ℝ
). In order to discuss the properties of the scheme defined by (2), we prove the following theorem.Theorem 1.
Letα
∈
I be a multiple root of multiplicity m of a sufficiently differentiable function f
:
I
→
ℝ for an open interval I. If x
0 is sufficiently close to α, then the iterative scheme defined by (2) has third order convergence, provided H
(
u
)
=
m
,
H
′
(
u
)
=
m
2
/
2, and H
′′
(
u
)
<
∞, and for u
=
(
m
-
1
)
/
m, e
k
=
x
k
-
α, one has
(3)
e
k
+
1
=
[
m
4
+
3
m
3
-
4
H
′′
(
u
)
2
m
5
A
1
2
-
A
2
m
]
e
k
3
+
O
(
e
k
4
)
,
where A
i
=
m
!
f
(
m
+
i
)
(
α
)
/
(
m
+
i
)
!
f
(
m
)
(
α
), for i
∈
ℕ,  ℕ being the set of natural numbers.Proof.
Expandf
(
x
k
)
,
f
′
(
x
k
)
,
f
′′
(
x
k
) in the Taylor series about α, where α is a multiple root of multiplicity m. Thus using the fact that f
(
j
)
(
α
)
=
0, j
=
0,1
,
…
m
-
1, and f
(
m
)
(
α
)
≠
0, we have
(4)
f
(
x
k
)
=
f
(
m
)
(
α
)
e
k
m
m
!
[
1
+
A
1
e
k
+
A
2
e
k
2
+
A
3
e
k
3
+
O
(
e
k
4
)
]
,
f
′
(
x
k
)
=
f
(
m
)
(
α
)
e
k
m
-
1
(
m
-
1
)
!
[
1
+
B
1
e
k
+
B
2
e
k
2
+
B
3
e
k
3
+
O
(
e
k
4
)
]
,
f
′′
(
x
k
)
=
f
(
m
)
(
α
)
e
k
m
-
2
(
m
-
2
)
!
[
1
+
C
1
e
k
+
C
2
e
k
2
+
C
3
e
k
3
+
O
(
e
k
4
)
]
,
where
(5)
A
i
=
m
!
f
(
m
+
i
)
(
α
)
(
m
+
i
)
!
f
(
m
)
(
α
)
,
B
i
=
(
m
-
1
)
!
f
(
m
+
i
)
(
α
)
(
m
+
i
-
1
)
!
f
(
m
)
(
α
)
,
C
i
=
(
m
-
2
)
!
f
(
m
+
i
)
(
α
)
(
m
+
i
-
2
)
!
f
(
m
)
(
α
)
,
n
n
n
n
n
n
n
n
n
n
n
n
i
=
1,2
,
…
.
From (4), we get
(6)
f
(
x
k
)
f
′
(
x
k
)
=
e
k
m
-
A
1
e
k
2
m
2
+
1
m
3
[
(
m
+
1
)
A
1
2
-
2
m
A
2
]
e
k
3
+
O
(
e
k
4
)
,
(7)
f
(
x
k
)
f
′′
(
x
k
)
f
′
(
x
k
)
2
=
m
-
1
m
+
2
A
1
e
k
m
2
-
3
m
3
[
(
m
+
1
)
A
1
2
-
2
m
A
2
]
e
k
2
+
4
m
4
[
(
m
+
1
)
A
1
3
-
m
(
3
m
+
4
)
A
1
A
2
k
+
3
m
2
A
3
]
e
k
3
+
O
(
e
k
4
)
.
Letf
(
x
k
)
f
′′
(
x
k
)
/
f
′
(
x
k
)
2
=
u
+
v, where u
=
(
m
-
1
)
/
m. Then from (7), the remainder v
=
(
f
(
x
k
)
f
′′
(
x
k
)
/
f
′
(
x
k
)
2
)
-
u is infinitesimal with the same order of e
k.
Thus we can use the Taylor series to expandH
(
f
(
x
k
)
f
′′
(
x
k
)
/
f
′
(
x
k
)
2
)
=
H
(
u
+
v
) about u and then obtain
(8)
H
(
f
(
x
k
)
f
′′
(
x
k
)
f
′
(
x
k
)
2
)
=
H
(
u
)
+
H
′
(
u
)
v
+
H
′′
(
u
)
v
2
2
+
H
′′′
(
u
)
v
3
3
!
+
O
(
e
k
4
)
.
By invocation of (2), (6), and (8), we get the error equation as
(9)
e
k
+
1
=
K
1
e
k
+
K
2
e
k
2
+
K
3
e
k
3
+
O
(
e
k
4
)
,
where
(10)
K
1
=
1
-
H
(
u
)
m
,
K
2
=
H
(
u
)
m
-
2
H
′
(
u
)
m
3
A
1
,
K
3
=
-
1
m
5
[
-
1
m
5
(
-
1
m
5
(
m
3
+
m
2
)
H
(
u
)
m
m
m
m
m
-
(
3
m
2
+
5
m
)
H
′
(
u
)
+
2
H
′′
(
u
)
-
1
m
5
)
A
1
2
m
m
m
m
m
+
(
6
m
2
H
′
(
u
)
-
2
m
3
H
(
u
)
)
A
2
-
1
m
5
]
.
In order to achieve the third order convergence, the coefficientsK
1 and K
2 must vanish. Solving K
1
=
0 and K
2
=
0, we obtain
(11)
H
(
u
)
=
m
,
H
′
(
u
)
=
m
2
2
.
Hence, (9) becomes
(12)
e
k
+
1
=
[
m
4
+
3
m
3
-
4
H
′′
(
u
)
2
m
5
A
1
2
-
A
2
m
]
e
k
3
+
O
(
e
k
4
)
.
This completes the proof of Theorem1.Remark 2.
From the error equation (9), we can find that the iterative method (2) contains the modified Newton method (1) as a second order method also.Remark 3.
Obviously, the number of function evaluations per iteration required in the scheme defined by (2) is three. We consider the definition of efficiency index [15] as p
1
/
r where p is the order of the method and r is the number of function evaluations per iteration required by the method. The scheme defined by (2) has the efficiency index equal to 3
1
/
3
≈
1.442 which is much better than 2
1
/
2
≈
1.414 of the modified Newton method.


## 3. Some Special Cases of Order Three

In this section, we present some special cases of order three of the presented scheme (2).Case 1.
For the functionH defined by H
(
t
)
=
A
t
+
B
,
H
′
(
t
)
=
A.
According to (11), solving the equations
(13)
A
u
+
B
=
m
,
A
=
m
2
2
,
we get A
=
m
2
/
2, B
=
m
(
3
-
m
)
/
2. With these values of A and B, scheme (2) takes the form
(14)
x
k
+
1
=
x
k
-
m
[
m
2
f
(
x
k
)
f
′′
(
x
k
)
f
′
(
x
k
)
2
+
3
-
m
2
]
f
(
x
k
)
f
′
(
x
k
)
,
which is Chebyshev’s method for multiple roots, proposed in [6, 8].Case 2.
IfH
(
t
)
=
A
+
(
B
/
t
), then H
′
(
t
)
=
-
B
/
t
2.
According to (11), solving the equations
(15)
A
+
B
u
=
m
,
-
B
u
2
=
m
2
2
,
we get A
=
m
(
m
+
1
)
/
2, B
=
-
(
m
-
1
)
2
/
2. With these values, scheme (2) leads to
(16)
x
k
+
1
=
x
k
-
[
m
(
m
+
1
)
2
-
(
m
-
1
)
2
2
f
′
(
x
k
)
2
f
(
x
k
)
f
′′
(
x
k
)
]
×
f
(
x
k
)
f
′
(
x
k
)
,
which is the third order Osada method for multiple roots [7].Case 3.
TakingH
(
t
)
=
1
/
(
A
t
+
B
), then H
′
(
t
)
=
-
A
/
(
A
t
+
B
)
2.
According to (11), solving the equations
(17)
1
A
u
+
B
=
m
,
-
A
(
A
u
+
B
)
2
=
m
2
2
,
we get A
=
-
1
/
2 and B
=
(
m
+
1
)
/
2
m. With these values, (2) yields
(18)
x
k
+
1
=
x
k
-
f
(
x
k
)
×
(
(
(
m
+
1
)
/
(
2
m
)
)
f
′
(
x
k
)
m
m
m
m
m
m
m
m
m
-
(
(
f
(
x
k
)
f
′′
(
x
k
)
)
/
(
2
f
′
(
x
k
)
)
)
)
-
1
,
which is Halley’s method for multiple roots [5].Case 4.
Supposing thatH
(
t
)
=
1
/
A
+
B
t, then H
′
(
t
)
=
-
B
/
2
(
A
+
B
t
)
3
/
2.
According to (11), solving the equations
(19)
1
A
+
B
u
=
m
,
-
B
2
(
A
+
B
u
)
3
/
2
=
m
2
2
,
we get A
=
1
/
m and B
=
-
1
/
m and hence (2) becomes
(20)
x
k
+
1
=
x
k
-
[
m
1
-
(
f
(
x
k
)
f
′′
(
x
k
)
)
/
f
′
(
x
k
)
2
]
f
(
x
k
)
f
′
(
x
k
)
,
which is Ostrowski’s square root iteration [4].Case 5.
IfH
(
t
)
=
(
A
+
B
t
)
/
(
C
+
D
t
), we have H
′
(
t
)
=
(
B
C
-
A
D
)
/
(
C
+
D
t
)
2.
According to (11), solving the equations
(21)
A
+
B
u
C
+
D
u
=
m
,
B
C
-
A
D
(
C
+
D
u
)
2
=
m
2
2
,
we get
(22)
A
=
C
m
(
3
-
m
)
-
D
(
m
-
1
)
2
2
,
B
=
D
m
+
(
C
+
D
)
m
2
2
.Subcase 1. The choice of C
=
2 and D
=
-
β
(
β
∈
ℝ
) gives
(23)
A
=
2
m
(
3
-
m
)
+
β
(
m
-
1
)
2
2
,
B
=
-
β
m
+
(
β
-
2
)
m
2
2
.
With these values, (2) corresponds to the Sharma-Sharma method [13]:
(24)
x
k
+
1
=
x
k
-
1
4
×
[
(
f
(
x
k
)
f
′′
(
x
k
)
)
(
f
(
x
k
)
f
′′
(
x
k
)
)
1
β
(
m
-
1
)
2
-
2
m
(
m
-
3
)
m
m
m
+
(
β
(
m
-
1
)
-
2
m
)
2
(
f
(
x
k
)
f
′′
(
x
k
)
/
2
f
′
(
x
k
)
2
)
1
-
β
(
f
(
x
k
)
f
′′
(
x
k
)
/
2
f
′
(
x
k
)
2
)
]
×
f
(
x
k
)
f
′
(
x
k
)
.Subcase 2. For the choice of C
=
(
m
-
1
)
2 and D
=
m
(
3
-
m
), we get A
=
0 and B
=
2
m
2. These values exhibit the proposed scheme (2) as
(25)
x
k
+
1
=
x
k
-
2
m
2
f
(
x
k
)
2
f
′′
(
x
k
)
m
(
3
-
m
)
f
(
x
k
)
f
′
(
x
k
)
f
′′
(
x
k
)
+
(
m
-
1
)
2
f
′
(
x
k
)
3
,
which is the third order Chun-Neta method [9].Case 6.
For(26)
H
(
t
)
=
(
A
+
B
t
+
C
t
2
)
(
D
+
E
t
+
F
t
2
)
,
H
′
(
t
)
=
(
B
D
-
A
E
)
-
2
(
A
F
-
C
D
)
t
+
(
C
E
-
B
F
)
t
2
(
D
+
E
t
+
F
t
2
)
2
.
According to (11), solving the equations (
A
+
B
u
+
C
u
2
)
/
(
D
+
E
u
+
F
u
2
)
=
m and
(27)
(
B
D
-
A
E
)
-
2
(
A
F
-
C
D
)
u
+
(
C
E
-
B
F
)
u
2
(
D
+
E
u
+
F
u
2
)
2
=
m
2
2
,
we get
(28)
E
=
C
(
m
-
1
)
3
+
B
m
(
m
2
-
1
)
+
m
2
(
A
(
m
+
3
)
-
4
D
m
)
2
m
2
(
m
-
1
)
,
F
=
-
C
(
m
-
3
)
(
m
-
1
)
2
+
B
m
(
m
-
1
)
2
+
m
2
(
A
(
m
+
1
)
)
2
m
(
m
-
1
)
2
+
2
D
m
3
2
m
(
m
-
1
)
2
.Subcase 1. Taking D
=
0 and  E
=
1 and solving (28), we get
(29)
A
=
-
(
m
-
1
)
2
(
(
F
+
1
)
m
2
+
F
m
-
2
C
)
2
m
2
,
B
=
m
2
(
F
m
+
m
+
2
F
+
1
)
-
4
C
m
-
3
F
m
+
4
C
2
m
.
With these values, (2) corresponds to the third order family of multiple roots developed by Biazar and Ghanbari [11]:
(30)
x
k
+
1
=
x
k
-
(
+
F
f
(
x
k
)
f
′
(
x
k
)
f
′′
(
x
k
)
2
)
-
1
(
B
f
(
x
k
)
f
′
(
x
k
)
2
f
′′
(
x
k
)
m
m
m
m
m
m
m
+
A
f
′
(
x
k
)
4
+
C
f
(
x
k
)
2
f
′′
(
x
k
)
2
)
m
m
m
m
m
m
m
×
(
f
′
(
x
k
)
3
f
′′
(
x
k
)
m
m
m
m
m
m
m
+
F
f
(
x
k
)
f
′
(
x
k
)
f
′′
(
x
k
)
2
)
-
1
)
,whereA and B are given in (29).Subcase 2. Taking A
=
2
(
m
2
-
3
m
+
2
),  B
=
-
m
2
+
5
m,  C
=
3
m
2, and D
=
2
m
2
-
6
m
+
4, (28) gives E
=
-
2
(
m
2
-
4
m
+
1
) and F
=
0. With these values, (2) yields
(31)
x
k
+
1
=
x
k
-
[
1
+
f
(
x
k
)
f
′′
(
x
k
)
2
f
′
(
x
k
)
2
m
m
m
m
m
+
(
(
2
m
-
1
)
2
(
f
(
x
k
)
f
′′
(
x
k
)
/
f
′
(
x
k
)
2
)
2
)
m
m
m
m
m
×
(
2
(
(
m
2
-
3
m
+
2
)
-
(
m
2
-
4
m
+
1
)
m
m
m
m
m
×
(
f
(
x
k
)
f
′′
(
x
k
)
/
f
′
(
x
k
)
2
)
)
)
-
1
f
(
x
k
)
f
′′
(
x
k
)
2
f
′
(
x
k
)
2
]
×
f
(
x
k
)
f
′
(
x
k
)
,
which is the Sharma-Sharma method [12].Subcase 3. With θ
∈
ℝ, taking
(32)
A
=
-
θ
(
m
-
1
)
2
2
,
B
=
(
2
θ
-
1
)
m
2
+
(
3
-
2
θ
)
m
2
,
C
=
(
1
-
θ
)
m
2
2
.
and D
=
0, (28) generates E
=
1 and F
=
0. So, (2) leads to
(33)
x
k
+
1
=
x
k
-
[
(
1
-
θ
)
m
2
2
f
(
x
k
)
f
′′
(
x
k
)
f
′
(
x
k
)
2
m
[
(
2
θ
-
1
)
m
+
3
-
2
θ
]
2
nnnnn
-
θ
(
m
-
1
)
2
2
f
′
(
x
k
)
2
f
(
x
k
)
f
′′
(
x
k
)
nnnnn
+
(
1
-
θ
)
m
2
2
f
(
x
k
)
f
′′
(
x
k
)
f
′
(
x
k
)
2
]
f
(
x
k
)
f
′
(
x
k
)
,
which is the one-parameter family of methods for multiple roots proposed by Chun et al. [10].Case 7.
Further, ifH
(
t
)
=
A
+
(
B
/
t
)
+
(
C
/
t
2
), then H
′
(
t
)
=
-
(
B
/
t
2
)
-
(
2
C
/
t
3
).
According to (11), solving the equations
(34)
A
+
B
u
+
C
u
2
=
m
,
-
B
u
2
-
2
C
u
3
=
m
2
2
,
we getA
=
(
(
m
+
m
2
)
/
2
)
+
(
C
m
2
/
(
m
-
1
)
2
) and B
=
(
-
(
m
-
1
)
2
/
2
)
-
(
2
C
m
/
(
m
-
1
)
).
So, we introduce a new one-parameter third order method as(35)
x
k
+
1
=
x
k
-
[
C
(
(
f
′
(
x
k
)
)
2
(
f
(
x
k
)
f
′′
(
x
k
)
)
)
2
(
m
+
m
2
2
+
C
m
2
(
m
-
1
)
2
)
m
m
m
m
m
+
(
-
(
m
-
1
)
2
2
-
2
C
m
m
-
1
)
f
′
(
x
k
)
2
f
(
x
k
)
f
′′
(
x
k
)
m
m
m
m
m
+
C
(
(
f
′
(
x
k
)
)
2
(
f
(
x
k
)
f
′′
(
x
k
)
)
)
2
]
f
(
x
k
)
f
′
(
x
k
)
,
where C
∈
ℝ. We call this method the Sharma-Bahl method, denoted by SBM.


## 4. Numerical Examples

In this section, we employ the presented third order method SBM (35) for C
=
1
/
2 to solve some nonlinear equations which not only illustrate the methods practically but also serve to check the validity of the theoretical results we have derived. To check the theoretical order of convergence, we obtain the computational order of convergence (ρ) using the formula [16]
(36)
ρ
≈
ln
⁡
|
(
x
k
+
1
-
α
)
/
(
x
k
-
α
)
|
ln
⁡
|
(
x
k
-
α
)
/
(
x
k
-
1
-
α
)
|
.The performance is compared with the methods in our families including the special ones, for some arbitrary chosen functions with roots of known multiplicitym. The methods compared include the modified Newton method (MNM) (1), the Osada method (OM) (16), Halley’s method (HM) (18), the Sharma-Sharma method (SSM) (24) for β
=
3
/
2, and the Chun-Neta method (CNM) (25).The test functions along with rootα correct up to 28 decimal places and its multiplicity m is displayed in Table 1. Table 2 shows the values of initial approximation (x
0) chosen from both ends to the root and the values of the error |
e
k
|
=
|
x
k
-
α
| calculated by costing the same total number of function evaluations (NFE) for each method. Table 3 exhibits the computational order of convergence (ρ). For numerical illustrations in Table 3, we use fixed stopping criterion ϵ
=
0.5
×
1
0
-
28. The NFE is counted as sum of the number of evaluations of the function plus the number of evaluations of the derivatives. We decide to choose 12 NFE for each method. That means that, for MNM, the error |
e
k
| is calculated at the sixth iteration, whereas for the remaining methods this is calculated at the fourth iteration. All computations are performed by MATHEMATICA [17] using 600 significant digits.Table 1
Test functions.
f
(
x
)
α
m
f
1
(
x
)
=
(
(
x
-
1
)
3
-
1
)
6
2.0000000000000000000000000000
6
f
2
(
x
)
=
(
ln
⁡
(
x
2
+
x
+
2
)
-
x
+
1
)
4
4.1525907367571582749969890048
4
f
3
(
x
)
=
(
ln
2
⁡
(
x
-
2
)
(
e
x
-
3
-
1
)
sin
⁡
⁡
π
x
3
)
3.0000000000000000000000000000
4
f
4
(
x
)
=
(
x
2
-
e
x
-
3
x
+
2
)
5
0.2575302854398607604553673049
5
f
5
(
x
)
=
(
cos
⁡
x
-
x
)
3
0.73908513321516064165531208767
3
f
6
(
x
)
=
(
√
x
-
1
x
-
3
)
3
9.6335955628326951924063127092
3
f
7
(
x
)
=
(
x
3
-
10
)
8
2.1544346900318837217592935665
8Table 2
Performance of the methods using 12 NFE.
f
(
x
)
x
0
|
e
k
|
=
|
x
k
-
α
|
MNM
OM
HM
SSM (β
=
3
/
2)
CNM
SBM (C
=
1
/
2)
f
1
1.75
1.20 (−34)
2.76 (−22)
5.48 (−34)
4.01 (−41)
1.08 (−42)
1.25  (−22)
3
1.55 (−16)
2.75 (−15)
4.93 (−18)
2.36 (−20)
6.78 (−21)
2.37  (−15)
f
2
4
4.53 (−129)
4.46 (−137)
1.46 (−145)
1.17 (−144)
1.11 (−141)
1.75 (−137)
5
6.88 (−86)
2.45 (−84)
7.75 (−91)
3.78 (−90)
7.10 (−88)
1.19 (−84)
f
3
2.5
5.41 (−67)
2.47 (−76)
8.33 (−57)
5.60 (−63)
4.90 (−58)
1.34 (−74)
3.25
7.83 (−99)
2.32 (−118)
1.39 (−106)
2.61 (−110)
2.60 (−107)
2.35 (−115)
f
4
-
2
1.55 (−37)
1.30 (−42)
1.45 (−40)
1.52 (−39)
1.47 (−40)
2.52 (−40)
1.5
1.06 (−57)
2.44 (−50)
5.15 (−50)
2.43 (−40)
4.66 (−38)
1.33 (−49)
f
5
0.3
3.59 (−59)
2.13 (−44)
5.12 (−64)
5.12 (−64)
7.17 (−53)
1.16 (−47)
1.7
3.25 (−65)
5.35 (−41)
2.25 (−44)
2.25 (−44)
1.84 (−42)
1.66 (−41)
f
6
9
5.13 (−108)
2.51 (−137)
1.50 (−135)
1.50 (−135)
1.15 (−193)
9.43 (−146)
10
1.11 (−61)
3.59 (−158)
4.68 (−157)
4.68 (−157)
9.07 (−214)
7.54 (−167)
f
7
2
2.59 (−72)
1.68 (−78)
6.75 (−99)
3.89 (−89)
3.29 (−92)
1.44 (−78)
3
2.79 (−33)
3.19 (−34)
2.97 (−47)
9.07 (−41)
8.73 (−43)
2.92 (−34)
Herea
(
-
b
)
=
a
×
1
0
-
b.Table 3
Computational order of convergence (ρ).
f
(
x
)
x
0
ρ
MNM
OM
HM
SSM (β
=
3
/
2)
CNM
SBM(
C
=
1
/
2
)
f
1
1.75
2
3
3
3
3
3
3
2
3
3
2.99
2.99
3
f
2
4
2
3
3
3
3
3
5
2
3
3
3
3
3
f
3
2.5
2
3
3
3
3
3
3.25
2
3
3
3
3
3
f
4
-
2
2
3
3
3
3
3
1.5
2
3
3
3
3
3
f
5
0.3
2
3
3
3
3
3
1.7
2
2.99
2.99
2.99
2.99
3
f
6
9
2
3
3
3
3
3
10
2
3
3
3
3
3
f
7
2
2
3
3
3
3
3
3
2
2.99
2.99
2.99
2.99
3It can also be observed from the numerical results of Table2 that all the presented methods are well behaved and that, for most of the functions we tested, the method introduced in this paper has similar performance compared to the other methods, as expected from methods of the same order and same computational efficiency. However, Halley’s method (18) and the Chun-Neta method (25) behave better and these are special cases of our proposed scheme for linear rational function H
(
·
). The results of Table 3 show that the computational order of convergence is in accordance with the theoretical order of convergence. The formulae have been employed on several other nonlinear equations and results are found at par with those presented here. A reasonably close starting value is necessary for the method to converge. The condition, however, practically applies to all iterative methods for solving nonlinear equations.


## 5. Finding the Basins

In this section, we find the basins of attraction of complex roots for the equationf
(
z
)
=
0, where f
:
ℂ
→
ℂ is a complex function. We consider the simplest case f
(
z
)
=
(
z
2
-
1
)
2, which has roots z
=
±
1 of multiplicity 2. Cayley [18] was the first who considered the Newton method for the roots of polynomial with iterations over the complex numbers.We take the initial point asz
0
∈
D where D is a rectangular region [
-
2.5,2.5
]
×
[
-
2.5,2.5
]
⊂
ℂ containing all the roots of f
(
z
)
=
0. We consider the stopping criterion for convergence as 1
0
-
3 up to a maximum of 25 iterations. We take a grid of 1024
×
1024 points in D.To generate the pictures, we use MATHEMATICA [17]. We assign the light to dark colors based on the number of iterations in which the considered initial point converges to a root. The root z
=
1 of f
(
z
)
=
0 and the points in the region converging to this root are shaded in cyan color and magenta color is used for the other root z
=
-
1 in a similar way. If we have not obtained the desired tolerance in 25 iterations, we do not continue and we decide that the iterative method starting at z
0 does not converge to any root and such points are shaded in black color (see [19–22]).The figures given here clearly show that the modified Newton method (Figure1(a)) and Halley’s method (Figure 1(c)) are the best, followed by the Osada method (Figure 1(b)), the Chun-Neta method (Figure 1(d)), SBM (Figure 1(f)), and Sharma-Sharma method (Figure 1(e)). From these pictures, we can guess the behavior and suitability of any method depending upon the circumstances. Thus, concluding, we can say that the linear rational function gives the best choice of weight function H
(
·
).Basins of attraction for(
z
)
=
(
z
2
-
1
)
2,  z
∈
D, for various methods of the family.
(a)
The modified Newton method
(b)
The Osada method
(c)
Halley’s method
(d)
The Chun-Neta method
(e)
The Sharma-Sharma method(
β
=
3
/
2
)
(f)
SBM(
C
=
1
/
2
)


## 6. Conclusions

In this paper, a general family of one-point third order methods for finding multiple roots of nonlinear equations is presented. This scheme contains some well known methods and recently developed methods as its particular cases. The theoretical results have been checked with some numerical examples, comparing our methods with the modified Newton method and some third order methods. The presented basins of attraction have also demonstrated the strictness of method for choice of starting point.



---

*Source: 963878-2014-03-31.xml*