You are on page 1of 13

See discussions, stats, and author profiles for this publication at: https://www.researchgate.

net/publication/281235366

Monotone iterative technique by upper and lower solutions with initial time
difference

Article  in  Miskolc Mathematical Notes · January 2015


DOI: 10.18514/MMN.2015.1258

CITATIONS READS

2 342

3 authors, including:

Coşkun Yakar Ismet Arslan


Gebze Technical University Gebze Technical University
29 PUBLICATIONS   206 CITATIONS    1 PUBLICATION   2 CITATIONS   

SEE PROFILE SEE PROFILE

All content following this page was uploaded by Coşkun Yakar on 25 August 2015.

The user has requested enhancement of the downloaded file.


Miskolc Mathematical Notes HU e-ISSN 1787-2413
Vol. 16 (2015), No. 1, pp. 575–586

MONOTONE ITERATIVE TECHNIQUE BY UPPER AND LOWER


SOLUTIONS WITH INITIAL TIME DIFFERENCE

COŞKUN YAKAR, İSMET ARSLAN, AND MUHAMMED ÇİÇEK


Received 21 May, 2014

Abstract. In this work, the monotone iterative technique have been investigated by choosing
upper and lower solutions with initial time difference that start at different initial times for the
initial value problem. This method offers a way of proving existence of maximal and minimal
solutions in addition to obtaining solutions in closed sectors.

2010 Mathematics Subject Classification: 34A99; 34C60; 34A12


Keywords: initial time difference, monotone iterative technique, existence theorems, comparison
results

1. I NTRODUCTION
The original method of monotone iterative technique provides an explicit analytic
representation for the solution of nonlinear differential equations which yields point-
wise upper and lower estimates for the solution of problem whenever the functions
involved are monotone nondecreasing and nonincreasing [1–3, 8, 10–13]. As a result,
the method has been popular in applied areas [1, 2],[4–6],[9, 12, 13]. The monotone
iterative technique [2, 6–8], uncoupled with the method of upper and lower solu-
tions, offers monotone sequences that converge uniformly and monotonically to the
extremal solutions of the given nonlinear problem. Since each member of such a
sequence is the solution of a certain (ODEs) which can be explicitly computed, the
advantage and the importance of this technique needs no special emphasis. Moreover,
this method can successfully be employed to generate two sided pointwise bounds on
solutions of initial value problems of ODEs from which qualitative and quantitative
behavior can be investigated. In this paper especially we employed monotone iterat-
ive technique for ODEs with initial time difference.

2. P RELIMINARIES
In this section we will give some basic definition and theorems by [4] which are
very useful to use in our future references.

c 2015 Miskolc University Press
576 COŞKUN YAKAR, İSMET ARSLAN, AND MUHAMMED ÇİÇEK

We consider the following initial value problem


x 0 .t / D f .t; x.t //; x.t0 / D x0 for t  t0 ; t0 2 RC (2.1)
where f 2 C ŒRC  R; R and t 2 Œt0 ; t0 C T  :
Definition 1. .i / Let r.t / be a solution of the (2.1) on t 2 Œt0 ; t0 C T . Then r.t /
is said to be a maximal solution of (2.1) if, for every solution x.t / of (2.1) existing
on Œt0 ; t0 C T  the inequality
x.t /  r.t /; t 2 Œt0 ; t0 C T  (2.2)
holds.
.i i / Let .t / be a solution of the (2.1) on t 2 Œt0 ; t0 C T . Then .t / is said to be
a minimal solution of (2.1) if, for every solution x.t / of (2.1) existing on Œt0 ; t0 C T 
the inequality
x.t /  .t /; t 2 Œt0 ; t0 C T  (2.3)
holds.
Definition 2. .i / A function ˇ 2 C 1 ŒŒt0 ; t0 C T  ; R is said to be an upper solution
of (2.1) if
ˇ 0  f .t; ˇ/; ˇ.t0 /  x0 ; t 2 Œt0 ; t0 C T  (2.4)
.i i / A function ˛ 2 C 1 ŒŒt0 ; t0 C T  ; R is said to be a lower solution of (2.1) if
˛ 0  f .t; ˛/; ˛.t0 /  x0 ; t 2 Œt0 ; t0 C T  (2.5)
Theorem 1 ([4]). Let ˛; ˇ 2 C 1 ŒŒt0 ; t0 C T  ; R be lower and upper solutions of
(2.1) respectively. Suppose that x  y , f satisfies the inequality
f .t; x/ f .t; y/  M.x y/ (2.6)
where M is a positive constant .Then ˛.t0 /  ˇ.t0 / implies that ˛.t /  ˇ.t /; t 2
Œt0 ; t0 C T  :
Remark 1 ([4]). Let the assumptions of Theorem 1 hold. Then every solution x.t /
of (2.1) such that ˛.t0 /  x.t0 /  ˇ.t0 / satisfies the estimate
˛.t /  x.t /  ˇ.t /; t 2 Œt0 ; t0 C T  : (2.7)
Theorem 2 ([4]). Let f 2 C ŒŒt0 ; t0 C T   R; R and jf .t; x/j  L. Then there
exist a solution of the IVP (2.1) on Œt0 ; t0 C T  :

3. C OMPARISON T HEOREMS AND E XISTENCE R ESULTS RELATIVE TO I NITIAL


T IME D IFFERENCE
In this section, we will give some basic comparison theorems and existence results
relative to initial time difference.
INITIAL TIME DIFFERENCE MONOTONE ITERATIVE TECHNIQUE 577

Theorem 3 ([5]). Assume that f 2 C ŒRC  R; R and


.i / ˛ 2 C 1 ŒŒ0 ; 0 C T  ; R ; 0  0; T > 0; ˇ 2 C 1 ŒŒ0 ; 0 C T  ; R ; 0 > 0; and
˛ 0 .t /  f .t; ˛.t // for t 2 Œ0 ; 0 C T  (3.1)
0
ˇ .t /  f .t; ˇ.t // for t 2 Œ0 ; 0 C T  (3.2)
with ˛.0 /  ˇ.0 /I
.i i / f .t; x/ f .t; y/  M.x y/; x  y; M > 0I
.i i i / 0 < t0 < 0 and f .t; x/ is nondecreasing in t for each x:
Then .A/ ˛.t /  ˇ.t C . C // for t  0 where  D t0 0 ;  D 0 t0 :
.B/ ˛.t  /  ˇ.t C / for t  t0 ;where  D t0 0 and  D 0 t0 :
.C / ˛.t . C /  ˇ.t /; t  0 where  D t0 0 ;  D 0 t0 :
Proof of Theorem 3. Please see [5] for the details of the proof by simple modific-
ation of .A/; .B/ and .C /: 
The following theorem is the existence result in the closed sectors.
Theorem 4. Assume that f 2 C ŒRC  ˝; R and
.i / ˛ 2 C 1 ŒŒ0 ; 0 C T  ; R ; 0  0; T > 0; ˇ 2 C 1 ŒŒ0 ; 0 C T  ; R ; 0 > 0
˛ 0 .t /  f .t; ˛.t // for t 2 Œ0 ; 0 C T 
ˇ 0 .t /  f .t; ˇ.t // for t 2 Œ0 ; 0 C T 
with ˛.0 /  ˇ.0 /I
.i i / 0 < t0 < 0 and f .t; x/ is nondecreasing in t for each xI
.i i i / ˛.t  /  ˇ.t C / for t0  t  t0 C T where  D t0 0 ;  D 0 t0 :
Then there exist a solution of initial value problem (2.1) satisfying
˛.t  /  x.t /  ˇ.t C /
for t0  t  t0 C T:
Proof of Theorem 4. Let ˇ0 .t / D ˇ.t C / and ˛0 .t / D ˛.t  / for
t 2 Œt0 ; t0 C T  D I: Then we get ˇ0 .t0 / D ˇ.0 /  ˛0 .t0 / D ˛.0 / and
ˇ00 .t /  f .t C ; ˇ0 .t //; ˛00 .t /  f .t ; ˛0 .t //:
Assume that ˛0 .t0 /  x0  ˇ0 .t0 / and p W Œt0 ; t0 C T   R ! R such that
p.t; x/ D max Œ˛0 .t/ ; min Œx; ˇ0 .t /
Then f .t; p.t; x// defines a continuous extension of f to Œt0 ; t0 C T   R which is
also bounded since f is bounded on ˝; where
˝ D f.t; x/ 2 RC  R W ˛.t  /  x  ˇ.t C / for t0  t  t0 C T g: (3.3)
x0
Therefore, the initial value problem D f .t; p.t; x//; x.t0 / D x0 according to The-
orem 2 has a solution on I: For sufficiently small " > 0; consider
˛0" .t / D ˛0 .t / ".1 C t / (3.4)
578 COŞKUN YAKAR, İSMET ARSLAN, AND MUHAMMED ÇİÇEK

ˇ0" .t / D ˇ0 .t / C ".1 C t /: (3.5)

Clearly
˛0" .t0 / < ˛0 .t0 /  x0  ˇ0 .t0 / < ˇ0" .t0 /
and hence ˛0" .t0 / < x0 < ˇ0" .t0 /: We wish to show that

˛0" .t / < x.t / < ˇ0" .t / on I

Suppose that it is not true, then there exists a t1 2 .t0 ; t0 C T  such that

˛0" .t / < x.t / < ˇ0" .t / on Œt0 ; t1 / and ˇ0" .t1 / D x.t1 /:

Then x.t1 / > ˇ0 .t1 / and so

p.t1 ; x.t1 // D ˇ0 .t1 /

Also ˛0 .t1 /  p.t1 ; x.t1 //  ˇ0 .t1 /: Hence

ˇ00 .t1 /  f .t1 ; ˇ0 .t1 // D f .t1 ; p.t1 ; x.t1 /// D x 0 .t1 /

Since ˇ00 " .t1 / > ˇ00 .t1 /  x 0 .t1 / we have ˇ00 " .t1 / > x 0 .t1 / . This contradicts x.t / <
ˇ0" .t / for t 2 Œt0 ; t1 /: The other case can be proved similarly. Consequently, we
obtain ˛0" .t / < x.t / < ˇ0" .t / on I: Letting " ! 0 we get

˛0 .t /  x.t /  ˇ0 .t / on I:

Therefore the proof is completed. 

Remark 2. Assume that f 2 C ŒRC  R; R, assumptions .i /, .i i / of Theorem 4


hold and
.i i i / ˛.t /  ˇ.t C . C // for 0  t  0 C T where  D t0 0 ;  D 0 t0 :
Then there exist a solution satisfying

˛.t /  x.t C  /  ˇ.t C . C //

for 0  t  0 C T .

Remark 3. Assume that f 2 C ŒRC  R; R, assumptions .i /, .i i / of Theorem 4


hold and
.i i i / ˛.t . C //  ˇ.t / for 0  t  0 C T where  D t0 0 ;  D 0 t0 :
Then there exist a solution satisfying

˛.t . C //  x.t /  ˇ.t /

for 0  t  0 C T .
INITIAL TIME DIFFERENCE MONOTONE ITERATIVE TECHNIQUE 579

4. M ONOTONE I TERATIVE T ECHNIQUE WITH THE DIFFERENT INITIAL DATA


In this section we have applied the monotone iterative technique for the nonlinear
initial value problem of (2.1) by choosing lower and upper solutions with known at
the different initial data.
Theorem 5. Assume that f 2 C ŒRC  R; R and
.i / ˛ 2 C 1 ŒŒ0 ; 0 C T  ; R ; 0  0; T > 0; ˇ 2 C 1 ŒŒ0 ; 0 C T  ; R ; 0 > 0
˛ 0 .t /  f .t; ˛.t // for t 2 Œ0 ; 0 C T 
ˇ 0 .t /  f .t; ˇ.t // for t 2 Œ0 ; 0 C T 
with ˛.0 /  ˇ.0 /I
.i i / 0 < t0 < 0 and f .t; x/ is nondecreasing in t for each xI
.i i i / ˛.t  /  ˇ.t C / for t0  t  t0 C T;  D t0 0 ;  D 0 t0 I
.iv/ f .t; x/ f .t; y/  M.x y/ where M > 0 and ˛.t  /  y  x  ˇ.t C/
for t 2 Œt0 ; t0 C T  :  
no
Then there exist monotone sequences ˛n and ˇ n which converge uniformly and
 
monotonically on Œt0 ; t0 C T  such that ˛ n !  and ˇ n ! r as n ! 1: Moreover, 
and r are minimal and maximal solutions such that  is the minimal solution of the
initial value problem of x 0 D f .t; x/; x.0 / D x0 on Œ0 ; 0 C T  and r is the max-
imal solution of the initial value problem of x 0 D f .t; x/; x.0 / D x0 on Œ0 ; 0 C T 
 
respectively where ˇ 0 .t / D ˇ.t C /; ˛ 0 .t / D ˛.t  /:
 
Proof of Theorem 5. Since ˇ 0 .t / D ˇ.t C/, ˇ 0 .t0 / D ˇ.t0 C/ D ˇ.0 /  ˛0 .0 /
0  0 
and ˇ 0 .t /  f .t C ; ˇ 0 .t //; ˛ 0 .t /  f .t ; ˛ 0 .t //; t 2 Œt0 ; t0 C T  : Consider the
following linear initial value problems
0    
˛ nC1 .t / D f .t ; ˛ n .t // M.˛ nC1 .t / ˛ n .t //; ˛ nC1 .t0 / D x0 (4.1)
0    
ˇ nC1 .t / D f .t C ; ˇ n .t // M.ˇ nC1 .t / ˇ n .t //; ˇ nC1 .t0 / D x0 (4.2)
 
Setting p.t / D ˇ 1 .t / ˇ0 .t / where p.t0 /  0 for t 2 I:
0 0
p 0 .t / D ˇ 1 .t / ˇ 0 .t /
   0
D f .t C ; ˇ 0 .t // M.ˇ 1 .t / ˇ 0 .t // ˇ 0 .t /
   
 f .t C ; ˇ 0 .t// M.ˇ 1 .t / ˇ 0 .t // f .t C ; ˇ 0 .t //
p 0 .t /  Mp.t /
580 COŞKUN YAKAR, İSMET ARSLAN, AND MUHAMMED ÇİÇEK

 
This shows that p.t /  p.t0 /e M t  0 since we have p.t0 /  0: Hence ˇ1 .t /  ˇ0 .t /
   
on I: Similarly we can show that ˛ 0 .t /  ˛ 1 .t / on I: Setting p.t / D ˛ 1 .t / ˛ 0 .t /
and p.t0 /  0 for t 2 Œt0 ; t0 C T  :
0 0
p 0 .t / D ˛ 1 .t / ˛ 0 .t/
   0
D f .t ; ˛ 0 .t // M.˛1 .t / ˛ 0 .t // ˛ 0 .t /
   
 f .t ; ˛ 0 .t// M.˛ 1 .t / ˛ 0 .t // f .t ; ˛ 0 .t //
p 0 .t /  Mp.t /
Mt  
This shows that p.t /  p.t0 /e  0: Hence ˛ 0 .t /  ˛ 1 .t / on I: Now we can show
   
˛ 1 .t /  ˇ 1 .t /. Setting p.t / D ˛ 1 .t / ˇ 1 .t / where p.t0 /  0 for t 2 Œt0 ; t0 C T  :
0 0
p 0 .t / D ˛ 1 .t / ˇ 1 .t /
     
D f .t ; ˛ 0 .t // M.˛ 1 .t / ˛ 0 .t // f .t C ; ˇ 0 .t // C M.ˇ 1 .t / ˇ 0 .t //
     
 f .t; ˛ 0 .t // M.˛ 1 .t / ˛ 0 .t // f .t; ˇ 0 .t // C M.ˇ 1 .t / ˇ 0 .t //
     
D f .t; ˛ 0 .t // f .t; ˇ 0 .t // M.˛ 1 .t / ˛ 0 .t // C M.ˇ 1 .t / ˇ 0 .t //
  
 
  
 M.ˇ 0 .t / ˛ 0 .t // M.˛ 1 .t / ˛ 0 .t // C M.ˇ 1 .t / ˇ 0 .t //
 
D M.ˇ 1 .t / ˛ 1 .t //
0
p .t /  Mp.t /
 
This shows that p.t /  p.t0 /e Mt  0 on I: Hence ˛ 1 .t /  ˇ 1 .t / on Œt0 ; t0 C T  :
Consequently, we have
   
˛ 0 .t /  ˛ 1 .t /  ˇ 1 .t /  ˇ 0 .t / on I:
To employ the method of mathematical induction, assume that for some k > 1
   
˛k 1 .t /  ˛ k .t /  ˇ k .t /  ˇ k 1 .t / on I
we then show that
   
˛ k .t /  ˛ kC1 .t /  ˇ kC1 .t /  ˇ k .t / on I:
 
where ˛ kC1 .t / and ˇ kC1 .t / are the solutions of the linear IVPs
0    
˛ kC1 .t / D f .t ; ˛ k .t // M.˛ kC1 .t / ˛ k .t //; ˛ kC1 .t0 / D x0
0    
ˇ kC1 .t / D f .t C ; ˇ k .t // M.ˇ kC1 .t / ˇ k .t //; ˇ kC1 .t0 / D x0 :
INITIAL TIME DIFFERENCE MONOTONE ITERATIVE TECHNIQUE 581

 
As we have done before, we set p.t / D ˛ kC1 .t / ˛ k .t / where p.t0 /  0:
0 0
p 0 .t / D ˛ kC1 .t / ˛ k .t /
 
D f .t ; ˛ k .t // M.˛ kC1 .t /
   
˛ k .t // f .t 1 .t // C M.˛ k .t / ˛ k 1 .t //
; ˛ k
 
D f .t ; ˛ k .t // f .t ; ˛ k 1 .t //
   
M.˛ kC1 .t / ˛ k .t// C M.˛ k .t / ˛ k 1 .t //
     
 M.˛ k .t / ˛ k 1 .t // M.˛ kC1 .t / ˛ k .t // M.˛ k .t / ˛k 1 .t //
 
D M.˛ kC1 .t / ˛ k .t //
0
p .t /  Mp.t /

Mt  
This shows that p.t /  p.t0 /e  0 on I: Hence ˛ k .t /  ˛ kC1 .t / on I: Setting
 
p.t / D ˇ kC1 .t / ˇ k .t / where p.t0 /  0:
0 0
p 0 .t / D ˇ kC1 .t / ˇ k .t /
  
D f .t C ; ˇ k .t // M.ˇ kC1 .t / ˇ k .t //
  
f .t C ; ˇ k 1 .t // C M.ˇ k .t / ˇk 1 .t //
 
D f .t C ; ˇ k .t // f .t C ; ˇ k 1 .t //
   
M.ˇ kC1 .t / ˇ k .t // C M.ˇ k .t / ˇ k 1 .t //
     
 
 M.ˇ k 1 .t / ˇ k .t // M.ˇ kC1 .t / ˇ k .t // C M.ˇ k .t / ˇk 1 .t //

p 0 .t /  Mp.t /
 
This shows that p.t /  p.t0 /e Mt  0 on I: Hence ˇ kC1 .t /  ˇ k .t / on I: Now
 
setting p.t / D ˛ kC1 .t / ˇ kC1 .t / where p.t0 /  0:

0 0
p 0 .t / D ˛ kC1 .t / ˇ kC1 .t /
  
D f .t ; ˛ k .t // M.˛ kC1 .t / ˛ k .t //
  
f .t C ; ˇ k .t // C M.ˇ kC1 .t / ˇ k .t //
     
 f .t; ˛ k .t // f .t; ˇ k .t // M.˛ kC1 .t / ˛ k .t // C M.ˇ kC1 .t / ˇ k .t //
582 COŞKUN YAKAR, İSMET ARSLAN, AND MUHAMMED ÇİÇEK

  
 
  
 M.ˇ k .t / ˛ k .t // M.˛ kC1 .t / ˛ k .t // C M.ˇ kC1 .t / ˇ k .t //

p 0 .t /  Mp.t /
 
This shows that p.t /  p.t0 /e M t  0 on I: Hence ˛ kC1 .t /  ˇ kC1 .t / on I: Con-
sequently, for all k 2 N and for t 2 I: We get
   
˛ k .t /  ˛ kC1 .t /  ˇ kC1 .t /  ˇ k .t / on I:
Hence it follows that for all n 2 N and t 2 I; we have
     
 ˛ 1 .t /  :::  ˛ n .t /  ˇ n .t /  :::  ˇ 1 .t /  ˇ 0 .t / on I:
˛ 0 .t / (4.3)
n o  
It is clear that the sequences ˛ n and ˇ n are uniformly bounded and equicon-
tinuous sequence of functions on Œt0 ; t0 C T  and  consequently
 by Ascoli-Arzela’s
n o
theorem there exist subsequences ˛ nk and ˇ nk that converge uniformly on
n o  
Œt0 ; t0 C T  . In view of (4.3) it follows that the entire sequences ˛ n and ˇ n
 
converge uniformly and monotonically to  and r ,respectively, as n ! 1: We have
obtained the following corresponding Volterra integral equation for (4.1) and (4.2)
Zt
   
˛ nC1 .t / D x0 C .f .s ; ˛ n .s// M.˛ nC1 .s/ ˛ n .s//ds
t0


Zt   
ˇ nC1 .t / D x0 C .f .s C ; ˇ n .s// M.ˇ nC1 .s/ ˇ n .s//ds:
t0
Therefore, we get
  
0 .t / D f .t ; .t //; .t0 / D x0 (4.4)
  
r 0 .t / D f .t C ; r .t //; r .t0 / D x0 (4.5)
 
as n ! 1 where .t / D .t  / and r .t / D r.t C /, respectively. Finally, we must
 
show that  and r are the minimal and maximal solutions of the IVP (4.4) and (4.5),
respectively. Let x.t / be any solution of (2.1) such that
 
˛ 0 .t /  x.t /  ˇ 0 .t / on Œt0 ; t0 C T  :
Then we need to prove
   
˛ 0 .t /    x.t /  r  ˇ 0 .t / on Œt0 ; t0 C T  :
INITIAL TIME DIFFERENCE MONOTONE ITERATIVE TECHNIQUE 583

Suppose that for some n;


 
˛ n .t /  x.t /  ˇ n .t /:

Then, we set p.t / D ˛ nC1 .t / x.t / where p.t0 / D 0: Thus
0
p 0 .t / D ˛ nC1 .t / x 0 .t /
  
D f .t ; ˛n .t // M.˛ nC1 .t /
˛ n .t // f .t; x/
  
 f .t; ˛ n .t // f .t; x/ M.˛ nC1 .t / ˛ n .t //
  
 M.˛ n .t / x.t // M.˛ nC1 .t / ˛ n .t //

D M.˛ nC1 .t / x.t //
D Mp.t /:
This shows that p.t /  p.t0 /e Mt  0 on I since we have p.t0 /  0: Hence
 
˛ nC1 .t /  x.t / on I: In a similar manner, we can show that x.t /  ˇn .t / on
 
Œt0 ; t0 C T  : This proves by induction that ˛n .t /  x.t /  ˇn .t / for all n taking limit
 
as n ! 1 we arrive at   x.t /  r on Œt0 ; t0 C T  : Therefore the proof is com-
pleted. 
Corollary 1. If in addition to the assumption of Theorem 5, we assume
f .t; x/ f .t; y/  M.x y/; ˛.t  /  y  x  ˇ.t C /; M > 0
Ï Ï
then we have unique solution of (2.1) such that  D x D r :
Proof. If we set p D r  then p 0 D r 0 0 D f .t; r/ f .t; /  M.r /, which
gives p 0  Mp and p.t0 / D 0:Hence we get p.t /  0 on Œt0 ; t0 C T  which implies
r  : Also , utilizing the fact that   r; we have  D x D r is the unique solution
of (2.1). 
Corollary 2. If in addition to the assumption .i /; .i i / of Theorem 5, we assume
.i i i / ˛.t /  ˇ.t C . C // for 0  t  0 C T where  D t0 0 ;  D 0 t0 I
.iv/ f .t; x/ f .t; y/  M.x y/ where M > 0 and ˛.t /  y  x 
ˇ.t C . C // for t 2 Œ0 ; 0 C T  :

 
Then there exist monotone sequences f˛n g and ˇ n which converge uniformly
 
and monotonically on Œ0 ; 0 C T  such that ˛n !  and ˇ n ! r as n ! 1: More-
over,  and r are minimal and maximal solutions such that  is the minimal solution
of the initial value problem of x 0 D f .t; x/; x.0 / D x0 on Œ0 ; 0 C T  and r is the
maximal solution of the initial value problem of
0  
x .t / D f .t C ; x.t //; x.0 / D x0 ; t 2 Œ0 ; 0 C T  (4.6)
584 COŞKUN YAKAR, İSMET ARSLAN, AND MUHAMMED ÇİÇEK

 
respectively where ˇ 0 .t / D ˇ.t C . C //; ˛ 0 .t / D ˛0 .t /:
Corollary 3. If in addition to the assumption .i /; .i i / of Theorem 5, we assume
.i i i / ˛.t . C //  ˇ.t / for 0  t  0 C T where  D t0 0 ;  D 0 t0 I
.iv/ f .t; x/ f .t; y/  M.x y/ where M > 0 and ˛.t . C //  y  x 
ˇ.t / for t 2 Œ0 ; 0 C T  : n o
Then there exist monotone sequences ˛ n and fˇn g which converge uniformly
 
and monotonically on Œ0 ; 0 C T  such that ˛ n !  and ˇn ! r as n ! 1: More-
 
over,  and r are minimal and maximal solutions such that  is the minimal solution
of the initial value problem of
0  
x .t / D f .t ; x.t //; x.0 / D x0 ; t 2 Œ0 ; 0 C T  (4.7)
and r is the maximal solution of the initial value problem of x0 D f .t; x/; x.0 / D x0
 
on Œ0 ; 0 C T  where ˇ 0 .t / D ˇ0 .t /; ˛ 0 .t / D ˛0 .t . C //:

5. E XAMPLES
Example 1. Consider the nonlinear initial value problem
x 0 .t / D e t x 2 ; x.1/ D 1 for t  1 (5.1)
where f .t; x/ D e t x 2 2 C ŒRC  R; R and t 2 Œ1; 4 :
.E1 / ˛.t / D e2t ; ˛.0/ D 2; ˛.t / 2 C 1 ŒŒ0; 3 ; R and ˇ.t / D 1
2e t
;
ˇ.2/ D 2e12 ; ˇ.t / 2 C 1 ŒŒ2; 5 ; R, then we get for T D 3
2 4
˛ 0 .t / Dt
and f .t; ˛/ D t then ˛ 0 .t /  f .t; ˛/ for t 2 Œ0; 3
e e
1 1
ˇ 0 .t / D t and f .t; ˇ/ D t then ˇ 0 .t /  f .t; ˛/ for t 2 Œ2; 5 :
2e 4e
Therefore, ˛.t / and ˇ.t / are lower and upper solutions, respectively and
1
˛.0 / D ˛.0/ D 2 < x.t0 / D x.1/ D 1 < ˇ.0 / D ˇ.2/ D :
2e 2
.E2 / 0 < 1 < 2 and f .t; x/ is nondecreasing in t for each x and ˛.1/ D e2 
1
ˇ.1/ D 2e :
.E3 / f .t; x/ f .t; y/  M.x y/ where M D 4e 4 > 0 is the Lipschitz constant
 
for ˛.1/  y  x  ˇ.1/; t 2 Œ0; 5 : Also ˛ 0 .t / D ˛.t 1/ and ˇ 0 .t / D ˇ.t C 1/ for
t 2 Œ1; 4 :
 
Therefore, ˛ nC1 is a lower solution and ˇ nC1 is an upper solution of (5.1) for
 
t 2 Œ1; 3 : Thus ˛ nC1 .t /  ˇ nC1 .t / for t 2 Œ1; 4 :
INITIAL TIME DIFFERENCE MONOTONE ITERATIVE TECHNIQUE 585

Consequently, we have for all n;


     
˛ 0 .t /  ˛ 1 .t /      ˛ n .t /  ˇ n .t /      ˇ 1 .t /  ˇ 0 .t / for t 2 Œ1; 4
Employing
n theo standard monotone technique it can be shown that the monotone

sequence ˛ n .t / converges to  which is the minimal solution of (5.1) as n ! 1
 

and monotone sequence ˇ n .t / converges to r which is the maximal solution of
 
(5.1) as n ! 1: We arrive at   x.t /  r on Œ1; 3 : In this example,since the
1  
solution x.t / D et C1 e
of (5.1) is unique,  D x.t / D r :

ACKNOWLEDGEMENT
The authors would like to thank the referees for their insightful comments and
detailed suggestions which improved the quality of the paper.

R EFERENCES
[1] G. Deekshitulu, “Generalized monotone iterative technique for fractional R-L differential equa-
tions,” Nonlinear Studies, vol. 16, no. 1, pp. 85–94, 2009.
[2] S. Hristova and A. Golev, “Monotone-iterative method for the initial value problem with initial
time difference for differential equations with ”Maxima”,” Abstract and Applied Analysis, vol.
2012, no. 493271, 2012.
[3] S. Koksal and C. Yakar, “Generalized quasilinearization method with initial time difference,” In-
ternational Journal of Electrical, Electronic and other Physical Systems, vol. 24, no. 5, 2002.
[4] V. Ladde, G. S. Lakshmikantham and V. A. S., Monotone Iterative Technique for Nonlinear Dif-
ferential Equations, 2nd ed., ser. Series is books. Boston: Pitman Publishing Inc., 1985, vol.
III.
[5] V. Lakshmikantham and A. S. Vatsala, “Differential inequalities with initial time difference and
applications,” Journal of Inequalities and Applications, vol. 2, no. 3, pp. 233–244, 1999.
[6] V. Lakshmikantham and A. S. Vatsala, “General uniqueness and monotone iterative technique for
fractional differential equations,” Applied Mathematics Letters, vol. 21, no. 8, pp. 828–834, 2008.
[7] F. McRae, “Monotone iterative technique and existence results for fractional differential equa-
tions,” Nonlinear Analysis: Theory, Methods and Applications, vol. 71, no. 12, pp. 6093–6096,
2009.
[8] J. Vasundhara Devi, “Generalized monotone technique for periodic boundary value problems of
fractional differential equations,” Communications in Applied Analysis, vol. 12, no. 4, pp. 399–
406, 2008.
[9] C. Yakar, B. Bal, and A. Yakar, “Monotone technique in terms of two monotone functions in finite
systems,” Journal of Concrete and Applicable Mathematics, pp. 233–239, 2011.
[10] C. Yakar and A. Yakar, “An extension of the quasilinearization method with initial time differ-
ence,” Dynamics of Continuous, Discrete and Impulsive Systems (Series A: Mathematical Ana-
lysis), vol. 1-305, no. 14, pp. 275–279, 2007.
[11] C. Yakar and A. Yakar, “Further generalization of quasilinearization method with initial time
difference,” J. of Appl. Funct. Anal., vol. 4, no. 4, pp. 714–727, 2009.
586 COŞKUN YAKAR, İSMET ARSLAN, AND MUHAMMED ÇİÇEK

[12] C. Yakar and A. Yakar, “A refinement of quasilinearization method for Caputo sense fractional
order differential equations,” Abstract and Applied Analysis, vol. 2010, no. Article ID 704367, p.
10 pages, 2010.
[13] C. Yakar and A. Yakar, “Monotone iterative techniques for fractional order differential equations
with initial time difference,” Hacettepe Journal of Mathematics and Statistics, no. 14, pp. 331–
340, 2011.

Authors’ addresses
Coşkun Yakar
Gebze Technical University Faculty of Sciences Department of Mathematics Applied Mathematics
Gebze-Kocaeli 141-41400
E-mail address: cyakar@gtu.edu.tr

İsmet Arslan
Gebze Technical University Faculty of Sciences Department of Mathematics Applied Mathematics
Gebze-Kocaeli 141-41400
E-mail address: iarslan@gtu.edu.tr

Muhammed Çiçek
Gebze Technical University Faculty of Sciences Department of Mathematics Applied Mathematics
Gebze-Kocaeli 141-41400
E-mail address: mcicek@gtu.edu.tr

View publication stats

You might also like