# A New Jarratt-Type Fourth-Order Method for Solving System of Nonlinear Equations and Applications

Authors: Moin-ud-Din Junjua; Saima Akram; Nusrat Yasmin; Fiza Zafar
Journal: Journal of Applied Mathematics
 (2015)

---

## Abstract

Solving systems of nonlinear equations plays a major role in engineering problems. We present a new family of optimal fourth-order Jarratt-type methods for solving nonlinear equations and extend these methods to solve system of nonlinear equations. Convergence analysis is given for both cases to show that the order of the new methods is four. Cost of computations, numerical tests, and basins of attraction are presented which illustrate the new methods as better alternates to previous methods. We also give an application of the proposed methods to well-known Burger's equation.


---

## Body

## 1. Introduction

Let us consider the problem of constructing an optimal iterative method to find a simple zero of a nonlinear equation(1)
f
x
=
0
,as well as its extension for solving nonlinear system of equations F
(
X
)
=
0. There is no ambiguity that the quadratically convergent Newton method (NM) is one of the best root finding methods based on two evaluations of function for approximating the solution of a nonlinear equation (1) and is given as(2)
x
k
+
1
=
x
k
-
f
x
k
f
′
x
k
,
k
=
0,1
,
2
,
…
.The natural extension of Newton’s method for system of nonlinear equations is given [1] as (3)
X
(
k
+
1
)
=
X
(
k
)
-
F
′
X
k
-
1
F
X
k
.A large number of variants of the classical Newton method to obtain higher-order multistep schemes with better efficiencies have appeared using numerous techniques [2–4]. However, the research remained focussed on obtaining optimal and computationally efficient methods. The main objective was not only to boost up the order and speed of convergence but also to reduce the computational cost. This objective was achieved by defining two-step methods. A very few of them had less computational cost. Weerakoon and Fernando [5] proposed an accelerated cubically convergent two-step variant of Newton’s method:(4)
x
k
+
1
=
x
k
-
2
f
x
k
f
′
x
k
+
f
′
y
k
,where y
k
=
x
k
-
f
(
x
k
)
/
f
′
(
x
k
). Another cubically convergent without memory method was suggested by Frontini and Sormani [2]:(5)
y
k
=
x
k
-
f
x
k
f
′
x
k
,
x
k
+
1
=
x
k
-
f
x
k
f
′
x
k
+
y
k
/
2
.However, the above methods were not optimal. Jarratt [6] constructed an optimal method given by(6)
y
k
=
x
k
-
2
3
f
x
k
f
′
x
k
,
x
k
+
1
=
x
k
-
1
-
3
2
f
′
y
k
-
f
′
x
k
3
f
′
y
k
-
f
′
x
k
f
x
k
f
′
x
kand its extension for the systems of nonlinear equations is given by [7](7)
Y
(
k
)
=
X
(
k
)
-
2
3
F
X
k
-
1
F
X
k
,
X
k
+
1
=
X
k
-
I
-
2
3
3
F
′
Y
k
-
F
′
X
k
-
1
X
k
+
1
=
X
k
-
2
3
·
F
′
Y
k
-
F
′
X
k
X
k
+
1
=
×
F
′
X
k
-
1
F
X
k
.Several researchers have also focussed their attention on obtaining Jarratt-type iterative schemes for solving nonlinear equation [8–11]. Khattri and Abbasbandy [10] gave their contribution by using concept of parameter approach to develop an optimal fourth-order Jarratt-type iterative scheme requiring one evaluation of the function and two evaluations of first derivative. The following is a special case of their scheme:(8)
y
k
=
x
k
-
2
3
f
x
k
f
′
x
k
,
x
k
+
1
=
x
k
-
1
+
21
8
f
′
y
k
f
′
x
k
-
9
2
f
′
y
k
f
′
x
k
2
x
k
+
1
=
x
k
-
+
15
8
f
′
y
k
f
′
x
k
3
f
x
k
f
′
x
k
.Soleymani et al. [11] replaced the parameter approach by the weight function approach to construct a family of optimal Jarratt-type two-step methods:(9)
y
k
=
x
k
-
2
3
f
x
k
f
′
x
k
,
x
k
+
1
=
x
k
-
2
f
x
k
f
′
x
k
+
f
′
y
k
G
μ
×
H
ν
,where μ
=
f
(
x
)
/
f
′
(
x
) and ν
=
f
′
(
y
)
/
f
′
(
x
). A special case of their scheme is as follows:(10)
y
k
=
x
k
-
2
3
f
x
k
f
′
x
k
,
x
k
+
1
=
x
k
-
1
-
1
4
f
′
y
k
f
′
x
k
-
1
+
3
4
f
′
y
k
f
′
x
k
-
1
2
x
k
+
1
=
·
2
f
x
k
f
′
x
k
+
f
′
y
k
.Babajee et al. [12] extended (10) for the multivariate case as follows:(11)
X
k
+
1
=
X
k
X
k
+
1
=
-
I
-
1
4
τ
X
k
-
I
+
3
4
τ
X
k
-
I
2
X
k
+
1
=
×
A
1
X
k
-
1
F
X
k
,where(12)
A
1
(
X
k
)
=
1
2
F
′
X
k
+
F
′
y
k
,
τ
X
k
=
F
′
X
k
-
1
F
′
X
k
-
2
3
U
X
k
,
U
(
X
(
k
)
)
=
F
′
(
X
(
k
)
)
-
1
F
(
X
(
k
)
), and I is the n
×
n identity matrix. Chun et al. [8] used Halley’s method with an approximation of second derivative by using weight function approach in the second step of their scheme to obtain optimal variant of Jarratt-type fourth-order method. The classical Jarratt family of fourth-order methods was obtained as special case. A special case of his scheme is given as(13)
y
k
=
x
k
-
2
3
f
x
k
f
′
x
k
,
x
k
+
1
=
x
k
-
1
+
3
4
f
′
x
k
-
f
′
y
k
f
′
x
k
x
k
+
1
=
x
k
-
+
9
8
f
′
x
k
-
f
′
y
k
f
′
x
k
2
f
x
k
f
′
x
k
.In this contribution, we present and analyze an optimal family of fourth-order convergent iterative schemes using weight function in the second step. We, then, extend it for multivariate case. The rest of the paper is organized as follows. Section 2 is comprised of the construction and convergence analysis of the new family of methods for the single nonlinear equations. Section 3 consists of the extension of our method to the system of nonlinear equations. Section 4 includes numerical tests. Sections 5 and 6 provide the cost of computations and basins of attraction, respectively, for the sake of comparison of the new methods with the existing ones in this domain. In Section 7 an application of the proposed method to well-known Burger’s equation is presented and concluding remarks are given in Section 8.


## 2. New Family of Jarratt-Type Methods and Its Convergence Analysis

In this section, we propose a new optimal fourth-order Jarratt-type scheme for computing the zeros of a univariate nonlinear function. We give a two-step scheme in which the first step is similar to Jarratt’s scheme. In the second step, we use weight functions approach as follows:(14)
y
k
=
x
k
-
α
f
x
k
f
′
x
k
,
x
k
+
1
=
x
k
-
H
η
k
×
G
ζ
k
f
x
k
f
′
y
k
,where ζ
k
=
f
(
x
k
)
/
f
′
x
k, η
k
=
f
′
y
k
/
f
′
x
k, and G
ζ
k and H
η
k represent real-valued weight functions chosen such that new scheme (14) achieves optimal fourth-order convergence as stated in Theorem 1.Theorem 1.
Letγ
∈
D be a simple zero of sufficiently differentiable function f
:
I
⊆
R
→
R in an open interval I containing γ. Then, for α
=
2
/
3, the new without-memory scheme (14) has optimal convergence of order four under the following conditions on weight functions:(15)
H
1
=
1
,
H
′
1
=
1
4
,
H
′′
1
=
3
4
,
H
′′′
1
≤
∞
,
G
0
=
1
,
G
′
0
=
G
′′
0
=
0
,
G
′′′
0
≤
∞
,and it satisfies the error equation given by(16)
e
k
+
1
=
1
81
189
+
32
H
′′′
1
c
2
3
-
c
2
c
3
+
1
9
c
4
e
k
+
1
=
-
1
6
G
′′′
0
e
k
4
+
O
(
e
k
5
)
,where c
k
=
f
(
k
)
(
γ
)
/
k
!
f
′
(
γ
), k
≥
2.Proof.
Lete
k
=
x
k
-
γ be the error at kth computing step. By using Taylor’s expansion of f
(
x
k
) about the root γ, we get(17)
f
x
k
=
f
′
γ
e
k
+
c
2
e
k
2
+
c
3
e
k
3
+
c
4
e
k
4
+
O
e
k
5
,where c
k
=
f
(
k
)
(
γ
)
/
k
!
f
′
(
γ
), k
≥
2. The first derivative in the first step of our scheme can be calculated as(18)
f
′
x
k
=
f
′
γ
1
+
2
c
2
e
k
+
3
c
3
e
k
2
+
4
c
4
e
k
3
+
O
e
k
4
.Using (17) and (18) in the first step of (14), the Taylor expansions for y
k and f
′
(
y
k
) are given by(19)
y
k
=
γ
+
1
-
α
e
k
+
α
c
2
e
k
2
-
α
-
2
c
3
+
2
c
2
2
e
k
3
-
α
c
2
-
3
c
3
+
4
c
2
2
-
3
c
4
+
4
c
2
c
3
+
2
3
c
3
-
4
c
2
2
c
2
e
k
4
+
O
e
k
5
,
(20)
f
′
y
k
=
f
′
γ
+
4
c
4
1
-
α
3
e
k
3
1
+
2
c
2
1
-
α
e
k
+
2
α
c
2
2
+
3
c
3
1
-
α
2
e
k
2
f
′
y
k
=
f
′
γ
+
6
c
3
1
-
α
α
c
2
-
2
c
2
α
-
2
c
3
+
2
c
2
2
f
′
y
k
=
f
′
γ
+
4
c
4
1
-
α
3
e
k
3
+
O
(
e
k
4
)
.In the similar manner, for the second step of (14), we have(21)
f
x
k
f
′
y
k
=
e
k
+
-
2
c
2
1
-
α
+
c
2
e
k
2
+
-
2
c
2
2
1
-
α
-
2
α
c
2
2
-
3
c
3
1
-
α
2
-
4
c
2
2
-
1
+
α
1
-
α
+
c
3
e
k
3
+
⋯
+
O
e
k
5
.By using (17), (18), and (20), we get(22)
ζ
k
=
e
k
-
c
2
e
k
2
+
-
2
c
3
+
2
c
2
2
e
k
3
+
c
2
-
3
c
3
+
4
c
2
2
-
3
c
4
+
4
c
2
c
3
+
2
3
c
3
-
4
c
2
2
c
2
e
k
4
+
O
e
k
5
,
η
k
=
1
+
-
2
c
2
+
2
c
2
1
-
α
e
k
+
-
3
c
3
+
4
c
2
2
+
2
α
c
2
2
+
3
c
3
1
-
α
2
-
4
c
2
2
1
-
α
e
k
2
+
⋯
+
O
e
k
5
.Again using Taylor’s expansion, we have(23)
G
ζ
k
=
G
0
+
G
′
0
e
k
+
-
G
′
0
c
2
+
1
2
G
′′
0
e
k
2
+
⋯
+
O
e
k
5
,
H
η
k
=
H
1
-
2
H
′
1
α
c
2
e
k
+
6
H
′
1
α
c
2
2
-
6
H
′
1
α
c
3
+
3
H
′
2
c
3
+
2
H
′′
2
c
2
2
e
k
2
+
⋯
+
O
e
k
5
.Substituting α
=
2
/
3, (21) and (23) in (14) and using (15), we have (24)
x
k
+
1
=
γ
+
1
81
189
+
32
H
′′′
1
c
2
3
-
c
2
c
3
+
1
9
c
4
-
1
6
G
′′′
0
e
k
4
+
O
e
k
5which gives the following error equation:(25)
e
k
+
1
=
1
81
189
+
32
H
′′′
1
c
2
3
-
c
2
c
3
+
1
9
c
4
-
1
6
G
′′′
0
e
k
4
+
O
e
k
5
.Hence, it can be seen that the new scheme has optimal fourth-order convergence.


## 3. Extension of the New Family for Multivariate Case and Its Analysis

In this section, we extend our new family of optimal Jarratt-type schemes to solve systems of nonlinear equations. We give a special case for our new family by defining weight functions satisfying the conditions of Theorem1 as follows:(26)
H
η
k
=
1
+
1
4
f
′
y
k
f
′
x
k
-
1
+
3
8
f
′
y
k
f
′
x
k
-
1
2
,
G
ζ
k
=
1
.Thus, we achieve a new Jarratt-type fourth-order method:(27)
y
k
=
x
k
-
2
3
f
x
k
f
′
x
k
,
x
k
+
1
=
x
k
-
1
+
1
4
f
′
y
k
f
′
x
k
-
1
+
3
8
f
′
y
k
f
′
x
k
-
1
2
·
f
x
k
f
′
y
k
.Now, let us define F
:
A
⊆
R
n
→
R
n to be a sufficiently Fréchet differentiable in a convex set A
0
⊂
A, where A
0 is an open convex neighborhood of the root Γ, X
(
k
) is kth approximate root of the exact root Γ, and E
(
k
)
=
X
(
k
)
-
Γ; we can write the kth derivative of F at h
∈
R
n, k
≥
1 as a k-linear function F
(
k
)
(
h
)
:
R
(
n
)
×
R
(
n
)
×
⋯
×
R
(
n
)
→
R
(
n
) such that F
(
k
)
(
X
(
k
)
)
h
k
∈
R
n as described in [13]. Thus, it is defined as(28)
F
′
X
k
h
k
T
=
k
T
H
X
k
h
.Also, (29)
F
′′
X
k
h
k
T
=
k
T
H
1
X
k
h
,
k
T
H
2
X
k
h
,
…
,
k
T
H
m
X
k
h
,where H
1
(
X
)
,
…
,
H
m
(
X
) are the Hessian matrices of f
1
,
…
,
f
n. Therefore, Taylor’s series for function of n variables can be written as(30)
F
X
k
=
F
′
Γ
E
k
+
C
2
E
k
2
+
C
3
E
k
3
+
C
4
E
k
4
+
·
·
·
+
C
k
E
k
n
,where C
k
=
1
/
k
!
[
F
′
(
X
(
0
)
)
]
-
1
F
(
k
)
(
X
(
0
)
), F
′
(
X
(
0
)
) is continuous and nonsingular, and X
(
0
) is closer to Γ. Now, we extend our scheme for solving a system of nonlinear equations as follows:(31)
X
k
+
1
=
X
k
-
I
+
1
4
η
X
k
-
I
+
3
8
η
X
k
-
I
2
×
F
′
Y
k
-
1
F
X
k
,where Y
(
k
)
(
X
)
=
X
(
k
)
-
(
2
/
3
)
[
F
′
(
X
(
k
)
)
]
-
1
F
(
X
(
k
)
), η
(
X
(
k
)
)
=
[
F
′
(
X
(
k
)
)
]
-
1
F
′
(
Y
(
k
)
), I is the n
×
n identity matrix, and F
(
X
(
k
)
)
=
(
f
1
(
x
1
)
,
f
2
(
x
2
)
,
…
,
f
n
(
x
n
)
). By using the above Taylor expansion we can prove the following theorem.Theorem 2.
LetA
0
⊆
A be an open convex set containing the root Γ of F
(
X
)
=
0 and let F
:
A
⊆
R
n
→
R
n be four-time Fréchet differentiable in A
0 such that the Jacobian matrix is continuous and nonsingular in A. Then the new method (31) has convergence of order four.Proof.
LetΓ be the solution of nonlinear system F
(
Γ
)
=
0, and let X
(
0
) be an initial guess close to Γ; then by Taylor’s expansion of F
(
X
(
k
)
) about Γ, we have(32)
F
X
k
=
F
′
Γ
E
k
+
C
2
E
k
2
+
C
3
E
k
3
+
C
4
E
k
4
+
O
E
k
5
,
F
′
X
k
=
F
′
Γ
I
+
2
C
2
E
k
+
3
C
3
E
k
2
+
4
C
4
E
k
3
+
O
E
k
4
,where C
k
=
1
/
k
!
[
F
′
(
Γ
)
]
-
1
F
(
k
)
(
Γ
), k
≥
2, and E
(
k
)
=
X
(
k
)
-
Γ. We can calculate(33)
F
X
k
F
′
X
k
=
E
k
-
C
2
E
k
2
+
2
C
2
2
-
C
3
E
k
3
F
X
k
F
′
X
k
+
-
4
C
2
3
+
7
C
2
C
3
-
3
C
4
E
k
4
F
X
k
F
′
X
k
+
O
E
k
5to get(34)
Y
k
=
1
3
E
k
+
2
3
C
2
E
k
2
-
4
3
C
2
2
-
C
3
E
k
3
+
-
14
3
C
2
C
3
+
8
3
C
2
3
+
2
C
4
E
k
4
+
O
E
k
5
.The Jacobian matrix F
′
(
Y
(
k
)
) has the following Taylor expansion:(35)
F
′
Y
k
=
F
′
Γ
I
+
2
3
C
2
E
k
+
4
3
C
2
2
+
1
3
C
3
E
k
2
+
4
C
2
C
3
-
8
3
C
2
3
+
4
27
C
4
E
k
3
+
O
E
k
4to calculate(36)
F
′
Y
k
F
′
X
k
=
I
-
4
3
C
2
E
k
+
-
8
3
C
3
+
4
C
2
2
E
k
2
+
40
3
C
2
C
3
-
32
3
C
2
3
-
104
27
C
4
E
k
3
+
O
E
k
4
,
F
X
k
F
′
Y
k
=
E
k
+
1
3
C
2
E
k
2
+
-
14
9
C
2
2
+
2
3
C
3
E
k
3
+
-
41
9
C
2
C
3
+
88
27
C
2
3
+
23
27
C
4
E
k
4
+
O
E
k
5
.Using (33) and (36) in second step of (31), we attain with the following error term:(37)
X
k
+
1
=
-
C
2
C
3
+
7
3
C
2
3
+
1
9
C
4
E
k
4
+
O
E
k
5
,which shows the proposed method (31) is fourth-order convergent.


## 4. Numerical Results

We, now, check the effectiveness of our new optimal fourth-order family of methods (27) (MSNF-1) by comparing it with Newton’s method (2) (NM), Khattri’s method (8) (KM), Soleymani’s method (10) (SM), and Chun’s method (13) (CM). Algorithms have been executed in Maple software and are tested for the examples given in Table 1. The approximate solutions for solving single equations are calculated by using a precision of 1000 decimal digits with the stopping criterion f
x
m
+
x
m
-
γ
<
1
0
-
800. In Tables 2, 3, 4, 5, and 6, number of iterations, “m,” absolute values of functions f
x
m and absolute values of the difference between approximated roots and exact roots, x
m
-
γ, for each iterative method are given. We also compare our proposed method (31) (MSNF-2) for solving systems of nonlinear equations with Newton’s method (3) (NM), Babajee’s method (11) (BM), and Khattri’s method (8) (KM). For solving systems of equations results are computed with a precision of 500 decimal digits. The stopping criterion is F
(
X
(
k
-
1
)
)
∞
+
X
(
k
)
-
X
(
k
-
1
)
∞
<
1
0
-
100. Table 7 consists of test functions for solving systems of nonlinear equations along with their exact zeros. Table 8 shows absolute values of the difference between two consecutive approximations of the root and absolute functional values satisfying the above stopping criterion for each of the methods.Table 1
Test functions and their roots.
Numerical example
Exact root
f
1
(
x
)
=
sin
⁡
⁡
3
x
+
x
cos
⁡
x
γ
=
0
f
2
(
x
)
=
x
cos
⁡
x
2
-
1
2
γ
=
-
0.4747149936699329
f
3
(
x
)
=
(
x
-
1
)
3
-
1
γ
=
2
f
4
(
x
)
=
sin
⁡
-
1
(
x
2
-
1
)
-
1
2
x
+
1
γ
=
0.5948109683983691
f
5
(
x
)
=
x
2
e
x
-
sin
⁡
⁡
x
γ
=
0Table 2
Comparison of various iterative methods forf
1
(
x
).
f
1
(
x
)
NM
KM
CM
SM
MSNF-1
x
0
=
0.4
m
9
D
D
D
7
|
x
1
-
γ
|
3.02  10-
1
2.56  100
7.05  10-
1
6.07  10-
1
3.20  10-
1
|
f
1
(
x
1
)
|
1.075  100
1.16  100
1.39  100
1.46  100
1.12  100
|
x
2
-
γ
|
9.4  10-
2
3.0  100
2.10  100
35854.07  100
4.63  10-
2
|
f
1
(
x
2
)
|
3.72  10-
1
2.64  100
1.03  100
21526.38  100
1.84  10-
1
|
x
3
-
γ
|
2.13  10-
3
2.11  100
95.83  100
35853.13
8.67  10-
7
|
f
1
(
x
3
)
|
8.54  10-
3
1.03  100
2.23  100
10417.75  100
3.47  10-
6
|
x
4
-
γ
|
2.43  10-
8
883.95  100
95.80  100
35853.41  100
1.95  10-
30
|
f
1
(
x
4
)
|
9.74  10-
8
344.38  100
8.81  10-
8
290.79  100
7.81  10-
30
|
x
5
-
γ
|
3.61  10-
23
884.35  100
95.80  100
35853.42  100
1.12  10-
148
|
f
1
(
x
5
)
|
1.44  10-
22
1.11  100
3.90  10-
157
1.55  10-
4
4.51  10-
148
|
x
6
-
γ
|
1.17  10-
67
884.35  100
95.80  100
35853.42  100
7.28  10-
740
|
f
1
(
x
6
)
|
4.71  10-
67
5.21  10-
13
4.56  10-
635
1.25  10-
29
2.91  10-
739Table 3
Comparison of various iterative methods forf
2
(
x
).
f
2
(
x
)
NM
KM
CM
SM
MSNF-1
x
0
=
-
0.5
m
9
5
5
5
5
|
x
1
-
γ
|
3.63  10-
4
5.21  10-
7
2.06  10-
7
5.02  10-
7
4.13  10-
9
|
f
2
(
x
1
)
|
4.40  10-
4
6.31  10-
7
2.50  10-
7
6.09  10-
7
5.01  10-
9
|
x
2
-
γ
|
7.21  10-
8
8.64  10-
26
8.09  10-
28
7.82  10-
26
3.14  10-
36
|
f
2
(
x
2
)
|
8.74  10-
8
1.04  10-
25
9.81  10-
28
9.48  10-
26
3.81  10-
36
|
x
3
-
γ
|
2.84  10-
15
6.55  10-
101
1.92  10-
109
4.61  10-
101
1.05  10-
144
|
f
2
(
x
3
)
|
3.45  10-
15
7.95  10-
101
2.32  10-
109
5.59  10-
101
1.27  10-
144
|
x
4
-
γ
|
4.43  10-
30
2.17  10-
401
6.07  10-
436
5.57  10-
402
1.32  10-
578
|
f
2
(
x
4
)
|
5.37  10-
30
2.63  10-
401
7.36  10-
436
6.76  10-
402
1.60  10-
578
|
x
5
-
γ
|
1.07  10-
59
0
0
0
0
|
f
2
(
x
5
)
|
1.30  10-
59
0
0
0
0
|
x
6
-
γ
|
6.30  10-
119
0
0
0
0
|
f
2
(
x
6
)
|
7.64  10-
119
0
0
0
0Table 4
Comparison of various iterative methods forf
3
(
x
).
f
3
(
x
)
NM
KM
CM
SM
MSNF-1
x
0
=
1.9
m
10
6
6
6
5
|
x
1
-
γ
|
1.15  10-
2
1.91  10-
3
8.46  10-
4
4.12  10-
4
3.16  10-
4
|
f
3
(
x
1
)
|
3.49  10-
2
5.74  10-
3
2.54  10-
3
1.23  10-
3
9.50  10-
4
|
x
2
-
γ
|
1.30  10-
4
1.19  10-
10
2.38  10-
12
6.74  10-
14
2.00  10-
14
|
f
3
(
x
2
)
|
3.92  10-
4
3.59  10-
10
7.14  10-
12
2.02  10-
13
6.00  10-
14
|
x
3
-
γ
|
1.70  10-
8
1.88  10-
39
1.50  10-
46
4.82  10-
53
3.23  10-
55
|
f
3
(
x
3
)
|
5.12  10-
8
5.66  10-
39
4.50  10-
46
1.44  10-
52
9.71  10-
55
|
x
4
-
γ
|
2.92  10-
16
1.15  10-
154
2.36  10-
183
1.26  10-
209
2.20  10-
218
|
f
3
(
x
4
)
|
8.76  10-
16
3.46  10-
154
7.10  10-
183
3.80  10-
209
6.60  10-
218
|
x
5
-
γ
|
8.54  10-
32
1.62  10-
615
1.46  10-
730
0
0
|
f
3
(
x
5
)
|
2.56  10-
31
4.86  10-
615
1.46  10-
730
0
0
|
x
6
-
γ
|
7.29  10-
63
0
0
0
0
|
f
3
(
x
6
)
|
2.18  10-
62
0
0
0
0Table 5
Comparison of various iterative methods forf
4
(
x
).
f
4
(
x
)
NM
KM
CM
SM
MSNF-1
x
0
=
1.0
m
10
6
6
6
5
|
x
1
-
γ
|
7.1810
-
2
1.0410
-
2
5.0610
-
3
1.1610
-
2
3.9510
-
3
|
f
4
(
x
1
)
|
7.7610
-
2
1.1010
-
2
5.3610
-
3
1.2210
-
2
4.1810
-
3
|
x
2
-
γ
|
1.5010
-
3
1.5810
-
9
3.1610
-
11
1.7910
-
8
1.9710
-
13
|
f
4
(
x
2
)
|
1.5010
-
3
1.6710
-
9
3.3410
-
11
1.9010
-
8
2.0810
-
13
|
x
3
-
γ
|
6.0410
-
7
8.2810
-
37
4.7110
-
44
1.0110
-
31
4.5510
-
54
|
f
4
(
x
3
)
|
6.3910
-
7
8.7710
-
37
4.9810
-
44
1.0710
-
31
4.8110
-
54
|
x
4
-
γ
|
9.7110
-
14
6.1610
-
146
2.3210
-
175
1.0410
-
124
1.2910
-
216
|
f
4
(
x
4
)
|
1.0210
-
13
6.5210
-
146
2.4510
-
175
1.1110
-
124
1.3610
-
216
|
x
5
-
γ
|
2.5110
-
27
1.8910
-
582
1.3610
-
700
1.1810
-
496
0
|
f
4
(
x
5
)
|
2.6510
-
27
2.0010
-
582
1.4510
-
700
1.2510
-
496
0
|
x
6
-
γ
|
1.6710
-
54
0
0
0
0
|
f
4
(
x
6
)
|
1.7710
-
54
0
0
0
0Table 6
Comparison of various iterative methods forf
5
(
x
).
f
5
(
x
)
NM
KM
CM
SM
MSNF-1
x
0
=
0.22
m
10
D
D
8
6
|
x
1
-
γ
|
2.09  10-
1
8.46  100
1.57  100
6.11  10-
1
2.29  10-
1
|
f
5
(
x
1
)
|
2.44  10-
1
8.36  10-
1
1.51  100
7.77  10-
1
2.69  10-
1
|
x
2
-
γ
|
1.96  10-
2
11.00  100
1.24  1011
1.41  10-
1
1.11  10-
3
|
f
5
(
x
2
)
|
1.99  10-
2
9.97  10-
1
D
1.57  10-
1
1.11  10-
3
|
x
3
-
γ
|
3.53  10-
4
1.12  109
D
7.90  10-
4
5.35  10-
12
|
f
5
(
x
3
)
|
3.53  10-
4
9.96  10-
1
D
7.91  10-
4
5.35  10-
12
|
x
4
-
γ
|
1.25  10-
7
1.12  109
D
2.28  10-
12
2.91  10-
45
|
f
5
(
x
4
)
|
1.25  10-
7
1.70  10-
1
D
2.28  10-
12
2.91  10-
45
|
x
5
-
γ
|
1.56  10-
14
1.12  109
D
1.59  10-
46
2.56  10-
178
|
f
5
(
x
5
)
|
1.56  10-
14
9.4  10-
6
D
1.59  10-
46
2.56  10-
178
|
x
6
-
γ
|
2.44  10-
28
1.12  109
D
3.82  10-
183
1.53  10-
710
|
f
5
(
x
6
)
|
2.44  10-
28
3.91  10-
27
D
3.82  10-
183
1.53  10-
710
*
D stands for divergence.Table 7
Multivariate test functions, their roots, and starting vector.
Numerical example
Exact root
Starting vector
Example  1
f
=
x
-
y
-
19
Γ
1
=
(
5.000000,6.000000
)
t
X
(
0
)
=
(
5.1,6.1
)
t
g
=
y
3
6
-
x
2
-
17
Example  2
f
=
cos
⁡
y
-
sin
⁡
⁡
x
Γ
2
=
(
0.909569,0.661227,1.575834,1.575834
)
t
X
(
0
)
=
(
1.0,0.5,1.5
)
t
g
=
z
x
-
1
y
h
=
e
x
-
z
2
Example  3
f
=
x
y
+
z
(
x
+
y
)
Γ
3
=
(
0.577350,0.5577350,0.577350
,
-
0.288675
)
t
X
(
0
)
=
(
0.5,0.5,0.5
,
-
0.2
)
t
g
=
w
y
+
z
(
w
+
y
)
h
=
w
x
+
z
(
w
+
x
)
i
=
w
x
+
w
y
+
x
y
-
1Table 8
Comparison of various iterative methods for solving systems of nonlinear equations.
Numerical example
NM
KM
BM
MSNF-2
Example  1
Iterations
7
5
4
4
‖
X
(
k
)
-
X
(
k
-
1
)
‖
∞
4.98  10-
115
1.18  10-
376
2.591
0
-
103
7.101
0
-
108
‖
F
(
X
(
k
-
1
)
)
‖
∞
3.31  10-
115
2.13  10-
375
4.64  10-
102
1.2  10-
106
Example  2
Iterations
9
6
6
6
‖
X
(
k
)
-
X
(
k
-
1
)
‖
∞
6.42  10-
108
2.76  10-
210
1.00  10-
299
1.18  10-
356
‖
F
(
X
(
k
-
1
)
)
‖
∞
6.46  10-
108
2.79  10-
210
1.02  10-
299
1.23  10-
356
Example  3
Iterations
8
5
5
5
‖
X
(
k
)
-
X
(
k
-
1
)
‖
∞
4.40  10-
145
1.30  10-
198
3.49  10-
238
1.02  10-
256
‖
F
(
X
(
k
-
1
)
)
‖
∞
4.51  10-
145
1.30  10-
198
4.02  10-
238
1.02  10-
256


## 5. Computational Cost

In this section, we provide cost of computations and arithmetic required for executing extension of Khattri’s method (8) (KM) for solving system of nonlinear equations, Babajee’s method (11) (BM), extension of Chun’s method (13) (CM) for system, and our method (31) (MSNF-2). The cost of computations for the function F
(
X
) is n and computational cost for Jacobian F
′
(
X
) is n
2. We calculate the cost of computations by considering the number of scalar products, matrix products, matrix additions, matrix subtractions, vector additions, vector subtractions, vector multiplications, and decomposition into LU factorization of the first derivative for the methods under consideration here. In which case, cost of LU decomposition of first derivative and solving linear system is 2
/
3
n
3
+
2
n
2, if the right-hand side is a vector and for the case if the right-hand side is a matrix, then this cost is 2
n
3
+
2
n
2. Table 9 illustrates the total arithmetic and computational costs for execution of Khattri’s method (8) (KM), Babajee’s method (11) (BM), Chun’s method (13) (CM), and proposed method (31) (MSNF-2).Table 9
Comparison of various iterative methods according to computational and arithmetic costs.
Convergence order
Number of functional evaluations
Total cost of method
BM
4
2
n
2
+
n
13
3
n
3
+
12
n
2
+
4
n
KM
4
2
n
2
+
n
17
3
n
3
+
7
n
2
+
6
n
CM
4
2
n
2
+
n
11
3
n
3
+
10
n
2
+
4
n
MSNF-2
4
2
n
2
+
n
13
3
n
3
+
12
n
2
+
4
n


## 6. Attraction Basins

Letω
i be the roots of the complex polynomial p
n
(
x
), n
≥
1, x
∈
C, where i
=
1,2
,
3
,
…
,
n. We use two different techniques to generate basins of attraction on MATLAB software. We take a square box of [
-
2,2
]
×
[
-
2,2
]
∈
C in the first technique. For every initial guess x
0, a specific color is assigned according to the exact root and dark blue is assigned for the divergence of the method. We use f
(
x
k
)
<
1
0
-
5 as the stopping criterion for convergence and the maximum number of iterations is 30. “Jet” is chosen as the colormap here. For the second technique, same scale is taken, but each initial guess is assigned a color depending upon the number of iterations for the method to converge to any of the roots of the given function. We use 25 as the maximum number of iterations; the stopping criterion is same as above and colormap is selected as “Hot.” The method is considered as divergent for that initial guess if it does not converge in the maximum number of iterations and this case is displayed by black color. We take three test examples to obtain basins of attraction, which are given as p
3
(
x
)
=
x
3
-
1, p
4
(
x
)
=
x
4
-
10
x
2
+
9, and p
5
(
x
)
=
x
5
-
1. The roots of p
3
(
x
) are 1.0, -
0.5000
+
0.86605
I, -
0.50000
-
86605
I, roots of p
4
(
x
) are -
3,3
,
-
1,1 and for p
5
(
x
), and the roots are 1.0, 0.3090
+
0.95105
I, -
0.8090
+
0.58778
I, -
0.8090
-
0.58778
I, 0.30902
-
0.95105
I.We compare the results of our newly constructed method (27) with some existing methods (2), (8), (10), and (13) as given in Section 1. Figures 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, and 15 show the dynamics of the methods (2), (8), (10), (13), and (27) for the polynomials x
3
-
1
,
x
4
-
10
x
2
+
9, and x
5
-
1. Two types of attraction basins are given in all figures. One can easily see that the appearance of darker region shows that the method consumes a fewer number of iterations. Color maps for both types are given with each figure which show the root to which an initial guess converges and the number of iterations in which the convergence occurs.Figure 1
Basins of attraction of method (2) for p
3
(
x
).
(a)
(b)Figure 2
Basins of attraction of method (8) for p
3
(
x
).
(a)
(b)Figure 3
Basins of attraction of method (10) for p
3
(
x
).
(a)
(b)Figure 4
Basins of attraction of method (13) for p
3
(
x
).
(a)
(b)Figure 5
Basins of attraction of method (27) for p
3
(
x
).
(a)
(b)Figure 6
Basins of attraction of method (2) for p
4
(
x
).
(a)
(b)Figure 7
Basins of attraction of method (8) for p
4
(
x
).
(a)
(b)Figure 8
Basins of attraction of method (10) for p
4
(
x
).
(a)
(b)Figure 9
Basins of attraction of method (13) for p
4
(
x
).
(a)
(b)Figure 10
Basins of attraction of method (27) for p
4
(
x
).
(a)
(b)Figure 11
Basins of attraction of method (2) for p
5
(
x
).
(a)
(b)Figure 12
Basins of attraction of method (8) for p
5
(
x
).
(a)
(b)Figure 13
Basins of attraction of method (10) for p
5
(
x
).
(a)
(b)Figure 14
Basins of attraction of method (13) for p
5
(
x
).
(a)
(b)Figure 15
Basins of attraction of method (27) for p
5
(
x
).
(a)
(b)


## 7. Application

The well-known Burger equation named after Martinus Burger (1895–1981) is a classical partial differential equation. It acts as a governing equation in the gas dynamics and traffic flow models, for example, in modeling shock waves around jet, aerodynamic heating on atmospheric reentry vehicle, and flow of gas fuel within the jet engine. The viscous Burger equation is given as follows:(38)
u
t
+
u
u
x
=
ϵ
u
x
x
,
u
x
,
0
=
-
tanh
x
+
0.5
2
ϵ
+
1
,
-
1
≤
x
≤
1
,
u
-
1
,
t
=
0
,
u
1
,
t
=
0
,
t
≥
0
.We use the method of finite difference to solve (38) in which derivatives will be replaced with backward and central differences. We use backward difference to approximate derivative along t: u
t
≃
u
i
(
k
)
-
u
i
-
1
(
k
)
/
k, where k is the step size along t
j and central difference to approximate u
x and u
x
x as u
x
≃
u
i
+
1
(
k
)
-
u
i
-
1
(
k
)
/
2
h, u
x
x
≃
u
i
-
1
(
k
)
-
2
u
i
(
k
)
+
u
i
+
1
(
k
)
/
h
2, where h is step size along x. After replacing these approximations with partial derivatives arising in (38), we create a (
7
×
7
) mesh by choosing the step size h
=
0.3, k
=
0.03 and taking ϵ
=
0.1. The solution of (38) ends up with the tridiagonal system of nonlinear equations and we test this system using Maple 16 on a 64-bit machine. Table 10 shows the error of two consecutive iterates after fourth iteration at each time level t with the starting vector [
0.6,0.6,0.6,0.6,0.6
]. We compare the results of proposed method (MSNF-2) (31) with Newton’s method (3) (NM), Khattri’s method (8) (KM), and Babajee’s method (11) (BM) which illustrate that our method is a better alternate as compared to previous methods for solving nonlinear equations.Table 10
Comparison of various methods for solving (38).
t
NM
KM
BM
MSNF-2
‖
X
(
4
)
-
X
(
3
)
‖
∞
‖
X
(
4
)
-
X
(
3
)
‖
∞
‖
X
(
4
)
-
X
(
3
)
‖
∞
‖
X
(
4
)
-
X
(
3
)
‖
∞
0.2
2.5  10-
13
2.01
0
-
22
1.21623273
1.91
0
-
24
0.3
3.01
0
-
32
2.01
0
-
42
6.81
0
-
2
9.41
0
-
33
0.4
1.01
0
-
34
2.01
0
-
43
6.81
0
-
2
1.01
0
-
43
0.5
1.01
0
-
32
3.01
0
-
43
6.81
0
-
2
4.1
0
-
44
0.6
3.01
0
-
33
3.01
0
-
43
6.81
0
-
2
1.01
0
-
43


## 8. Conclusions

In this paper, we presented a new family of Jarratt-type fourth-order methods for solving nonlinear equations and its extension for system of nonlinear equations. We conclude from numerical results that our proposed methods for solving single as well as system of nonlinear equations perform relatively better as compared to the previous methods of this domain with less or comparable computational cost. Dynamical analysis of the iterative methods given in Figures1–15 shows that our method (27) provides highly accurate results in less number of iterations as compared to methods (2), (8), (10), and (13).



---

*Source: 805278-2015-03-25.xml*