Next Article in Journal
Some Common Fixed Point Theorems for Generalized F-Contraction Involving w-Distance with Some Applications to Differential Equations
Next Article in Special Issue
A Few Iterative Methods by Using [1,n]-Order Padé Approximation of Function and the Improvements
Previous Article in Journal
Use of Enumerative Combinatorics for Proving the Applicability of an Asymptotic Stability Result on Discrete-Time SIS Epidemics in Complex Networks
Previous Article in Special Issue
An Efficient Family of Optimal Eighth-Order Multiple Root Finders
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Third Order Newton-Like Method and Its Applications

1
Department of Mathematics, Banaras Hindu University, Varanasi-221005, India
2
Department of Mathematics, Texas A&M University-Kingsville, Kingsville, TX 78363-8202, USA
3
Department of Mathematics, Banaras Hindu University, Varanasi-221005, India
*
Author to whom correspondence should be addressed.
Mathematics 2019, 7(1), 31; https://doi.org/10.3390/math7010031
Submission received: 8 October 2018 / Revised: 21 November 2018 / Accepted: 7 December 2018 / Published: 30 December 2018
(This article belongs to the Special Issue Iterative Methods for Solving Nonlinear Equations and Systems)

Abstract

:
In this paper, we design a new third order Newton-like method and establish its convergence theory for finding the approximate solutions of nonlinear operator equations in the setting of Banach spaces. First, we discuss the convergence analysis of our third order Newton-like method under the ω -continuity condition. Then we apply our approach to solve nonlinear fixed point problems and Fredholm integral equations, where the first derivative of an involved operator does not necessarily satisfy the Hölder and Lipschitz continuity conditions. Several numerical examples are given, which compare the applicability of our convergence theory with the ones in the literature.

1. Introduction

Our purpose of this paper is to compute solution of nonlinear operator equation of the form
F ( x ) = 0 ,
where F : D X Y is a nonlinear operator defined on an open convex subset D of a Banach space X with values into a Banach space Y.
A lot of challenging problems in physics, numerical analysis, engineering, and applied mathematics are formulated in terms of finding roots of the equation of the form Equation (1). In order to solve such problems, we often use iterative methods. There are many iterative methods available in literature. One of the central method for solving such problems is the Newton method [1,2] defined by
x n + 1 = x n ( F x n ) 1 F ( x n )
for each n 0 , where F x denotes the Fréchet derivative of F at point x D .
The Newton method and the Newton-like method are attractive because it converges rapidly from any sufficient initial guess. A number of researchers [3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20] have generalized and established local as well as semilocal convergence analysis of the Newton method Equation (2) under the following conditions:
(a)
Lipschitz condition: F x F y K x y for all x , y D and for some K > 0 ;
(b)
Hölder Lipschitz condition: F x F y K x y p for all x , y D and for some p ( 0 , 1 ] and K > 0 ;
(c)
ω-continuity condition: F x F y ω ( x y ) for all x , y D ,where ω : [ 0 , ) [ 0 , ) is a nondecreasing and continuous function.
One can observe that the condition (c) is more general than the conditions (a) and (b). One can find numerical examples where the Lipschitz condition (a) and the Hölder continuity condition (b) on the first Fréchet derivative do not hold, but the ω -continuity condition (c) on first Fréchet derivative holds (see Example 1, [21]).
On the other hand, many mathematical problems such as differential equations, integral equations, economics theory, game theory, variational inequalities, and optimization theory ([22,23]) can be formulated into the fixed point problem:
Find x C such that x = G ( x ) ,
where G : C X is an operator defined on a nonempty subset C of a metric space X. The easiest iterative method for constructing a sequence is Picard iterative method [24] which is given by
x n + 1 = G ( x n )
for each n 0 . The Banach contraction principle (see [1,22,23,25]) provides sufficient conditions for the convergence of the iterative method Equation (4) to the fixed point of G. Banach spaces have more geometrical stricture with respect to metric spaces. For study fixed points of nonlinear smooth operators, Banach space structure is required. More details of Banach space theory and fixed point theory of nonlinear operators can be found in [1,22,23,26,27,28].
The Newton method and its variant [29,30] are also used to solve the fixed point problem of the form:
( I G ) ( x ) = 0 ,
where I is the identity operator defined on X and G : D X X is a nonlinear Fréchet differentiable operator defined on an open convex subset D of a Banach space X. For finding approximate solution of the Equation (5), Bartle [31] used the Newton-like iterative method of the form
x n + 1 = x n ( I G y n ) 1 ( I G ( x n ) )
for each n 0 , where G x is Fréchet derivative of G at point x D and { y n } is the sequence of arbitrary points in D which are sufficiently closed to the desired solution of the Equation (5). Bartle [31] has discussed the convergence analysis of the form Equation (6) under the assumption that G is Fréchet differentiable at least at desired points and a modulus of continuity is known for G as a function of x. The Newton method Equation (2) and the modified Newton method are the special cases of the form Equation (6).
Following the idea of Bartle [31], Rall [32] introduced the following Stirling method for finding a solution of the fixed point problem Equation (5):
y n = G ( x n ) , x n + 1 = x n ( I G y n ) 1 ( x n G ( x n ) )
for each n 0 . Many researchers [33,34,35] have studied the Stirling method Equation (7) and established local as well as semilocal convergence analysis of the Stirling-like method.
Recently, Parhi and Gupta [21,36] have discussed the semilocal convergence analysis of the following Stirling-like iterative method for computing a solution of operator Equation (5):
z n = G ( x n ) , y n = x n ( I G z n ) 1 ( x n G ( x n ) ) , x n + 1 = y n ( I G z n ) 1 ( y n G ( y n ) )
for each n 0 . More precisely, Parhi and Gupta [21] have studied the semilocal convergence analysis of Equation (8) for computing a solution of the operator Equation (5), where G : D X X is a nonlinear Fréchet differentiable operator defined on an open convex subset D under the condition:
( Ω ) G x k   for   all   x D   and   for   some   k ( 0 , 1 3 ] .
There are some nonlinear Fréchet differentiable operators G : D X X defined on an open convex subset D which fail to satisfy the condition ( Ω ) (see Example 1). Therefore, ref. [21] (Theorem 1) is not applicable for such operators. So, there is the following natural question:
Problem 1.
Is it possible to develop the Stirling-like iterative method for computing a solution of the operator Equation (5), where the condition (Ω) does not hold?
The main purpose of this paper is to design a new Newton-like method for solving the operator Equation (1) and provide an affirmative answer of the Problem 1. We prove our proposed Newton-like method has R-order of convergence at least 2 p + 1 under the ω -continuity condition and it covers a wide variety of iterative methods. We derive the Stirling-like iterative method for computing a solution of the fixed point problem Equation (5), where ( Ω ) does not hold and hence it gives an affirmative answer to Question 1 and generalizes the results of Parhi and Gupta [21,36] in the context of the condition ( Ω ).
In Section 2, we summarize some known concepts and results. In Section 3, we introduce a new Newton-like method for solving the operator Equation (1) and establish convergence theory of the proposed Newton-like method. In Section 4, we derive the Stirling-like iterative method from the proposed Newton-like method and establish a convergence theorem for computing a solution of the fixed point problem. Applications to Fredholm integral equations are also presented in Section 5, together with several numerical examples, which compare the applicability of our iterative technique with the ones in the literature.

2. Preliminary

In this section, we discuss some technical results. Throughout the paper, we denote B ( X , Y ) a collection of bounded linear operators from a Banach space X into a Banach space Y and B ( X ) = B ( X , X ) . For some r > 0 , B r [ x ] and B r ( x ) are the closed and open balls with center x and radius r, respectively, N 0 = N { 0 } and Φ denote the collection of nonnegative, nondecreasing, continuous real valued functions defined on [ 0 , ) .
Lemma 1.
(Rall [37] (p. 50)) Let L be a bounded linear operator on a Banach space X. Then L 1 exists if and only if there is a bounded linear operator M in X such that M 1 exists and
M L < 1 M 1 .
If L 1 exists, then we have
L 1 M 1 1 1 M 1 L M 1 1 M 1 M L .
Lemma 2.
Let 0 < k 1 3 be a real number. Assume that q = 1 p + 1 + k p for any p ( 0 , 1 ] and the scalar equation
1 k p ( 1 + q t ) p t p + 1 q p t p p + 1 + k p p q p t 2 p = 0
has a minimum positive root α. Then we have the following:
(1) 
q > k for all p ( 0 , 1 ] .
(2) 
α ( 0 , 1 ) .
Proof. 
(1) This part is obvious. Indeed, we have
1 p + 1 + k p 1 3 = 2 p 3 ( 1 + p ) + k p > 0
for all p ( 0 , 1 ] and 0 < k 1 3 .
(2) Set
g ( t ) = 1 k p ( 1 + q t ) p t p + 1 q p t p p + 1 + k p p q p t 2 p .
It is clear from the definition of g ( t ) that g ( 0 ) > 0 , g ( 1 ) < 0 and g ( t ) < 0 in ( 0 , 1 ) . Therefore, g ( t ) is decreasing in ( 0 , 1 ) and hence the Equation (9) has a minimum positive root α ( 0 , 1 ) . This completes the proof. □
Lemma 3.
Let b 0 ( 0 , α ) be a number such that k p ( 1 + q b 0 ) p b 0 < 1 , where k , p , α and q are same as in Lemma 2. Define the real sequences { b n } , { θ n } and { γ n } by
b n + 1 = q p b n p p + 1 + k p p q p b n 2 p 1 k p ( 1 + q b n ) p b n p + 1 b n ,
θ n = q p b n p p + 1 + k p q b n 2 1 k p ( 1 + q b n ) p b n , γ n = 1 1 k p ( 1 + q b n ) p b n
for each n N 0 . Then we have the following:
(1) 
q p b 0 p p + 1 + k p p q p b 0 2 p 1 k p ( 1 + q b 0 ) p b 0 p + 1 < 1 .
(2) 
The sequence { b n } is decreasing, that is b n + 1 b n for all n N 0 .
(3) 
k p ( 1 + q b n ) p b n < 1 for all n N 0 .
(4) 
b n + 1 ξ ( 2 p + 1 ) n b n for all n N 0 .
(5) 
θ n ξ ( 2 p + 1 ) n 1 p θ for all n N 0 , where θ 0 = θ and ξ = γ 0 θ p .
Proof. 
(1)
Since the scalar equation g ( t ) = 0 defined by Equation (9) has a minimum positive root α ( 0 , 1 ) and g ( t ) is decreasing in ( 0 , 1 ) with g ( 0 ) > 0 and g ( 1 ) < 0 . Therefore, g ( t ) > 0 in the interval ( 0 , α ) and hence
q p b 0 p p + 1 + k p p q p b 0 2 p 1 k p ( 1 + q b 0 ) p b 0 p + 1 < 1 .
(2)
From (1) and Equation (10), we have b 1 b 0 . This shows that (2) is true for n = 0 . Let j 0 be a fixed positive integer. Assume that (2) is true for n = 0 , 1 , 2 , , j . Now, using Equation (10), we have
b j + 2 = q p b j + 1 p p + 1 + k p p q p b j + 1 2 p 1 k p ( 1 + q b j + 1 ) p b j + 1 p + 1 b j + 1 q p b j p p + 1 + k p p q p b j 2 p 1 k p ( 1 + q b j ) p b n p + 1 b j = b j + 1 .
Thus ( 2 ) holds for n = j + 1 . Therefore, by induction, ( 2 ) holds for all n N 0 .
(3)
Since b n < b n 1 for each n = 1 , 2 , 3 , and k p ( 1 + q b 0 ) p b 0 < 1 for all p ( 0 , 1 ] , it follows that
k p ( 1 + q b n ) p b n < k p ( 1 + q b 0 ) p b 0 < 1 .
(4)
From (3), one can easily prove that the sequences { γ n } and { θ n } are well defined. Using Equations (10) and (11), one can easily observe that
b n + 1 = γ n θ n p b n
for each n N 0 . Put n = 0 and n = 1 in Equation (12), we have
b 1 = γ 0 θ p b 0 = ξ ( 2 p + 1 ) 0 b 0
and
b 2 = q p b 1 p p + 1 + k p p q p b 1 2 p 1 k p ( 1 + q b 1 ) p b 1 p + 1 b 1 q p b 0 p p + 1 + k p p q p ( ξ b 0 ) 2 p 1 k p ( 1 + q b 0 ) p b 0 p + 1 b 1 ξ 2 p q p b 0 p p + 1 + k p p q p b 0 2 p 1 k p ( 1 + q b 0 ) p b 0 p + 1 b 1 = ξ 2 p γ 0 θ p b 1 = ξ 2 p + 1 b 1 .
Hence ( 4 ) holds for n = 0 and n = 1 . Let j > 1 be a fixed integer. Assume that ( 4 ) holds for each n = 0 , 1 , 2 , j . From Equations (11) and (12), we have
b j + 2 = q p b j + 1 p p + 1 + k p p q p b j + 1 2 p 1 k p ( 1 + q b j + 1 ) p b j + 1 p + 1 b j + 1 q p b j + 1 p p + 1 + k p p q p ( ξ ( 2 p + 1 ) j b j ) 2 p 1 k p ( 1 + q b j + 1 ) p b j + 1 p + 1 b j + 1 ( ξ 2 p ( 2 p + 1 ) j ) q p b j p p + 1 + k p p q p b j 2 p 1 k p ( 1 + q b j ) p b j p + 1 b j + 1 ξ 2 p ( 2 p + 1 ) j ξ 2 p ( 2 p + 1 ) j 1 ξ 2 p ( 2 p + 1 ) ξ ( 2 p + 1 ) b j + 1 = ξ ( 2 p + 1 ) j + 1 b j + 1 .
Thus ( 4 ) holds for n = j + 1 . Therefore, by induction, ( 4 ) holds for all n N 0 .
(5)
From Equation (11) and (4), one can easily observe that
θ 1 = q p b 1 p p + 1 + k p q b 1 2 1 k p ( 1 + q b 1 ) p b 1 q p b 0 p p + 1 + k p q ( ξ b 0 ) 2 1 k p ( 1 + q b 0 ) p b 0 ξ ( 2 p + 1 ) 1 1 p θ .
Hence ( 5 ) holds for n = 1 . Let j > 1 be a fixed integer. Assume that ( 5 ) holds for each n = 0 , 1 , 2 , j . From Equation (11), we have
θ j + 1 = q p b j + 1 p p + 1 + k p q b j + 1 2 1 k p ( 1 + q b j + 1 ) p b j + 1 q p b 0 p p + 1 + k p q ξ ( 2 p + 1 ) j + 1 1 2 p b 0 2 1 k p ( 1 + q b 0 ) p b 0 = ξ ( 2 p + 1 ) j + 1 1 p θ .
Thus ( 5 ) holds for n = j + 1 . Therefore, by induction, ( v ) holds for all n N 0 . This completes the proof. □

3. Computation of a Solution of the Operator Equation (1)

Let X and Y be Banach spaces and D be a nonempty open convex subset of X. Let F : D X Y be a nonlinear operator such that F is Fréchet differentiable at each point of D and let L B ( Y , X ) such that ( I L F ) ( D ) D . To solve the operator Equation (1), we introduce the Newton-like algorithm as follows:
Starting with x 0 D and after x n D is defined, we define the next iterate x n + 1 as follows:
z n = ( I L F ) ( x n ) , y n = ( I F z n 1 F ) ( x n ) , x n + 1 = ( I F z n 1 F ) ( y n )
for each n N 0 .
If we take X = Y , F = I G and L = I B ( X ) in Equation (13), then the iteration process Equation (13) reduces to the Stirling-like iteration process Equation (8).
Before proving the main result of the paper, we establish the following:
Proposition 1.
Let D be a nonempty open convex subset of a Banach space X, F : D X Y be a Fréchet differentiable at each point of D with values in a Banach space Y and L B ( Y , X ) such that ( I L F ) ( D ) D . Let ω : [ 0 , ) [ 0 , ) be a nondecreasing and continuous real-valued function. Assume that F satisfies the following conditions:
(1) 
F x F y ω ( x y ) for all x , y D ;
(2) 
I L F x c for all x D and for some c ( 0 , ) .
Define a mapping T : D D by
T ( x ) = ( I L F ) ( x )
for all x D . Then we have
I F T x 1 F T y F T x 1 ω ( c x y )
for all x , y D .
Proof. 
For any x , y D , we have
I F T x 1 F T y F T x 1 F T x F T y F T x 1 ω ( T x T y ) = F T x 1 ω ( x y L ( F ( x ) F ( y ) ) ) = F T x 1 ω x y L 0 1 F y + t ( x y ) ( x y ) d t F T x 1 ω 0 1 I L F y + t ( x y ) d t x y F T x 1 ω ( c x y ) .
This completes the proof. □
Now, we are ready to prove our main results for solving the problem Equation (1) in the framework of Banach spaces.
Theorem 1.
Let D be a nonempty open convex subset of a Banach space X, F : D X Y a Fréchet differentiable at each point of D with values in a Banach space Y and L B ( Y , X ) such that ( I L F ) ( D ) D . Let x 0 D be such that z 0 = x 0 L F ( x 0 ) and F z 0 1 B ( Y , X ) exist. Let ω Φ and let α be the solution of the Equation (9). Assume that the following conditions hold:
(C1) 
F x F y ω ( x y ) for all x , y D ;
(C2) 
I L F x k for all x D and for some k ( 0 , 1 3 ] ;
(C3) 
F z 0 1 β for some β > 0 ;
(C4) 
F z 0 1 F ( x 0 ) η for some η > 0 ;
(C5) 
ω ( t s ) t p ω ( s ) , s [ 0 , ) , t [ 0 , 1 ] and p ( 0 , 1 ] ;
(C6) 
b 0 = β ω ( η ) < α , q = 1 p + 1 + k p , θ = q p b 0 p p + 1 + k p q b 0 2 1 k p ( 1 + q b 0 ) p b 0 and B r [ x 0 ] D , where r = 1 + q 1 θ η .
Then we have the following:
(1) 
The sequence { x n } generated by Equation (13) is well defined, remains in B r [ x 0 ] and satisfies the following estimates:
y n 1 z n 1 k y n 1 x n 1 , x n y n 1 q b n 1 y n 1 x n 1 , x n x n 1 ( 1 + q b n 1 ) y n 1 x n 1 , F z n 1 e x i s t s a n d F z n 1 γ n 1 F z n 1 1 , y n x n θ n 1 y n 1 x n 1 θ n y 0 x 0 , F z n 1 ω ( y n x n ) b n
for all n N , where z n , y n B r [ x 0 ] , the sequences { b n } , { θ n } , and { γ n } are defined by Equations (10) and (11), respectively.
(2) 
The sequence { x n } converges to the solution x * B r [ x 0 ] of the Equation (1).
(3) 
The priory error bounds on x * is given by:
x n x * ( 1 + q b 0 ) η ξ 1 / 2 p 2 1 ξ ( 2 p + 1 ) n p γ 0 1 p γ 0 n / p ξ 1 / 2 p 2 ( 2 p + 1 ) n
for each n N 0 .
(4) 
The sequence { x n } has R-order of convergence at least 2 p + 1 .
Proof. 
(1) First, we show that Equation (15) is true for n = 1 . Since x 0 D , y 0 = x 0 F z 0 1 F ( x 0 ) is well defined. Note that
y 0 x 0 = F z 0 1 F ( x 0 ) η < r .
Hence y 0 B r [ x 0 ] . Using Equation (13), we have
y 0 z 0 = F z 0 1 F ( x 0 ) + L F ( x 0 ) = y 0 x 0 L F z 0 ( y 0 x 0 ) I L F z 0 y 0 x 0 k y 0 x 0 .
By Proposition 1 and ( C 2 ) , we have
x 1 y 0 = F z 0 1 ( F ( y 0 ) F ( x 0 ) F z 0 ( y 0 x 0 ) ) 0 1 F z 0 1 ( F x 0 + t ( y 0 x 0 ) F y 0 + F y 0 F z 0 ) y 0 x 0 d t β 0 1 ( F x 0 + t ( y 0 x 0 ) F y 0 ) d t + F y 0 F z 0 y 0 x 0 = β 0 1 ω ( ( 1 t ) y 0 x 0 ) d t + ω ( y 0 z 0 ) y 0 x 0 = β 0 1 ( 1 t ) p ω ( y 0 x 0 ) d t + ω ( k y 0 x 0 ) y 0 x 0 = β 0 1 ( 1 t ) p ω ( y 0 x 0 ) d t + k p ω ( y 0 x 0 ) y 0 x 0 β 1 p + 1 + k p ω ( y 0 x 0 ) y 0 x 0 q β ω ( η ) y 0 x 0 q b 0 y 0 x 0 .
Thus we have
x 1 x 0 x 1 y 0 + y 0 x 0 q b 0 y 0 x 0 + y 0 x 0 ( 1 + q b 0 ) y 0 x 0 < r ,
which shows that x 1 B r [ x 0 ] . Note that z 1 = ( I L F ) ( x 1 ) D . Using Proposition 1 and ( C 3 ) ( C 5 ) , we have
I F z 0 1 F z 1 F z 0 1 ω ( k x 1 x 0 ) β ω ( k ( 1 + q b 0 ) y 0 x 0 ) β k p ( 1 + q b 0 ) p ω ( y 0 x 0 ) k p ( 1 + q b 0 ) p β ω ( η ) ( k ( 1 + q b 0 ) ) p b 0 < 1 .
Therefore, by Lemma 1, F z 1 1 exists and
F z 1 1 F z 0 1 1 ( k ( 1 + q b 0 ) ) p b 0 = γ 0 F z 0 1 .
Subsequently, we have
y 1 x 1 = F z 1 1 F ( x 1 ) = F z 1 1 ( F ( x 1 ) F ( y 0 ) F z 0 ( x 1 y 0 ) ) F z 1 1 0 1 ( F y 0 + t ( x 1 y 0 ) F y 0 ) d t + F y 0 F z 0 x 1 y 0 F z 1 1 1 p + 1 ω ( x 1 y 0 ) + ω ( k y 0 x 0 ) x 1 y 0 F z 1 1 1 p + 1 ω ( q b 0 x 0 y 0 ) + k p ω ( y 0 x 0 ) q b 0 x 0 y 0 F z 1 1 q p b 0 p p + 1 ω ( y 0 x 0 ) + k p ω ( y 0 x 0 ) q b 0 y 0 x 0 γ 0 q p b 0 p p + 1 + k p β ω ( η ) q b 0 y 0 x 0 q p b 0 p p + 1 + k p q b 0 2 1 ( k ( 1 + q b 0 ) ) p b 0 y 0 x 0 θ y 0 x 0 .
From Equations (16) and (18), we have
y 1 x 0 y 1 x 1 + x 1 x 0 θ y 0 x 0 + ( 1 + q b 0 ) y 0 x 0 ( 1 + q b 0 ) θ y 0 x 0 + ( 1 + q b 0 ) y 0 x 0 ( 1 + q b 0 ) ( 1 + θ ) η < r
and
z 1 x 0 | z 1 y 1 + y 1 x 1 + x 1 x 0 ( 1 + k ) y 1 x 1 + ( 1 + q b 0 ) y 0 x 0 ( 1 + q ) θ η + ( 1 + q ) η = ( 1 + q ) ( 1 + θ ) η < r .
This shows that z 1 , y 1 B r [ x 0 ] . From Equations (17) and (18), we get
F z 1 1 ω ( y 1 x 1 ) γ 0 F z 0 1 ω ( θ y 0 x 0 ) γ 0 θ p β ω ( η ) γ 0 θ p b 0 = b 1 .
Thus we see that Equation (15) holds for n = 1 .
Let j > 1 be a fixed integer. Assume that Equation (15) is true for n = 1 , 2 , , j . Since x j B r [ x 0 ] , it follows z j = ( I L F ) ( x j ) D . Using ( C 3 ) , ( C 4 ) , Equations (13) and (15), we have
y j z j = L F ( x j ) F z j 1 F ( x j ) = ( L F z j 1 ) F ( x j ) = ( L F z j 1 ) F z j ( x j y j ) I L F z j y j x j k y j x j .
Using Equations (13) and (19), we have
x j + 1 y j = F z j 1 F ( y j ) F z j 1 F ( y j ) F ( x j ) F z j ( y j x j ) F z j 1 0 1 F x j + t ( y j x j ) F z j d t y j x j F z j 1 0 1 F x j + t ( y j x j ) F y j d t + F y j F z j y j x j = F z j 1 0 1 ω ( x j + t ( y j x j ) y j ) d t + ω ( y j z j ) y j x j F z j 1 0 1 ω ( ( 1 t ) y j x j ) d t + ω ( k y j x j ) y j x j F z j 1 0 1 ( ( 1 t ) p + k p ) ω ( y j x j ) d t y j x j F z j 1 1 p + 1 + k p ω ( y j x j ) y j x j = q F z j 1 ω ( y j x j ) y j x j = q b j y j x j .
From Equation (20), we have
x j + 1 x j x j + 1 y j + y j x j q b j y j x j + y j x j ( 1 + q b j ) y j x j .
Using Equations (20) and (21) and the triangular inequality, we have
x j + 1 x 0 s = 0 j x s + 1 x s s = 0 j ( 1 + q b s ) y s x s s = 0 j ( 1 + q b 0 ) θ s y 0 x 0 ( 1 + q b 0 ) 1 θ j + 1 1 θ η ( 1 + q ) η 1 θ = r ,
which implies that x k + 1 B r [ x 0 ] . Again, by using Proposition 1, ( C 2 ) , ( C 5 ) , and Equation (21), we have
I F z j 1 F z j + 1 F z j 1 ω ( k x j + 1 x j ) F z j 1 k p ( 1 + q b j ) p ω ( y j x j ) k p ( 1 + q b j ) p b j < 1 .
Therefore, by Lemma 1, F z j + 1 1 exists and
F z j + 1 1 F z j 1 1 k p ( 1 + q b j ) p b j = γ j F z j 1 .
Using Equations (13), ( C 2 ) , and (21), we have
y j + 1 x j + 1 = F z j + 1 1 F ( x j + 1 ) = F z j + 1 1 ( F ( x j + 1 ) F ( y j ) F z j ( x j + 1 y j ) ) F z j + 1 1 0 1 F y j + t ( x j + 1 y j ) F y j d t + F y j F z j x j + 1 y j F z j + 1 1 0 1 ω ( t x j + 1 y j ) d t + ω ( y j z j ) x j + 1 y j F z j + 1 1 0 1 ω ( t q b j y j x j ) d t + ω ( k y j x j ) q b j y j x j γ j F z j 1 q p b j p p + 1 ω ( y j x j ) + k p ω ( y j x j ) q b j y j x j = γ j q p b j p p + 1 + k p F z j 1 ω ( y j x j ) q b j y j x j γ j q p b j p p + 1 + k p q b j 2 y j x j θ j y j x j θ j + 1 y 0 x 0 ,
y j + 1 x 0 y j + 1 x j + 1 + x j + 1 x 0 θ j + 1 y 0 x 0 + s = 0 j x s + 1 x s θ j + 1 y 0 x 0 + s = 0 j ( 1 + q b 0 ) θ s y 0 x 0 ( 1 + q b 0 ) s = 0 j + 1 θ s η ( 1 + q ) η 1 θ = r
and
z j + 1 x 0 z j + 1 y j + 1 + y j + 1 x j + 1 + x j + 1 x 0 ( 1 + k ) y j + 1 x j + 1 + s = 0 j ( 1 + q b 0 ) θ s η ( 1 + q ) θ j + 1 η + s = 0 j ( 1 + q ) θ s η s = 0 j + 1 ( 1 + q ) θ s η < r
which implies that z j + 1 , y j + 1 B r ( x 0 ) . Also, we have
F z j + 1 1 ω ( y j + 1 x j + 1 ) γ j F z j 1 ω ( θ j y j x j ) γ j θ j p F z j 1 ω ( y j x j ) γ j θ j p b j = b j + 1 .
Hence we conclude that Equation (15) is true for n = j + 1 . Therefore, by induction, Equation (15) is true for all n N 0 .
(2) First, we show that the sequence { x n } is a Cauchy sequence. For this, letting m , n N 0 and using Lemma 3, we have
x m + n x n j = n m + n 1 x j + 1 x j j = n m + n 1 ( 1 + q b j ) y j x j ( 1 + q b 0 ) j = n m + n 1 i = 0 j 1 θ i y 0 x 0 ( 1 + q b 0 ) j = n m + n 1 i = 0 j 1 ξ ( 2 p + 1 ) i 1 p θ y 0 x 0 ( 1 + q b 0 ) j = n m + n 1 i = 0 j 1 ξ ( 2 p + 1 ) i p γ 0 1 p y 0 x 0 = ( 1 + q b 0 ) j = n m + n 1 ξ i = 0 j 1 ( 2 p + 1 ) i p γ 0 1 p y 0 x 0 ( 1 + q b 0 ) j = n m + n 1 ξ ( 2 p + 1 ) j 1 2 p 2 γ 0 j p y 0 x 0 .
By Bernoulli’s inequality, for each j 0 and y > 1 , we have ( 1 + y ) j 1 + j y . Hence we have
x m + n x n ( 1 + q b 0 ) ξ 1 2 p 2 γ 0 n p ξ ( 2 p + 1 ) n 2 p 2 + ξ ( 2 p + 1 ) n ( 2 p + 1 ) 2 p 2 γ 0 1 p + + ξ ( 2 p + 1 ) n ( 2 p + 1 ) m 1 2 p 2 γ 0 ( m 1 ) p η ( 1 + q b 0 ) ξ 1 2 p 2 γ 0 n p ξ ( 2 p + 1 ) n 2 p 2 + ξ ( 2 p + 1 ) n ( 1 + 2 p ) 2 p 2 γ 0 1 p + + ξ ( 2 p + 1 ) n ( 1 + 2 ( m 1 ) p ) 2 p 2 γ 0 ( m 1 ) p η = ( 1 + q b 0 ) ξ 1 2 p 2 γ 0 n p ξ ( 2 p + 1 ) n 2 p 2 + ξ ( 2 p + 1 ) n 1 2 p 2 + 1 p γ 0 1 p + + ξ ( 2 p + 1 ) n 1 2 p 2 + m 1 p γ 0 ( m 1 ) p η = ( 1 + q b 0 ) ξ ( 2 p + 1 ) n 1 2 p 2 γ 0 n p 1 + ξ ( 2 p + 1 ) n γ 0 1 1 p + + ξ ( 2 p + 1 ) n γ 0 1 m 1 p η = ( 1 + q b 0 ) ξ ( 2 p + 1 ) n 1 2 p 2 γ 0 n p 1 ξ ( 2 p + 1 ) n γ 0 1 m p 1 ξ ( 2 p + 1 ) n γ 0 1 1 p η .
Since the sequence { x n } is a Cauchy sequence and hence it converges to some point x * B r [ x 0 ] . From Equations (13), ( C 2 ) , and (15), we have
L F ( x n ) z n y n + y n x n k y n x n + y n x n ( 1 + k ) θ n η .
Taking the limit as n and using the continuity of F and the linearity of L, we have
F ( x * ) = 0 .
(3) Taking the limit as m in Equation (22), we have
x * x n ( 1 + q b 0 ) η ξ 1 / 2 p 2 1 ξ ( 2 p + 1 ) n p γ 0 1 p γ 0 n / p ξ 1 / 2 p 2 ( 2 p + 1 ) n
for each n N 0 .
(4) Here we prove
x n + 1 x * x n x * 2 p + 1 K
for all n N 0 and for some K > 0 . One can easily observe that there exists n 0 > 0 such that
x n x * < 1
whenever n n 0 . Using Equations (13) and (24), we have
z n x * = x n x * L F ( x n ) = x n x * L ( F ( x n ) F ( x * ) ) = x n x * L 0 1 F x * + t ( x n x * ) ( x n x * ) d t 0 1 I L F x * + t ( x n x * ) x n x * d t k x n x *
and
y n x * = x n x * F z n 1 F ( x n ) = F z n 1 [ F z n ( x n x * ) F ( x n ) ] F z n 1 F ( x n ) x * F z n ( x n x * ) = F z n 1 0 1 ( F x * + t ( x n x * ) F z n ) ( x n x * ) d t F z n 1 0 1 F x * + t ( x n x * ) F z n x n x * d t F z n 1 0 1 ( F x * + t ( x n x * ) F x * + F x * F z n ) x n x * d t F z n 1 0 1 ( ω ( t x n x * ) + ω ( z n x * ) ) x n x * d t F z n 1 0 1 ( t p x n x * p ω ( 1 ) + ω ( k x n x * ) ) x n x * d t F z n 1 1 p + 1 + k p ω ( 1 ) x n x * p + 1 = F z n 1 q ω ( 1 ) x n x * p + 1 .
Using Equations (13), (24) and (25), we have
x n + 1 x * = y n F z n 1 F ( y n ) x * F z n 1 F ( y n ) F ( x * ) F z n ( y n x * ) = F z n 1 0 1 ( F x * + t ( y n x * ) F z n ) ( y n x * ) d t F z n 1 0 1 F x * + t ( y n x * ) F z n y n x * d t = F z n 1 0 1 ( F x * + t ( y n x * ) F x * + F x * F z n ) y n x * d t F z n 1 0 1 ( ω ( t y n x * ) + ω ( k x n x * ) ) y n x * d t = F z n 1 0 1 t p ω F z n 1 q ω ( 1 ) x n x * p + 1 + ω ( k x n x * ) d t × F z n 1 q ω ( 1 ) x n x * p + 1 F z n 1 2 0 1 t p x n x * p ( p + 1 ) ω F z n 1 q ω ( 1 ) + k p x n x * p ω ( 1 ) d t × q ω ( 1 ) x n x * p + 1 = F z n 1 2 x n x * p 2 ω F z n 1 q ω ( 1 ) p + 1 + k p q ω ( 1 ) x n x * 2 p + 1 = K n x n x * 2 p + 1 ,
where
K n = F z n 1 2 x n x * p 2 ω F z n 1 q ω ( 1 ) p + 1 + k p q ω ( 1 ) .
Let F x * 1 d and 0 < d < ω ( σ ) 1 , where σ > 0 . Then, for all x B σ ( x * ) , we have
I F x * 1 F x F x * 1 F x * F x d ω ( σ ) < 1
and so, by Lemma 1, we have
F x 1 d 1 d ω ( σ ) : = λ .
Since x n x * and z n x * as n , there exists a positive integer N 0 such that
F z n 1 d 1 d ω ( σ )
for all n N 0 . Thus, for all n N 0 , one can easily observe that
K n λ 2 σ p 2 ω λ q ω ( 1 ) p + 1 + k p q ω ( 1 ) = K .
This shows that the R-order of convergence at least ( 2 p + 1 ) . This completes the proof. □

4. Applications

4.1. Fixed Points of Smooth Operators

Let X be a Banach spaces and D be a nonempty open convex subset of X. Let G : D X X be a nonlinear operator such that D is Fréchet differentiable at each point of D and let L B ( X , X ) such that ( I L ( I G ) ) ( D ) D . For F = I G , the Newton-like algorithm Equation (13) reduces to the following Stirling-like method for computing fixed point of the operator G:
Starting with x 0 D and after x n D is defined, we define the next iterate x n + 1 as follows:
z n = ( I L ( I G ) ) ( x n ) , y n = ( I ( I G z n ) 1 ( I G ) ) ( x n ) , x n + 1 = ( I ( I G z n ) 1 ( I G ) ) ( y n )
for each n N 0 .
For the choice of X = Y and F = I G , Theorem 1 reduces to the following:
Theorem 2.
Let D be a nonempty open convex subset of a Banach space X, G : D X be a Fréchet differentiable at each point of D with values into itself. Let L B ( X ) be such that ( I L ( I G ) ) ( D ) D . Let x 0 D be such that z 0 = x 0 L ( x 0 G ( x 0 ) ) and let ( I G z 0 ) 1 B ( X ) exist. Let ω Φ and α be a solution of the Equation (9). Assume that the conditions ( C 5 ) ( C 6 ) and the following conditions hold:
(C7) 
( I G z 0 ) 1 β for some β > 0 ;
(C8) 
( I G z 0 ) 1 ( x 0 G ( x 0 ) ) η for some η > 0 ;
(C9) 
G x G y ω ( x y ) for all x , y D ;
(C10) 
I L ( I G x ) k for all x D and for some k ( 0 , 1 3 ] .
Then the sequence { x n } generated by Equation (26) is well defined, remains in B r [ x 0 ] and converges to the fixed point x * B r [ x 0 ] of the operator G and the sequence { x n } has R-order of convergence at least 2 p + 1 .
We give an example to illustrate Theorem 2.
Example 1.
Let X = Y = R and D = ( 1 , 1 ) X . Define a mapping G : D R by
G ( x ) = 1.1 x 3 x 6
for all x D . Define L : R R by L ( x ) = 7.9 7 x for all x R . One can easily observe that
( I L ( I G ) ) ( x ) D
for all x D . Clearly, G is differentiable on D and its derivative at x D is G x = 3.3 x 2 1 6 and G x is bounded with G x 0.3833 for all x D and G satisfies the Lipschitz condition
G x G y K x y
for all x , y D , where K = 1.1 . For x 0 = 0.3 , we have
z 0 = ( I L ( I G ) ) ( x 0 ) = 0.0894135714 , ( I G z 0 ) 1 0.860385626 = β ,
( I G z 0 ) 1 ( x 0 G ( x 0 ) ) 0.29687606 = η .
For p = 1 , q = 5 6 and ω ( t ) = K t for all t 0 , we have
b 0 = β ω ( η ) = 0.280970684 < 1 ,
θ = q p b 0 p p + 1 + k p q b 0 2 1 k ( 1 + q b 0 ) b 0 = 0.0335033167 < 1
and r = 0.563139828 . Hence all the conditions of Theorem 2 are satisfied. Therefore, the sequence { x n } generated by Equation (26) is in B r [ x 0 ] and it converges to the fixed point x * = 0 B r [ x 0 ] of G.
Remark 1.
In Example 1, G x 0.38333 > 1 3 . Thus the condition (Ω) does not hold and so we can not apply Parhi and Gupta [21] (Theorem 1) for finding fixed points of the operators like G defined by (27). Thus the Stirling-like method defined by Equation (26) provides an affirmative answer of the Problem 1.
If the condition ( Ω ) holds, then Theorem 2 with L = I reduces to the main result of Parhi and Gupta [21] as follows:
Corollary 1.
[21] (Theorem 1) Let D be a nonempty open convex subset of a Banach space X and G : D D be a Fréchet differentiable operator and let x 0 D with z 0 = G ( x 0 ) . Let ( I G z 0 ) 1 B ( X ) exists and ω Φ . Assume that the conditions ( C 5 ) ( C 9 ) and the following condition holds:
(C11)  G x k for all x D and for some k ( 0 , 1 3 ] .
Then the sequence { x n } generated by Equation (8) is well defined, remains in B r [ x 0 ] and converges to the fixed point x * B r [ x 0 ] of the operator G with R order of the convergence at least 2 p + 1 .
Example 2.
Let X = Y = R and D = ( 6 , 6 ) X . Define a mapping G : D R by
G ( x ) = 2 + e sin x 5
for all x D . It is obvious that G is Fréchet differentiable on D and its Fréchet derivative at x D is G x = cos x 5 e sin x 5 . Clearly, G x is bounded with G x 0.22 < 1 3 = k and
G x G y K x y
for all x , y D , where K = 0.245 . For x 0 = 0 , we have
z 0 = G ( x 0 ) = 3 , ( I G z 0 ) 1 0.834725586524139 = β
and
( I G z 0 ) 1 ( x 0 G ( x 0 ) ) 2.504176759572418 = η .
For p = 1 , q = 5 6 and ω ( t ) = K t for all t 0 , we have
b 0 = β K η = 0.512123601526580 < 1 ,
θ = q p b 0 p p + 1 + k p q b 0 2 1 k ( 1 + q b 0 ) b 0 = 0.073280601270728 < 1
and r = 5.147038576039456 .
Hence all the conditions of Theorem 2 with L = I are satisfied. Therefore, the sequence { x n } generated by Equation (26) is in B r [ x 0 ] and it converges to the fixed point x * = 3.023785446275295 B r [ x 0 ] of G (Table 1).

4.2. Fredholm Integral Equations

Let X be a Banach space over the field F ( R or C ) with the norm · and D be an open convex subset of X. Further, let B ( X ) be the Banach space of bounded linear operators from X into itself. Let S B ( X ) , u X and λ F . We investigate a solution x X of the nonlinear Fredholm-type operator equation:
x λ S Q ( x ) = u ,
where Q : D X is continuously Fréchet differentiable on D. The operator Equation (28) has been discussed in [10,38,39]. Define an operator F : D X by
F ( x ) = x λ S Q ( x ) u
for all x D . Then solving the operator Equation (29) is equivalent to solving the operator Equation (1). From Equation (29), we have
F x ( h ) = h λ S Q x ( h )
for all h X . Now, we apply Theorem 1 to solve the operator Equation (28).
Theorem 3.
Let X be a Banach space and D an open convex subset of X. Let Q : D X be a continuously Fréchet differentiable mapping at each point of D. Let L , S B ( X ) and u X . Assume that, for any x 0 D , z 0 = x 0 L ( x 0 λ S Q ( x 0 ) u ) and ( I λ S Q z 0 ) 1 exist. Assume that the condition ( C 6 ) and the following conditions hold:
(C12) 
( I L ( I λ S Q ) ) ( x ) u D for all x D ;
(C13) 
( I λ S Q z 0 ) 1 β for some β > 0 ;
(C14) 
( I λ S Q z 0 ) 1 ( x 0 λ S Q ( x 0 ) u ) η for some η > 0 ;
(C15) 
Q x Q y ω 0 ( x y ) for all x , y D , where ω 0 Φ ;
(C16) 
ω 0 ( s t ) s p ω 0 ( t ) , s [ 0 , 1 ] and t [ 0 , ) ;
(C17) 
I L ( I λ S Q x ) k , k 1 3 for all x D .
Then we have the following:
(1) The sequence { x n } generated by
z n = x n L ( x n λ S Q ( x n ) u ) , y n = x n ( I λ S Q z n ) 1 ( x n λ S Q ( x n ) u ) , x n + 1 = y n ( I λ S Q z n ) 1 ( y n λ S Q ( y n ) u )
for each n N 0 is well defined, remains in B r [ x 0 ] and converges to a solution x * of the Equation (28).
(2) The R-order convergence of sequence { x n } is at least 2 p + 1 .
Proof. 
Let F : D X be an operator defined by Equation (29). Clearly, F is Fréchet differentiable at each point of D and its Fréchet derivative at x D is given by Equation (30). Now, from ( C 13 ) and Equation (30), we have F z 0 1 β and so it follows that ( C 3 ) holds. From ( C 14 ) , Equations (29) and (30), we have F z 0 1 ( F ( x 0 ) ) η . Hence ( C 4 ) is satisfied. For all x , y D , using ( C 15 ) , we have
F x F y = sup { ( F x F y ) z : z X , z = 1 } | λ | S sup { Q x Q y z : z X , z = 1 } | λ | S ω 0 ( x y ) = ω ( x y ) ,
where ω ( t ) = | λ | S ω 0 ( t ) . Clearly, ω Φ and, from ( C 16 ) , we have
ω ( s t ) s p ω ( t )
for all s [ 0 , 1 ] and t ( 0 , ] . Thus ( C 1 ) and ( C 5 ) hold. ( C 2 ) follows from ( C 17 ) for c = k ( 0 , 1 3 ] . Hence all the conditions of Theorem 1 are satisfied. Therefore, Theorem 3 follows from Theorem 1. This completes the proof. □
Let D = X = Y = C [ a , b ] be the space of all continuous real valued functions defined on [ a , b ] R with the norm x = sup t [ a , b ] | x ( t ) | . Consider, the following nonlinear integral equation:
x ( s ) = g ( s ) + λ a b K ( s , t ) ( μ ( x ( t ) ) 1 + p + ν ( x ( t ) ) 2 ) d t
for all s [ a , b ] and p ( 0 , 1 ] , where g , x C [ a , b ] with g ( s ) 0 for all s [ a , b ] , K : [ a , b ] × [ a , b ] R is a continuous nonnegative real-valued function and μ , ν , λ R . Define two mappings S , Q : D X by
S x ( s ) = a b K ( s , t ) x ( t ) d t
for all s [ a , b ] and
Q x ( s ) = μ ( x ( s ) ) 1 + p + ν ( x ( s ) ) 2
for all μ , ν R and s [ a , b ] .
One can easily observe that K is bounded on [ a , b ] × [ a , b ] , that is, there exists a number M 0 such that | K ( s , t ) | M for all s , t [ a , b ] . Clearly, S is bounded linear operator with S M ( b a ) and Q is Fréchet differentiable and its Fréchet derivative at x D is given by
Q x h ( s ) = ( μ ( 1 + p ) x p + 2 ν x ) h ( s )
for all h C [ a , b ] . For all x , y D , we have
Q x Q y = sup { ( Q x Q y ) h : h C [ a , b ] , h = 1 } sup { ( μ ( 1 + p ) ( x p y p ) + 2 ν ( x y ) ) h : h C [ a , b ] , h = 1 } sup { ( | μ | ( 1 + p ) x p y p + 2 | ν | x y ) h : h C [ a , b ] , h = 1 } | μ | ( 1 + p ) x y p + 2 | ν | x y = ω 0 ( x y ) ,
where ω 0 ( t ) = | μ | ( 1 + p ) t p + 2 | ν | t , t 0 with
ω 0 ( s t ) s p ω 0 ( t )
for all s [ 0 , 1 ] and t [ 0 , ) . For any x D , using Equations (33) and (35), we have
S Q x = sup { S Q x h : h X , h = 1 } = sup sup s [ a , b ] a b K ( s , t ) ( μ ( 1 + p ) ( x ( t ) ) p + 2 ν x ( t ) ) h ( t ) d t : h X , h = 1 sup a b | K ( s , t ) | ( | μ | ( 1 + p ) | x ( t ) | p + 2 | ν | | x ( t ) | ) | h ( t ) | d t : h X , h = 1 ( | μ | ( 1 + p ) x p + 2 | ν | x ) M ( b a ) < 1 .
We now apply Theorem 3 to solve the Fredholm integral Equation (32).
Theorem 4.
Let D = X = Y = C [ a , b ] and μ , ν , λ , M R . Let S , Q : D X be operators defined by Equations (33) and (34), respectively. Let L B ( X ) and x 0 D be such that z 0 = x 0 L ( x 0 λ S Q ( x 0 ) g ) D . Assume that the condition ( C 6 ) and the following conditions hold:
(C18) 
1 1 | λ | ( | μ | ( 1 + p ) z 0 p + 2 | ν | z 0 ) M ( b a ) = β for some β > 0 ;
(C19) 
x 0 g + | λ | ( | μ | x 0 p + 1 + 2 | ν | x 0 2 ) M ( b a ) 1 | λ | ( | μ | ( 1 + p ) z 0 p + 2 | ν | z 0 ) M ( b a ) = η for some η > 0 ;
(C20) 
I L + | λ | L ( | μ | ( 1 + p ) x p + 2 | ν | x ) M ( b a ) 1 3 for all x D .
Then the sequence generated by Equation (31) with u = g X is well defined, remains in B r [ x 0 ] and converges to the solution x * B r [ x 0 ] of the Equation (32) with R-order convergence at least ( 2 p + 1 ) .
Proof. 
Note that D = X = Y = C [ a , b ] . Obviously, ( C 12 ) holds. Using Equations ( C 20 ) , (33), (35) and (38), we have
I ( I λ S Q z 0 ) | λ | ( | μ | ( 1 + p ) z 0 p + 2 | ν | z 0 ) M ( b a ) < 1 .
Therefore, by Lemma 1, ( I λ S Q z 0 ) 1 exists and
( I λ S Q z 0 ) 1 1 1 | λ | ( | μ | ( 1 + p ) z 0 p + 2 | ν | z 0 ) M ( b a ) .
Hence Equations ( C 18 ) and (39) implies ( C 13 ) holds. Using Equations ( C 19 ) , (38) and (39), we have
( I λ S Q z 0 ) 1 ( x 0 λ S Q ( x 0 ) g ) ( I λ S Q z 0 ) 1 ( x 0 g + λ S Q ( x 0 ) ) x 0 g + | λ | ( | μ | x 0 p + 1 + 2 | ν | x 0 2 ) M ( b a ) 1 | λ | ( | μ | ( 1 + p ) z 0 p + 2 | ν | z 0 ) M ( b a ) η .
Thus the condition ( C 14 ) is satisfied. The conditions ( C 15 ) and ( C 16 ) follow from Equations (36) and (37), respectively. Now, from Equation ( C 20 ) and (38), we have
I L ( I λ S Q x ) I L + L λ S Q x I L + L | λ | ( | μ | ( 1 + p ) x p + 2 | ν | x ) M ( b a ) 1 3 .
This implies that ( C 17 ) holds. Hence all the conditions of Theorem 3 are satisfied. Therefore, Theorem 4 follows from Theorem 3. This completes the proof. □
Now, we give one example to illustrate Theorem 3.
Example 3.
Let X = Y = C [ 0 , 1 ] be the space of all continuous real valued functions defined on [ 0 , 1 ] . Let D = { x : x C [ 0 , 1 ] , x < 3 2 } C [ 0 , 1 ] . Consider the following nonlinear integral equation:
x ( s ) = sin ( π s ) + 1 10 0 1 cos ( π s ) sin ( π t ) ( x ( t ) ) p + 1 d t , p ( 0 , 1 ] .
Define two mappings S : X X and Q : D Y by
S ( x ) ( s ) = 0 1 K ( s , t ) x ( t ) d t , Q ( x ) ( s ) = ( x ( s ) ) p + 1 ,
where K ( s , t ) = cos ( π s ) sin ( π t ) . For u = sin ( π s ) , the problem Equation (40) is equivalent to the problem Equation (28). Here, one can easily observe that S is bounded linear operator with S 1 and Q is Fréchet differentiable with Q x h ( s ) = ( p + 1 ) ( x ( s ) ) p h ( s ) for all h X and s [ 0 , 1 ] . For all x , y D , we have
Q x Q y ( p + 1 ) x y p = ω 0 ( x y ) ,
where ω 0 ( t ) = ( p + 1 ) t p for any t 0 . Clearly, ω 0 Φ . Define a mapping F : D X by
F ( x ) ( s ) = x ( s ) 1 10 S Q ( x ) ( s ) sin ( π s ) .
Clearly, F is Fréchet differentiable on D. We now show that ( C 12 ) holds for L = I B ( X ) . Note that
( I L ( I λ S Q ) ) ( x ) u = 1 10 S Q ( x ) ( s ) + sin ( π s ) 1 10 3 2 p + 1 + 1 < 3 2
for all x D . Thus ( I L ( I λ S Q ) ) ( x ) u D for all x D . For all x D , we have
I F x p + 1 10 x p p + 1 10 3 2 p = k .
Therefore, by Lemma 1, F x 1 exists and
F x 1 U ( s ) = U ( s ) + ( p + 1 ) cos ( π s ) 0 1 sin ( π t ) ( x ( t ) ) p U ( t ) d t 10 ( p + 1 ) 0 1 sin ( π t ) cos ( π t ) ( x ( t ) ) p d t
for all U Y .
Let x 0 ( s ) = sin ( π s ) , ω ( t ) = ω 0 ( t ) 10 = p + 1 10 t p . Then we have the following:
(a)
x 0 X , F ( x 0 ( s ) ) = cos ( π s ) 10 0 1 ( sin ( π t ) ) p + 2 d t ;
(b)
z 0 ( s ) = x 0 ( s ) F ( x 0 ( s ) ) = sin ( π s ) + cos ( π s ) 10 0 1 ( sin ( π t ) ) p + 2 d t ;
(c)
F z 0 1 10 p + 1 10 p + 1 ( p + 1 ) 11 p = β ;
(d)
F z 0 1 F ( x 0 ) 10 p 10 p + 1 ( p + 1 ) 11 p = η ;
(e)
b 0 = β ω ( η ) = ( p + 1 ) 10 p ( p + 1 ) ( 10 p + 1 ( p + 1 ) 11 p ) p + 1 and q = 1 p + 1 + p + 1 10 p 3 2 p 2 .
One can easily observe that θ = q b 0 2 + k q b 0 2 1 k ( 1 + q ) b 0 < 1 for all p ( 0 , 1 ] and r = ( 1 + q b 0 ) η 1 θ . Hence all the conditions of Theorem 3 are satisfied. Therefore, the sequence { x n } generated by Equation (31) is well defined, remains in B r [ x 0 ] and converges to a solution of the integral Equation (40).
For p = 1 , the convergence behavior of Newton-like method Equation (31) is given in Table 2.

5. Conclusions

The semilocal convergence of the third order Newton-like method for finding zeros of an operator from a Banach space to another Banach space and the corresponding Stirling-like method for finding fixed points of an operator on a Banach space are established under the ω -continuity condition. Our iterative technique is applied to nonlinear Fredholm-type operator equations. The R-order of our methods are clearly shown to be equal to at least 2 p + 1 for any p ( 0 , 1 ] . Some numerical examples are given in support of our work, where earlier work cannot apply. In future, our iterative techniques can be applied in optimization problems.

Author Contributions

The authors have contributed equally to this paper.

Funding

This research has received no exteranl funding.

Acknowledgments

We would like to thank the reviewers for their valuable suggestions for improvement of this paper.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Kantorovich, L.V.; Akilov, G.P. Functional Analysis; Aregamon Press: Oxford, UK, 1982. [Google Scholar]
  2. Kantorovich, L.V. On Newton’s method for functional equations. Dokl. Akad. Nauk. SSSR 1948, 59, 1237–1240. (In Russian) [Google Scholar]
  3. Rheinbolt, W.C. A unified Convergence theory for a class of iterative processes. SIAM J. Numer. Anal. 1968, 5, 42–63. [Google Scholar] [CrossRef]
  4. Argyros, I.K.; Cho, Y.J.; Hilout, S. Numerical Methods for Equations and its Applications; CRC Press/Taylor & Francis Group Publ. Comp.: New York, NY, USA, 2012. [Google Scholar]
  5. Argyros, I.K.; Hilout, S. Improved generaliged differentiability conditions for Newton-like methods. J. Complex. 2010, 26, 316–333. [Google Scholar] [CrossRef]
  6. Argyros, I.K.; Hilout, S. Majorizing sequences for iterative methods. J. Comput. Appl. Math. 2012, 236, 1947–1960. [Google Scholar] [CrossRef]
  7. Argyros, I.K. An improved error analysis for Newton-like methods under generalized conditions. J. Comput. Appl. Math. 2003, 157, 169–185. [Google Scholar] [CrossRef]
  8. Argyros, I.K.; Hilout, S. On the convergence of Newton-type methods under mild differentiability conditions. Number. Algorithms 2009, 52, 701–726. [Google Scholar] [CrossRef]
  9. Sahu, D.R.; Singh, K.K.; Singh, V.K. Some Newton-like methods with sharper error estimates for solving operator equations in Banach spaces. Fixed Point Theory Appl. 2012, 78, 1–20. [Google Scholar] [CrossRef]
  10. Sahu, D.R.; Singh, K.K.; Singh, V.K. A Newton-like method for generalized operator equations in Banach spaces. Numer. Algorithms 2014, 67, 289–303. [Google Scholar] [CrossRef]
  11. Sahu, D.R.; Cho, Y.J.; Agarwal, R.P.; Argyros, I.K. Accessibility of solutions of operator equations by Newton-like Methods. J. Comlex. 2015, 31, 637–657. [Google Scholar] [CrossRef]
  12. Argyros, I.K. A unifying local-semilocal convergence analysis and applications for two-point Newton-like methods in Banach space. J. Math. Anal. Appl. 2004, 298, 374–397. [Google Scholar] [CrossRef]
  13. Argyros, I.K.; Cho, Y.J.; George, S. On the “Terra incognita” for the Newton-Kantrovich method. J. Korean Math. Soc. 2014, 51, 251–266. [Google Scholar] [CrossRef]
  14. Argyros, I.K.; Cho, Y.J.; George, S. Local convergence for some third-order iterative methods under weak conditions. J. Korean Math. Soc. 2016, 53, 781–793. [Google Scholar] [CrossRef]
  15. Ren, H.; Argyros, I.K.; Cho, Y.J. Semi-local convergence of Steffensen-type algorithms for solving nonlinear equations. Numer. Funct. Anal. Optim. 2014, 35, 1476–1499. [Google Scholar] [CrossRef]
  16. Ezquerro, J.A.; Hernández, M.A.; Salanova, M.A. A discretization scheme for some conservative problems. J. Comput. Appl. Math. 2000, 115, 181–192. [Google Scholar] [CrossRef]
  17. Ezquerro, J.A.; Hernández, M.A.; Salanova, M.A. A newton like method for solving some boundery value problems. Numer. Funct. Anal. Optim. 2002, 23, 791–805. [Google Scholar] [CrossRef]
  18. Ezquerro, J.A.; Hernández, M.A. Generalized differentiability conditions for Newton’s method. IMA J. Numer. Anal. 2002, 22, 187–205. [Google Scholar] [CrossRef]
  19. Proinov, P.D. New general convergence theory for iterative process and its applications to Newton- Kantorovich type theores. J. Complex. 2010, 26, 3–42. [Google Scholar] [CrossRef]
  20. Sahu, D.R.; Yao, J.C.; Singh, V.K.; Kumar, S. Semilocal Convergence Analysis of S-iteration Process of Newton-Kantorovich Like in Banach Spaces. J. Optim. Theory Appl. 2017, 172, 102–127. [Google Scholar] [CrossRef]
  21. Parhi, S.K.; Gupta, D.K. Convergence of a third order method for fixed points in Banach spaces. Numer. Algorithms 2012, 60, 419–434. [Google Scholar] [CrossRef]
  22. Agarwal, R.P.; O’Regan, D.; Sahu, D.R. Fixed Point Theory for Lipschitzian-Type Mappings with Applications; Topological Fixed Point Theory and its Applications; Springer: New York, NY, USA, 2009; p. 6. [Google Scholar]
  23. Agarwal, R.P.; Meehan, M.; O’Regan, D. Fixed Point Theory and Applications; Cambridge University Press: Cambridge, UK, 2004. [Google Scholar]
  24. Picard, E. Memorire sur la theorie des equations aux derivees partielles et la methode aes approximations successive. J. Math. Pures Appl. 1980, 6, 145–210. [Google Scholar]
  25. Cho, Y.J. Survey on metric fixed point theory and applications. In Advances on Real and Complex Analysis with Applications; Trends in Mathematics; Ruzhahsky, M., Cho, Y.J., Agarwal, P., Area, I., Eds.; Birkhäuser, Springer: Basel, Switzerland, 2017. [Google Scholar]
  26. Granas, A.; Dugundji, J. Fixed Point Theory; Springer: New York, NY, USA, 2003. [Google Scholar]
  27. Zeidler, E. Nonlinear Functional Analysis and Its Applications I: Fixed-Point Theorems; Springer: New York, NY, USA, 1986. [Google Scholar]
  28. Zeidler, E. Nonlinear Functional Analysis and Its Applications III: Variational Methods and Applications; Springer: New York, NY, USA, 1985. [Google Scholar]
  29. Argyros, I.K. On Newton’s method under mild differentiability conditions and applications. Appl. Math. Comput. 1999, 102, 177–183. [Google Scholar] [CrossRef]
  30. Ortega, J.M.; Rheinboldt, W.C. Iterative Solution of Nonlinear Equations in Several Variables; Academic Press: New York, NY, USA; London, UK, 1970. [Google Scholar]
  31. Bartle, R.G. Newton’s method in Banach spaces. Proc. Am. Math. Soc. 1955, 6, 827–831. [Google Scholar]
  32. Rall, L.B. Convergence of Stirling’s method in Banaeh spaces. Aequa. Math. 1975, 12, 12–20. [Google Scholar] [CrossRef]
  33. Parhi, S.K.; Gupta, D.K. Semilocal convergence of a Stirling-like method in Banach spaces. Int. J. Comput. Methods 2010, 7, 215–228. [Google Scholar] [CrossRef]
  34. Argyros, I.K.; Muruster, S.; George, S. On the Convergence of Stirling’s Method for Fixed Points Under Not Necessarily Contractive Hypotheses. Int. J. Appl. Comput. Math. 2017, 3, 1071–1081. [Google Scholar] [CrossRef]
  35. Alshomrani, A.S.; Maroju, P.; Behl, R. Convergence of a Stirling-like method for fixed points in Banach spaces. J. Comput. Appl. Math. 2018. [Google Scholar] [CrossRef]
  36. Parhi, S.K.; Gupta, D.K. A third order method for fixed points in Banach spaces. J. Math. Anal. Appl. 2009, 359, 642–652. [Google Scholar] [CrossRef]
  37. Rall, L.B. Computational Solution of Nonlinear Operator Equations; John Wiley and Sons: New York, NY, USA, 1969. [Google Scholar]
  38. Hernández, M.A.; Salanova, M.A. A Newton-like iterative process for the numerical solution of Fredholm nonlinear integral equations. J. Integr. Equ. Appl. 2005, 17, 1–17. [Google Scholar] [CrossRef]
  39. Kohaupt, L. A Newton-like method for the numerical solution of nonlinear Fredholm-type operator equations. Appl. Math. Comput. 2012, 218, 10129–10148. [Google Scholar] [CrossRef]
Table 1. A priori error bounds.
Table 1. A priori error bounds.
n x n x *
03.0237854462752
11.7795738211156 × 10 2
26.216484249588206 × 10 6
32.335501569916687 × 10 9
48.775202786637237 × 10 13
54.440892098500626 × 10 16
Table 2. Iterates of Newton-like method Equation (31).
Table 2. Iterates of Newton-like method Equation (31).
n x n ( s ) z n ( s ) y n ( s )
0 sin ( π s ) sin ( π s ) + 0.0424413182 cos ( π s ) sin ( π s ) + 0.0425947671 cos ( π s )
1 sin ( π s ) + 0.0424794035 cos ( π s ) sin ( π s ) + 0.0424791962 cos ( π s ) sin ( π s ) + 0.0424796116 cos ( π s )
2 sin ( π s ) + 0.0424795616 cos ( π s ) sin ( π s ) + 0.042479611 cos ( π s ) sin ( π s ) + 0.0424796112 cos ( π s )
3 sin ( π s ) + 0.0424796111 cos ( π s ) sin ( π s ) + 0.0424796109 cos ( π s ) sin ( π s ) + 0.0424796113 cos ( π s )

Share and Cite

MDPI and ACS Style

Sahu, D.R.; Agarwal, R.P.; Singh, V.K. A Third Order Newton-Like Method and Its Applications. Mathematics 2019, 7, 31. https://doi.org/10.3390/math7010031

AMA Style

Sahu DR, Agarwal RP, Singh VK. A Third Order Newton-Like Method and Its Applications. Mathematics. 2019; 7(1):31. https://doi.org/10.3390/math7010031

Chicago/Turabian Style

Sahu, D. R., Ravi P. Agarwal, and Vipin Kumar Singh. 2019. "A Third Order Newton-Like Method and Its Applications" Mathematics 7, no. 1: 31. https://doi.org/10.3390/math7010031

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