Next Article in Journal
Existence Results for Block Matrix Operator of Fractional Orders in Banach Algebras
Previous Article in Journal
Optimal Sliced Latin Hypercube Designs with Slices of Arbitrary Run Sizes
Previous Article in Special Issue
Extending the Applicability of a Two-Step Chord-Type Method for Non-Differentiable Operators
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

High Convergence Order Iterative Procedures for Solving Equations Originating from Real Life Problems

by
Ramandeep Behl
1,*,
Ioannis K. Argyros
2 and
Ali Saleh Alshomrani
1
1
Department of Mathematics, King Abdulaziz University, Jeddah 21589, Saudi Arabia
2
Department of Mathematical Sciences, Cameron University, Lawton, OK 73505, USA
*
Author to whom correspondence should be addressed.
Mathematics 2019, 7(9), 855; https://doi.org/10.3390/math7090855
Submission received: 1 August 2019 / Revised: 3 September 2019 / Accepted: 4 September 2019 / Published: 17 September 2019

Abstract

:
The foremost aim of this paper is to suggest a local study for high order iterative procedures for solving nonlinear problems involving Banach space valued operators. We only deploy suppositions on the first-order derivative of the operator. Our conditions involve the Lipschitz or Hölder case as compared to the earlier ones. Moreover, when we specialize to these cases, they provide us: larger radius of convergence, higher bounds on the distances, more precise information on the solution and smaller Lipschitz or Hölder constants. Hence, we extend the suitability of them. Our new technique can also be used to broaden the usage of existing iterative procedures too. Finally, we check our results on a good number of numerical examples, which demonstrate that they are capable of solving such problems where earlier studies cannot apply.
MSC:
65G99; 65H10; 47J25; 47J05; 65D10; 65D99

1. Introduction

One of the most primary and principal problems in numerical analysis associate with how to approximate a locally unique zero λ * of
S ( λ ) = 0 ,
where S : Δ E 1 E 2 is a Fréchet-differentiable operator. In addition, E 1 , E 2 are two Banach spaces and Δ is a convex subset of Banach space E 1 . We denote ( E 1 , E 2 ) as the space of bounded linear operators from E 1 to E 2 .
Approximating a unique solution λ * is vital, since several problems can be transform to Equation (1) by adopting mathematical modeling [1,2,3,4,5,6,7,8]. However, it is not always possible to get λ * in a closed form. Therefore, most of the schemes to solve such problems are iterative. The convergence study of iterative schemes involves the information about λ * is known as local convergence. Convergence domain of an iterative method is an important task to guarantee convergence. Hence, it is very essential to suggest the radius of convergence.
We are interested in the local study of multi-point high-order convergent method [1] given by
η l = λ l β S ( λ l ) 1 S ( λ l ) , θ l = η l S ( λ l ) 1 S ( η l ) , λ l + 1 = θ l 1 β S ( η l ) 1 1 1 β S ( λ l ) 1 S ( θ l ) , β 0 , l = 0 , 1 , 2 ,
where λ 0 Δ is the starting point; for β ± 1 , the method reaches at least fourth order and, for β = ± 1 , fifth order. The hypotheses on the derivatives of S restrict the suitability of the scheme in Equation (2). As a motivational example, we suggest a function S on E 1 = E 2 = R , Δ = [ 3 2 , 1 2 ] by
S ( t ) = t 3 ln t 2 + t 5 t 4 , t 0 0 , t = 0 .
Then, we have that
S ( t ) = 3 t 2 ln t 2 + 5 t 4 4 t 3 + 2 t 2 ,
S ( t ) = 6 t ln t 2 + 20 t 3 12 t 2 + 10 t
and
S ( t ) = 6 ln t 2 + 60 t 2 24 t + 22 .
Then, obviously third-order derivative S ( t ) is unbounded on Δ . There is a plethora of research articles on iterative schemes [2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22]. The initial guess λ 0 must be close enough to the required solution for guaranteed convergence. However, it is not giving us any idea of: how to choose λ 0 , find a convergence radius, the bounds on λ l λ * and the uniqueness results. We deal with these problems for the method in Equation (2) in Section 2.
We enlarge the suitability of the scheme in Equation (2) by adopting only hypotheses on the first-order derivative of S and generalized conditions. In addition, we avoid the use of Taylor series expansions. In this way, there is no need to use the higher-order derivatives to illustrate the convergence order of the scheme in Equation (2). We adopt C O C and A C O C for the order of convergence, which avoid higher-order derivatives (see Remark 1 (d)). When the generalized conditions are specialized to the Lipschitz case (see Remark 1 (a)), the Hölder case [1] (see Remark 1 (c)) or the advantages mentioned in the Introduction are obtained.

2. Convergence Analysis

The local convergence analysis stand on some parameters and scalar functions. Let us assume β T { 0 } , and let w 0 be a non-decreasing continuous function on [ 0 , + ) having values in [ 0 , + ) with w 0 ( 0 ) = 0 , where T = R or T = C .
Suppose equation
w 0 ( α ) = 1 ,
has a minimal positive solution τ 0 .
Consider that functions w , v on [ 0 , τ 0 ) are continuous and increasing with w ( 0 ) = 0 . Moreover, we choose functions ϕ 1 and h 1 on the interval [ 0 , τ 0 ) as follows:
ϕ 1 ( α ) = 0 1 w ( ( 1 ν ) α ) d ν + | 1 β | 0 1 v ( ν α ) d ν 1 w 0 ( α ) , and h 1 ( α ) = ϕ 1 ( α ) 1 .
Suppose that
| 1 β | v ( 0 ) < 1 .
From Equation (4), we have h 1 ( 0 ) = | 1 β | v ( 0 ) 1 < 0 and h 1 ( α ) + as α τ 0 . Then, by the intermediate value theorem, we know that the function h 1 has zeros in 0 , τ 0 . Denote by τ 1 the smallest such zero of function h 1 . Assume equations w 0 ( ϕ 1 ( α ) α ) = 1 and w 0 ( ϕ 2 ( α ) α ) = 1 have minimal positive solutions τ ¯ 0 and τ ¯ ¯ 0 , respectively. Set
ρ = min { τ 0 , τ ¯ 0 , τ ¯ ¯ 0 } .
Furthermore, define some functions ϕ 2 , h 2 , ϕ 3 and h 3 on I = [ 0 , ρ ) in the following way:
ϕ 2 ( α ) = 0 1 w ( ( 1 ν ) ϕ 1 ( α ) α ) d ν 1 w 0 ( ϕ 1 ( α ) α ) + w ( ( 1 + ϕ 1 ( α ) ) α ) 0 1 v ( ν ϕ 1 ( α ) α ) d ν ( 1 w 0 ( α ) ) ( 1 w 0 ( ϕ 1 ( α ) α ) ) ϕ 1 ( α ) , h 2 ( α ) = ϕ 2 ( α ) 1 , ϕ 3 ( α ) = [ 0 1 w ( ( 1 ν ) ϕ 2 ( α ) α ) d ν 1 w 0 ( ϕ 2 ( α ) α ) + w ( ( 1 + ϕ 1 ( α ) ) α ) 0 1 v ( ν ϕ 2 ( α ) α ) d ν | β | ( 1 w 0 ( α ) ) ( 1 w 0 ( ϕ 1 ( α ) α ) ) , + w ( ( 1 + ϕ 1 ( α ) ) α ) 0 1 v ( ν ϕ 2 ( α ) α ) d ν ( 1 w 0 ( α ) ) ( 1 w 0 ( ϕ 2 ( α ) α ) ) ] ϕ 2 ( α ) , and h 3 ( α ) = ϕ 3 ( α ) 1 ,
We obtain again h 2 ( 0 ) = ϕ 3 ( 0 ) = 1 < 0 , and h 2 ( α ) + , h 3 ( α ) + as α ρ . Let us denote τ 2 and τ 3 as the smallest zero of the functions h 2 and h 3 , respectively, on the interval ( 0 , ρ ) . Finally, we define the convergence radius τ as follows:
τ = min { τ i } , i = 1 , 2 , 3 .
Then, we have
0 < τ < τ 0 ,
0 ϕ i ( α ) < 1 ,
0 w 0 ( α ) < 1 ,
0 w 0 ( ϕ 1 ( α ) α ) < 1 ,
and
0 w 0 ( ϕ 2 ( α ) α ) < 1 , for each α [ 0 , τ ) .
Let U ( z , ρ ) and U ¯ ( z , ρ ) stand, respectively, for the open and closed balls in E 1 with center z E 1 and radius ρ > 0 .
Next, we present the local convergence analysis of the method in Equation (2) using the preceding notations.
Theorem 1.
Let S : Δ E 1 E 2 be a Fréchet-differentiable operator. We assume that v , w 0 , w : [ 0 , ) [ 0 , ) are non-decreasing continuous functions with w 0 ( 0 ) = w ( 0 ) = 0 . Let β T { 0 } be such that Equation (4) is satisfied and τ 0 , τ ¯ 0 , τ ¯ ¯ 0 exist. In addition, we consider the zero λ * Δ is well defined, such that, for each λ Δ ,
S ( λ * ) = 0 , S ( λ * ) 1 L ( E 2 , E 1 )
and
S ( λ * ) 1 ( S ( λ ) S ( λ * ) w 0 ( x λ * ) .
Further, we consider that, for each λ , η Δ 0 : = Δ U ( λ * , τ 0 ) ,
S ( λ * ) 1 S ( λ ) S ( η ) w ( λ η ) ,
S ( λ * ) 1 S ( λ ) v ( λ λ * ) ,
and
U ¯ ( λ * , τ ) Δ ,
where the convergence radius τ is given by Equation (5). Then, the sequence { λ l } obtained for λ 0 U ( λ * , τ ) { λ * } by the scheme in Equation (2) is well defined, remains in U ( λ * , τ ) for each l = 0 , 1 , 2 , , and converges to λ * . Moreover, the following estimates hold
η l λ * ϕ 1 ( λ l λ * ) λ l λ * λ l λ * < τ ,
θ l λ * ϕ 2 ( λ l λ * ) λ l λ * λ l λ *
and
λ l + 1 λ * ϕ 3 ( λ l λ * ) λ l λ * λ l λ * ,
where the functions ϕ i , i = 1 , 2 , 3 are defined previously. Furthermore, if
0 1 w 0 ( θ R ) d θ < 1 , for R τ ,
then the point λ * is the unique zero of S ( λ ) = 0 in Δ 1 : = Δ U ¯ ( λ * , R ) .
Proof. 
We adopt the mathematical induction technique in order to demonstrate that the sequence { λ l } is well defined in U ( λ * , τ ) and also converges toward λ * . By the hypothesis λ 0 U ( λ * , τ ) { λ * } , and Equations (3), (5) and (12), we obtain
S ( λ * ) 1 ( S ( λ 0 ) S ( λ * ) ) w 0 ( λ 0 λ * ) < w 0 ( τ ) < 1 .
In view of Equation (20) and Banach Lemma on non-singular operators [2,3], S ( λ 0 ) 1 L ( E 2 , E 1 ) , η 0 and θ 0 are well defined by the first two sub steps of the method in Equation (2) and
S ( λ 0 ) 1 S ( λ * ) 1 1 w 0 ( λ 0 λ * ) .
Adopting the first sub step of the scheme in Equations (2), (5), (7) (for l = 1 ), (11), (13), (14) and (21), we yield
η 0 λ * = ( λ 0 λ * S ( λ 0 ) 1 S ( λ 0 ) ) + ( 1 β ) S ( λ 0 ) 1 S ( λ 0 ) S ( λ 0 ) 1 S ( λ * ) 0 1 S ( λ * ) 1 ( S ( λ * + ν ( λ 0 λ * ) ) S ( λ 0 ) ) ( λ 0 λ * ) d ν + | 1 β | S ( λ 0 ) 1 S ( λ * ) S ( λ 0 ) 1 S ( λ 0 ) 0 1 w ( ( 1 ν ) λ 0 λ * ) d ν λ 0 λ * + | 1 β | 0 1 v ( ν λ 0 λ * ) d ν λ 0 λ * 1 w 0 ( λ 0 λ * ) = ϕ 1 ( λ 0 λ * ) λ 0 λ * λ 0 λ * < τ ,
which implies Equation (16) for l = 0 and η 0 U ( λ * , τ ) . We can write by the second sub step of the method in Equation (2)
θ 0 λ * = η 0 λ * S ( η 0 ) 1 S ( η 0 ) + S ( η 0 ) 1 ( S ( η 0 ) S ( λ 0 ) ) S ( λ 0 ) 1 S ( η 0 ) .
Notice that η 0 U ( λ * , τ ) with η 0 = λ 0 in Equation (20), S ( η 0 ) 1 L ( E 2 , E 1 ) and λ 1 are well defined and
S ( η 0 ) 1 S ( λ * ) 1 1 w 0 ( η 0 λ * ) 1 1 w 0 ( ϕ 1 ( λ 0 λ * ) λ 0 λ * ) 1 1 w 0 ( λ 0 λ * ) .
By Equations (5), (6) (for l = 2 ), (9), (11), (13), (14), and (21)–(24), we get
θ 0 λ * = η 0 λ * S ( η 0 ) 1 S ( η 0 ) ) + S ( η 0 ) 1 S ( λ * ) S ( λ * ) 1 ( S ( λ 0 ) S ( η 0 ) ) S ( λ 0 ) 1 S ( λ * ) S ( λ * ) 1 S ( η 0 ) 0 1 w ( ( 1 ν ) η 0 λ * ) d ν η 0 λ * 1 w 0 ( η 0 λ * ) + w ( η 0 λ * ) 0 1 v ( ν η 0 λ * ) d ν η 0 λ * ( 1 w 0 ( λ 0 λ * ) ) ( 1 w 0 ( η 0 λ * ) ) ϕ 2 ( λ 0 λ * ) λ 0 λ * λ 0 λ * < τ ,
which implies Equation (17) for l = 0 and θ 0 U ( λ * , τ ) .
Then, by the third sub step of the method in Equations (2), (5), (7) (for l = 3 ), (9), (10), and (21)–(25) (for η 0 = θ 0 ), we yield
λ 1 λ * θ 0 λ * S ( θ 0 ) 1 S ( θ 0 ) + 1 | β | S ( η 0 ) 1 ( S ( λ 0 ) S ( η 0 ) ) S ( λ 0 ) 1 S ( λ * ) S ( λ * ) 1 S ( θ 0 ) + S ( θ 0 ) 1 ( S ( λ 0 ) S ( θ 0 ) ) S ( λ 0 ) 1 S ( λ * ) S ( λ * ) 1 S ( θ 0 ) 0 1 w ( ( 1 ν ) θ 0 λ * ) θ 0 λ * d ν 1 w 0 ( θ 0 λ * ) + 1 | β | w ( η 0 λ * ) 0 1 v ( ν θ 0 λ * ) d ν θ 0 λ * ( 1 w 0 ( η 0 λ * ) ) ( 1 w 0 ( λ 0 λ * ) ) + w ( θ 0 λ * ) 0 1 v ( ν θ 0 λ * ) d ν θ 0 λ * ( 1 w 0 ( θ 0 λ * ) ) ( 1 w 0 ( λ 0 λ * ) ) ϕ 3 ( λ 0 λ * ) λ 0 λ * λ 0 λ * < τ ,
which shows Equation (18) for l = 0 and θ 0 U ( λ * , τ ) . By changing λ 0 , η 0 , θ 0 λ 1 by λ l , η l , θ l , λ l + 1 in the preceding estimates, we attain at Equations (16)–(18). Therefore, in view of the estimates
λ l + 1 λ * c λ l λ * < τ , c = ϕ 3 ( λ 0 λ * ) [ 0 , 1 ) ,
we deduce that lim l λ l = λ * and λ l + 1 U ( λ * , τ ) .
Finally, we have to illustrate the uniqueness part. We assume that η * Δ 1 with S ( η * ) = 0 and define Q = 0 1 S ( λ * + θ ( λ * η * ) ) d θ . Using Equations (12) and (19), we get
S ( λ * ) 1 ( Q S ( λ * ) ) 0 1 w 0 ( θ η * λ * ) d ν 0 1 w 0 ( θ R ) d θ < 1 .
It is confirmed from Equation (28) that Q is an invertible operator. Then, in view of the identity
0 = S ( λ * ) S ( η * ) = Q ( λ * η * ) ,
we deduce that λ * = η * . □
Remark 1.
(a) 
It is clear from Equation (12) that the condition in Equation(14) can be released and adopted as follow:
v ( α ) = 1 + w 0 ( α ) or v ( α ) = 1 + w 0 ( τ 0 ) ,
since,
S ( λ * ) 1 S ( λ ) S ( λ * ) + S ( λ * ) = 1 + S ( λ * ) 1 ( S ( λ ) S ( λ * ) ) 1 + w 0 ( λ λ * ) = 1 + w 0 ( α ) for x λ * τ 0 .
Further, Singh et al. [1] considered the following conditions for each λ , η Δ in the Hölder case
S ( λ * ) 1 S ( λ ) S ( λ * ) w 0 λ λ * p ,
S ( λ * ) 1 S ( λ ) S ( η ) w ¯ λ η p ,
for β 4 5 , 5 4 (corresponding to Equation (4)).
In our case, we have
S ( λ * ) 1 S ( λ ) S ( λ * ) w 0 λ λ * p , for each λ , η Δ 0 ,
thus
w w ¯
holds, since Δ 0 Δ . Hence, the improvements, as stated in the Abstract of this paper, hold for w < w ¯ (see the numerical examples too).
Estimates
S ( λ * ) 1 S ( λ ) 1 + w 0 λ λ * p ,
S ( λ * ) 1 S ( λ * + θ ( λ λ * ) ) 1 + w 0 λ λ * p ,
used in [1,23] are not better than ours
S ( λ * ) 1 S ( λ ) v ( λ λ * ) , for each λ Δ 0 .
Indeed, use S ( λ ) = sin λ , then v ( α ) = 1 . However, the corresponding one in Equations (36) and (37) are less tight than Equation (38). Hence, the results using Equation (38) instead of Equations (36) and (37) provide advantages, as stated in the Introduction.
(b) 
If w 0 is a strictly increasing function, then we can consider
τ 0 = w 0 1 ( 1 )
instead of Equation (3).
(c) 
If w 0 , w are constants functions, p = 1 and β = 1 , then, we showed in [2,13] using only Equations (12) and (13) for the case of Newton’s method (see the definition of function ϕ 1 too)
τ 1 = 2 2 w 0 + w ,
thus
τ τ 1 .
Therefore, the convergence radius τ has maximum value τ 1 and τ 1 is the convergence radius of Newton’s method
λ l + 1 = λ l S ( λ l ) 1 S ( λ l ) .
Rheindoldt [22] and Traub [8] provided the following convergence radius instead of τ 1
τ T R = 2 3 w 1 .
On the other hand, Argyros [2,3] proposed the following convergence radius
τ A = 2 2 w 0 + w 1 ,
where w 1 is the Lipschitz constant for Equation (8) on Δ. However, we have
w w 1 , w 0 w 1 ,
thus
τ T R τ A τ 1
and
τ T R τ A 1 3 as w 0 w 0 .
The convergence radius q adopted in [24] is smaller than the radius τ D S proposed by Dennis and Schnabel [3]
q < τ D S = 1 2 w 1 < τ T R .
However, q cannot be computed using the Lipschitz constants.
(d) 
By adopting fifth-order derivative of S, the convergence order of the scheme in Equation (2) was demonstrated in [24]. On the other hand, our approach required only hypotheses on first-order derivative of S. To obtain the convergence order, we adopt the following techniques for the computational order of convergence C O C
ξ = l n λ n + 2 λ * λ l + 1 λ * l n λ l + 1 λ * λ l λ * , for each l = 0 , 1 , 2 ,
or the approximate computational order of convergence (ACOC) [19],
ξ * = l n λ l + 2 λ l + 1 λ l + 1 λ l l n λ l + 1 λ n λ n λ n 1 , for each l = 1 , 2 , .
Neither technique t requires any kind of derivative(s). It is also vital to note that there is no need of exact zero λ * in the case of ξ * .
(e) 
Consider operator S satisfying the autonomous differential equation [2,3]
S ( λ ) = T ( S ( λ ) )
where T is a given continuous operator. By S ( λ * ) = T ( S ( λ * ) ) = P ( 0 ) , we can use our results without the prior knowledge of required solution λ * . For example, S ( λ ) = e x 1 . Therefore, we obtain T ( λ ) = x + 1 .
(f) 
In view of estimates
S ( λ * ) 1 S ( λ 0 ) S ( η 0 ) = S ( λ * ) 1 ( S ( λ 0 ) S ( λ * ) ) + S ( λ * ) 1 S ( η 0 ) S ( λ 0 ) w 0 ( λ 0 λ * ) + w 0 ( η 0 λ * ) w 0 ( λ 0 λ * ) + w 0 ( ϕ 1 ( λ 0 λ * ) λ 0 λ * ) w 0 ( τ ) + w 0 ( ϕ 1 ( τ ) τ ) ,
and similarly
S ( λ * ) 1 S ( λ 0 ) S ( θ 0 ) w 0 ( λ 0 λ * ) + w 0 ( θ 0 λ * ) w 0 ( τ ) + w 0 ( ϕ 2 ( τ ) τ ) ,
we can replace the terms w ( ( 1 + ϕ 1 ( α ) ) α ) , w ( ( 1 + ϕ 2 ( α ) ) α ) in the definition of functions ϕ 2 and ϕ 3 by w 0 ( α ) + w 0 ( ϕ 1 ( α ) α ) , w 0 ( α ) + w 0 ( ϕ 2 ( α ) α ) , respectively. If
w 0 ( α ) w ( α ) , α [ 0 , τ 0 )
and say w 0 , w are constants, then the new functions ϕ 2 and ϕ 3 are tighter than the old one leading to larger τ and tighter error bounds on the distances λ l λ * (if w 0 < w ).

3. Concrete Examples

Here, we test the convergence conditions using concrete examples.
Example 1.
Here, we assume one of the well-known Hammerstein integral equations (see pp. 19–20, [25]) defined by:
x ( s ) = 1 5 0 1 S ( s , t ) x ( t ) 3 d t , x C [ 0 , 1 ] , s , t [ 0 , 1 ] ,
where the kernel S is:
S ( s , t ) = s ( 1 t ) , s t , ( 1 s ) t , t s .
We use 0 1 ϕ ( t ) d t k = 1 8 w k ϕ ( t k ) in Equation (54), where t k and w k are the abscissas and weights, respectively. Denoting the approximations of x ( t i ) with x i ( i = 1 , 2 , 3 , . . . , 8 ) , then it yields the following 8 × 8 system of nonlinear equations:
5 x i 5 k = 1 8 a i k x k 3 = 0 , i = 1 , 2 , 3 . . . , 8 ,
a i k = w k t k ( 1 t i ) , k i , w k t i ( 1 t k ) , i < k .
By Gauss–Legendre quadrature formula, we obtained the values of t k and w k when k = 8 , which are depicted in Table 1.
The required approximate root is:
λ * = ( 1 . 002096 , 1 . 009900 , 1 . 019727 , 1 . 026436 , 1 . 026436 , 1 . 019727 , 1 . 009900 , 1 . 002096 ) T .
Then, we get w 0 ( t ) = w ( t ) = 3 40 t and v ( t ) = 1 + w 0 ( t ) . We have the following radii of convergence for this problem in Table 2.
Example 2.
Consider the nonlinear integral Equations (13) and (16), when E 1 = E 2 = C [ 0 , 1 ] as
λ ( γ 1 ) = 0 1 G ( γ 1 , γ 2 ) λ ( γ 2 ) 3 2 + λ ( γ 2 ) 2 2 d γ 2 ,
where the kernel G : [ 0 , 1 ] × [ 0 , 1 ] is
G ( γ 1 , γ 2 ) = ( 1 γ 2 ) γ 2 , γ 2 γ 1 , γ 1 ( 1 γ 2 ) , γ 1 γ 2 .
The solution λ * ( γ 1 ) = 0 is the same as the solution of Equation (1), where S : C [ 0 , 1 ] C [ 0 , 1 ] is defined by
S ( λ ) ( γ 1 ) = λ ( γ 1 ) 0 γ 2 G ( γ 1 , γ 2 ) λ ( γ 2 ) 3 2 + λ ( γ 2 ) 2 2 d γ 2 .
We get
0 γ 2 G ( γ 1 , γ 2 ) d γ 2 1 8 .
Moreover,
S ( λ ) η ( γ 1 ) = η ( γ 1 ) 0 γ 2 G ( γ 1 , γ 2 ) 3 2 λ ( γ 2 ) 1 2 + λ ( γ 2 ) η ( γ 2 ) d γ 2 ,
thus, since S ( λ * ( γ 1 ) ) = I ,
S ( λ * ) 1 S ( λ ) S ( η ) 1 8 3 2 λ η 1 2 + λ η .
Hence, we have
w 0 ( α ) = w ( α ) = 1 8 3 2 α 1 2 + α ,
thus, by Remark 1 (a), we can choose
v ( α ) = 1 + w 0 ( α ) .
Therefore, our results can be utilized but not the ones in [1] because S is unbounded on Δ. We have the following radii of convergence for the problem in Example 2 mentioned in Table 3.
Example 3.
Consider a system of differential equations,
s 1 ( λ ) s 1 ( λ ) 1 = 0 s 2 ( η ) ( e 1 ) η 1 = 0 s 3 ( θ ) 1 = 0
that describes the movement of a particle in three dimensions with λ , η , θ Δ for s 1 ( 0 ) = s 2 ( 0 ) = s 3 ( 0 ) = 0 . Then, the solution v = ( λ , η , θ ) T relates to S : = ( s 1 , s 2 , s 3 ) : Δ R 3 , given as
S ( v ) = e λ 1 , e 1 2 η 2 + η , θ T .
It follows from Equation (61) that
S ( v ) = e λ 0 0 0 ( e 1 ) η + 1 0 0 0 1 .
Then, we have that w 0 ( α ) = L 0 α , w ( α ) = L α and v ( α ) = M , where L 0 = e 1 < L = e 1 L 0 = 1 . 789572397 and M = e 1 L 0 = 1 . 7896 . e have the following radii of convergence for Example 3, depicted in Table 4 and Table 5.
Example 4.
The chemical reaction [26] illustrated in this case shows how Γ 1 and Γ 2 are utilized at rates q * Q * and Q * , respectively, for a tank reactor (known as CSTR), given by:
Γ 2 + Γ 1 Γ 3 Γ 3 + Γ 1 Γ 4 Γ 4 + Γ 1 Γ 5 Γ 5 + Γ 1 Γ 6
Douglas [27] analyzed the CSTR problem for designing simple feedback control systems. The following mathematical formulation was adopted:
K C 2 . 98 ( λ + 2 . 25 ) ( λ + 1 . 45 ) ( λ + 2 . 85 ) 2 ( λ + 4 . 35 ) = 1 ,
where the parameter K C has a physical meaning and is described in [26,27]. For the particular value of choice K C = 0 , we obtain the corresponding equation:
S ( λ ) = λ 4 + 11 . 50 λ 3 + 47 . 49 λ 2 + 83 . 06325 λ + 51 . 23266875 .
The function S has four solutions λ * = 2 . 85 , 1 . 45 , 2 . 85 , 4 . 35 . Nonetheless, the desired zero is λ * = 4 . 35 for Equation (62). We assume Δ = [ 4 . 5 , 4 ] . Then, we have w 0 ( α ) = w ( α ) = 0 . 644828 α and v ( α ) = 0 . 238439 .
The radii of converegnce for the method (2) on the basis of Example 4 are mentioned in Table 6.
Example 5.
By the example in the Introduction, we get L = L 0 = 96 . 662907 and M = 2 . The radii of convergence of the method (2) for Example 5 are described in Table 7.

Author Contributions

R.B. and I.K.A.: Conceptualization; Methodology; Validation; Writing–Original Draft Preparation; Writing–Review & Editing. A.S.A.: Review & Editing.

Funding

Deanship of Scientific Research (DSR) at King Abdulaziz University, Jeddah, Saudi Arabia, under Grant No. G: 424-130-1440.

Acknowledgments

This project was funded by the Deanship of Scientific Research (DSR) at King Abdulaziz University, Jeddah, Saudi Arabia, under Grant No. G: 424-130-1440. The authors, therefore, acknowledge with thanks DSR for technical and financial support.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Singh, S.; Gupta, D.K.; Badoni, R.P.; Martínez, E.; Hueso, J.L. Local convergence of a parameter based iteration with Hölder continuous derivative in Banach spaces. Calcolo 2017, 54, 527–539. [Google Scholar] [CrossRef]
  2. Argyros, I.K. Convergence and Application of Newton-Type Iterations; Springer: Berlin/Heidelberg, Germany, 2008. [Google Scholar]
  3. Argyros, I.K.; Hilout, S. Computational Methods in Nonlinear Analysis; World Scientific Publishing Company: Hackensack, NJ, USA, 2013. [Google Scholar]
  4. Cordero, A.; Torregrosa, J.R.; Vassileva, M.P. Increasing the order of convergence of iterative schemes for solving nonlinear system. J. Comput. Appl. Math. 2012, 252, 86–94. [Google Scholar] [CrossRef]
  5. Hernández, M.A.; Martinez, E. On the semilocal convergence of a three steps Newton-type process under mild convergence conditions. Numer. Algor. 2015, 70, 377–392. [Google Scholar] [CrossRef]
  6. Potra, F.A.; Pták, V. Nondiscrete introduction and iterative process. Res. Notes Math. 1984, 103. [Google Scholar]
  7. Sharma, J.R.; Ghua, R.K.; Sharma, R. An efficient fourth-order weighted-Newton method for system of nonlinear equations. Numer. Algor. 2013, 62, 307–323. [Google Scholar] [CrossRef]
  8. Traub, J.F. Iterative Methods for the Solution of Equations; Prentice-Hall Series in Automatic Computation; Prentice-Hall: Englewood Cliffs, NJ, USA, 1964. [Google Scholar]
  9. Amat, S.; Busquier, S.; Plaza, S.; Guttiérrez, J.M. Geometric constructions of iterative functions to solve nonlinear equations. J. Comput. Appl. Math. 2003, 157, 197–205. [Google Scholar] [CrossRef] [Green Version]
  10. Amat, S.; Busquier, S.; Plaza, S. Dynamics of the King and Jarratt iterations. Aequationes Math. 2005, 69, 212–223. [Google Scholar] [CrossRef]
  11. Amat, S.; Hernández, M.A.; Romero, N. A modified Chebyshev’s iterative method with at least sixth order of convergence. Appl. Math. Comput. 2008, 206, 164–174. [Google Scholar] [CrossRef]
  12. Argyros, I.K.; Magreñán, Á.A. Ball convergence theorems and the convergence planes of an iterative methods for nonlinear equations. SeMA 2015, 71, 39–55. [Google Scholar]
  13. Argyros, I.K.; George, S. Local convergence of some higher-order Newton-like method with frozen derivative. SeMa 2015, 70, 47–59. [Google Scholar] [CrossRef]
  14. Cordero, A.; Torregrosa, J.R. Variants of Newton’s method using fifth-order quadrature formulas. Appl. Math. Comput. 2007, 190, 686–698. [Google Scholar] [CrossRef]
  15. Cordero, A.; Torregrosa, J.R. Variants of Newton’s method for functions of several variables. Appl. Math. Comput. 2006, 183, 199–208. [Google Scholar] [CrossRef]
  16. Ezquerro, J.A.; Hernández, M.A. New iterations of R-order four with reduced computational cost. BIT Numer. Math. 2009, 49, 325–342. [Google Scholar] [CrossRef]
  17. Ezquerro, J.A.; Hernández, M.A. A uniparametric halley type iteration with free second derivative. Int. J. Pure and Appl. Math. 2003, 6, 99–110. [Google Scholar]
  18. Gutiérrez, J.M.; Hernández, M.A. Recurrence relations for the super-Halley method. Comput. Math. Appl. 1998, 36, 1–8. [Google Scholar] [CrossRef] [Green Version]
  19. Kou, J. A third-order modification of Newton method for systems of nonlinear equations. Appl. Math. Comput. 2007, 191, 117–121. [Google Scholar]
  20. Montazeri, H.; Soleymani, F.; Shateyi, S.; Motsa, S.S. On a new method for computing the numerical solution of systems of nonlinear equations. J. Appl. Math. 2012, 2012. [Google Scholar] [CrossRef]
  21. Petkovic, M.S.; Neta, B.; Petkovic, L.; Džunič, J. Multipoint Methods for Solving Nonlinear Equations; Elsevier: Amsterdam, The Netherlands, 2013. [Google Scholar]
  22. Rheinboldt, W.C. An Adaptive Continuation Process for Solving Systems of Nonlinear Equations; Banach Center Publications: Warszawa, Poland, 1978; Volume 3, pp. 129–142. [Google Scholar]
  23. Martínez, E.; Singh, S.; Hueso, J.L.; Gupta, D.K. Enlarging the convergence domain in local convergence studies for iterative methods in Banach spaces. Appl. Math. Comput. 2016, 281, 252–265. [Google Scholar] [CrossRef] [Green Version]
  24. Xiao, X.Y.; Yin, H.W. Increasing the order convergence for iterative methods to solve nonlinear systems. Calcolo 2016, 53, 285–300. [Google Scholar] [CrossRef]
  25. Ortega, J.M.; Rheinboldt, W.C. Iterative Solution of Nonlinear Equations in Several Variables; Academic Press: New York, NY, USA, 1970. [Google Scholar]
  26. Constantinides, A.; Mostoufi, N. Numerical Methods for Chemical Engineers with MATLAB Applications; Prentice Hall PTR: Upper Saddle River, NJ, USA, 1999. [Google Scholar]
  27. Douglas, J.M. Process Dynamics and Control; Prentice Hall: Englewood Cliffs, NJ, USA, 1972; Volume 2. [Google Scholar]
Table 1. Abscissas and weights for k = 8 .
Table 1. Abscissas and weights for k = 8 .
j t j w j
1 0 . 01985507175123188415821957 . . . 0 . 05061426814518812957626567 . . .
2 0 . 10166676129318663020422303 . . . 0 . 11119051722668723527217800 . . .
3 0 . 23723379504183550709113047 . . . 0 . 15685332293894364366898110 . . .
4 0 . 40828267875217509753026193 . . . 0 . 18134189168918099148257522 . . .
5 0 . 59171732124782490246973807 . . . 0 . 18134189168918099148257522 . . .
6 0 . 76276620495816449290886952 . . . 0 . 15685332293894364366898110 . . .
7 0 . 89833323870681336979577696 . . . 0 . 11119051722668723527217800 . . .
8 0 . 98014492824876811584178043 . . . 0 . 05061426814518812957626567 . . .
Table 2. Distinct convergence radii for Example 1.
Table 2. Distinct convergence radii for Example 1.
β τ 1 τ 2 τ 3 τ λ 0 l ρ
18.888897.121486.735236.73523(0.5, 0.5, ..., 0.5 (8 times))34.9998
1 3 2.424243.19142.513122.42424(0.5, 0.5, ..., 0.5 (8 times))43.9999
1 4 1.777782.938192.145711.77778(0.25, 0.25, ..., 0.25 (8 times))43.9999
We follow in all examples the stopping criteria for programming of: (i) F ( λ l ) < 10 100 ; and (ii) λ l + 1 λ l < 10 100 .
Table 3. Distinct convergence radii for Example 2.
Table 3. Distinct convergence radii for Example 2.
β τ 1 τ 2 τ 3 τ
12.63031.728771.533911.53391
1 2 0.775790.6785550.4507810.450781
1 4 0.2319220.4545610.1579700.157970
Table 4. Convergence radii for Example 3.
Table 4. Convergence radii for Example 3.
β τ 1 τ 2 τ 3 τ λ 0 l ρ
10.3775420.165440.1343750.134375(0.09, 0.09, 0.09)34.9996
Table 5. Convergence radii for Example 3 with w 0 ( t ) = w ( t ) = e t , v ( t ) = e (call them barfunctions).
Table 5. Convergence radii for Example 3 with w 0 ( t ) = w ( t ) = e t , v ( t ) = e (call them barfunctions).
β τ 1 τ 2 τ 3 τ λ 0 l ρ
10.2452530.06508070.04970090.0497009(0.03, 0.03, 0.03)34.9994
Table 6. Different radii of convergence for Example 4.
Table 6. Different radii of convergence for Example 4.
β τ 1 τ 2 τ 3 τ λ 0 l ρ
11.033870.9634890.9421880.942188 4 . 6 45.0000
1 0.8294070.819330.8067110.806711 4 . 5 45.0000
1 3 0.9553640.9064280.8722890.872289 4 . 4 44.0000
Table 7. Different radii of convergence for Example 5.
Table 7. Different radii of convergence for Example 5.
β τ 1 τ 2 τ 3 τ λ 0 l ρ
10.006896820.0001048570.0000744280.0000744281.0000125.0000
1 . 1 0.005517460.01042110.0004598210.0004598211.000134.0000

Share and Cite

MDPI and ACS Style

Behl, R.; K. Argyros, I.; Saleh Alshomrani, A. High Convergence Order Iterative Procedures for Solving Equations Originating from Real Life Problems. Mathematics 2019, 7, 855. https://doi.org/10.3390/math7090855

AMA Style

Behl R, K. Argyros I, Saleh Alshomrani A. High Convergence Order Iterative Procedures for Solving Equations Originating from Real Life Problems. Mathematics. 2019; 7(9):855. https://doi.org/10.3390/math7090855

Chicago/Turabian Style

Behl, Ramandeep, Ioannis K. Argyros, and Ali Saleh Alshomrani. 2019. "High Convergence Order Iterative Procedures for Solving Equations Originating from Real Life Problems" Mathematics 7, no. 9: 855. https://doi.org/10.3390/math7090855

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop