Bonfring International Journal of Data Mining, Vol. 2, No.

2, June 2012 13
ISSN 2277 - 5048 | 2012 Bonfring
Abstract--- This paper is focused on the following
nonlinear impulsive neutral differential equation
k 0
t t , t t 0, (t))) f(x(
t
q(t)
(t))) f(x(
t
p(t)
] t))) c(t)g(x(( [x(t) = + +

1,2,3,... k , f(x(s))ds
s
(s)) q(
f(x(s))ds
s
(s)) p(
) a (1 ) x(t a ) x(t
k
k
k
k
t
) (t
1
t
) (t
1
k k k k
=

+ =

(*)
Sufficient conditions are obtained for every solution of (*)
to tends to a constant as t .
Keywords--- Asymptotic Behavior, Neutral Differential
Equation, Liapunov Functional, Impulse.

I. INTRODUCTION
he theory of impulsive differential equations is being
recognized as being not only richer than the
corresponding theory of differential equations without
impulses but also representing a more natural framework for
mathematical modelling of many real-world phenomena [1, 2].
In recent years, there has been increasing interest in the
oscillation and stability theory of impulsive delay differential
equations and many results have been obtained (see [35] and
the references cited therein) and many results have been
obtained. The knowledge of the asymptotic behavior of
solutions of impulsive delays differential equations is
developing comparatively slowly.
In this paper, we investigate the asymptotic behavior of all
solutions of the following nonlinear impulsive differential
equation with positive and negative coefficients of the for
k 0
t t , t t 0, (t))) f(x(
t
q(t)
(t))) f(x(
t
p(t)
] t))) c(t)g(x(( [x(t) = + +
(1)

S. Pandian, College of Arts and Science, Thiruvalluvar University,
Vandavasi, Tamilnadu, India.
Y. Balachandran, Department of Mathematics, Presidency College,
Chennai-5, Tamilnadu, India. E-mail: y.balachandran@gmail.com
1,2,3,... k , f(x(s))ds
s
(s)) q(
f(x(s))ds
s
(s)) p(
) a (1 ) x(t a ) x(t
k
k
k
k
t
) (t
1
t
) (t
1
k k k k
=

+ =

(2)
where (t), (t), (t), c(t), p(t), q(t) PC([t
0
, ), R) and p(t),
q(t) 0, 0 < t
k
< t
k+1
, with =

k
k
t lim and a
k
, k = 1, 2, are
constants. PC([t
0
, ), R) denotes the set of all functions
h : [t
0
, ) R such that h is continuous for t
k
< t < t
k+1
and
) h(t h(t) lim
k
t t
k

exists for all k 1.

We also assume that f, g are real continuous functions
defined on R such that xf(x) > 0, xg(x) > 0 for x 0. If
f(u) = g(u) = u and (t) = t , (t) = t , (t) = t where
, , are all non negative real numbers with , a
k
= 1,
equations (1) - (2) reduces to
0 ) - x(t
t
q(t)
) - x(t
t
p(t)
] ) - c(t)x(t [x(t) = + +
and if (t) = at, (t) = bt, (t) = ht with a
k
= 1 again
equations (1) - (2) reduces to
0 x(ht)
t
q(t)
x(bt)
t
p(t)
] c(t)x(at) [x(t) = + +
whose asymptotic behavior have been studied by several
authors, for example, see [3, 612].
With equations (1) - (2), one associates an initial
conditions of the forms
x(t
0
) =
1
(s), s [
1
, 0],
1
= max(, , )
x(t
0
) =
2
(s), s [
2
, 0],
2
= min(a, b, h)

x(t
0
) = x(t
0
+ s) for
1
s 0 and x(t
0
) = x(st
0
) for

2
s 1.
1
PC([
1
, 0], R) =
1
: [
1
, 0] R |
1
is
continuous everywhere except at a finite number of points and

2
PC([
2
, 1], R) = {
2
: [
2
, 1] R |
2
is continuous
everywhere except at a finite number of points
s , ). s ( lim ) s (
s s

+

+
=
A function x(t) is said to be a solution of (1) - (2)
satisfying the initial value conditions if
1. x(t) + c(t) g(x((t))) is continuously differentiable for
t > t
0
, t t
k
, k = 1, 2, and satisfies (1).
2. ) x(t
k
+
and ) x(t
k

exist with ) x(t

k
+
= x(t
k
) and satisfy (2).
As it is customary, a solution of (1) - (2) is said to be
nonoscillatory if it is eventually positive or eventually
Asymptotic Behavior Results for Nonlinear
Impulsive Neutral Differential Equations with
Positive and Negative Coefficients
S. Pandian and Y. Balachandran


T
Bonfring International Journal of Data Mining, Vol. 2, No. 2, June 2012 14
ISSN 2277 - 5048 | 2012 Bonfring
negative. Otherwise, the solution is said to be oscillatory.
II. MAIN RESULTS
In the sequel we assume that
(A1)
2 1 2 1
N
x
g(x)
N , M
x
f(x)
M (3)
for x R , where M
1
, M
2
, N
1
, N
2
are positive constants.
(A2) 0 < a
k
< 1 (k = 1, 2, ) and . ) a (1
1 k
k
<

=

(A3)
f(u)
g(u)
M > 0 for u 0.
In this paper we discuss the asymptotic behavior of
solutions of (1) - (2).
First we assume that (t) = t and (t) = t , (t) = t
where , , are all nonnegative real numbers with .
In this case the equations (1) - (2) can be rewritten as
k 0
t t , t t
0, )) f(x((t
t
q(t)
)) f(x(t
t
p(t)
] )) c(t)g(x(t [x(t)

= + +

(4)
1,2,3,... k , f(x(s))ds
s
) q(s
f(x(s))ds
s
) p(s
) a (1 ) x(t a ) x(t
k
k
k
k
t
t
t
t
k k k k
=

+
+ =

(5)
In what follows, for the sake of convenience, when we
write a functional inequality without specifying its domain of
validity, we mean that it holds for all sufficiently large t.
We begin with the following theorem.

Theorem 2.1: Let (A1)-(A3) hold. Assume that
c(t
k
) = ) c(t a
k k

and
1. c(t) lim
t
< =

(6)
(A4)
H
1
(t) = p(t) q(t + ) > 0 for t t
*
= t
0
+ (7)
(A5)
0 ds
s
) q(s
lim
t
t
t
=
+

(8)
(A6)
.
M
2
ds
s
) 2 (s H
) (t H
) q(t
ds
s
) (s H
M
) (t H
) (t H
1 sup lim
2
t
t
1
1
t
t
1 2
1
1
t

+
+
+
+

+
+

+
+ +
+

(9)
Then every solution of (4) - (5) tends to a constant as t
.
Proof: Let x(t) be any solution of (4) - (5). We shall prove
that x(t) lim
t
exists and is finite. For this purpose we rewrite
(4) - (5) in the form,
k 0
1
t
t
t
t
1
t t , t t 0, f(x(t))
t
) (t H
f(x(s))ds
s
) q(s
f(x(s))ds
s
) (s H
)) c(t)g(x(t x(t)
=
+
+

+
+

(10)
1,2,3,... k f(x(s))ds
s
) (s H
f(x(s))ds
s
) q(s
) a (1 ) x(t a ) x(t
k
k
k
k
t
t
1
t
t
k k k k
=

+
+

+
+ =

(11)
From (6) and (9) for sufficiently large T, we can select >
0 and > 0 sufficiently small such that + < 1,
,
M
2
ds
s
) 2 (s H
) (t H
) q(t
ds
s
) (s H
M
) (t H
) (t H
1 ) ( sup lim
2
t
t
1
1
t
t
1 2
1
1
t

+
+
+
+

+
+

+
+ +
+ +

(12)
and
|c(t)| + , for t T. (13)
Let V(t) = V
1
(t) + V
2
(t) + V
3
(t) where
2
t
t
t
t
1
1
f(x(s))ds
s
) q(s
f(x(s))ds
s
) (s H
)) c(t)g(x(t x(t) (t) V

+
+ =

+ +
=

t
s
2
t
t
1
2
(x(u))duds f
u
) q(u
s
) 2 (s H
(t) V

+ +
+ +
+ +
=
t
t
2 1
t
s
2 1
t
t
1
3
(x(s))ds. g
s
) (s H
) (
(x(s))duds f
u
) (u H
s
) 2 (s H
(t) V

As t t
k
, calculating (t) V (t), V (t), V
3 2 1
along the solution
of (4) - (5),
[

t
t
2
t
t
2
t
t
2 1
t
t
2 1
2 2 1
1
(x(s))ds f
s
) q(s
(x(t))ds f
s
) q(s
(x(s))ds f
s
) (s H
(x(t))ds f
s
) (s H
(x(t)) f c(t) )) (x(t g c(t) )) 2x(t)f(x(t
t
) (t H
(t) V

Bonfring International Journal of Data Mining, Vol. 2, No. 2, June 2012 15
ISSN 2277 - 5048 | 2012 Bonfring

+ +

+ +

t
t
2 1
t
t
1 2
2
(x(s))ds f
s
) q(s
t
) (t H
ds
s
) 2 (s H
(x(t)) f
t
) q(t
(t) V


)). (x(t g
t
) (t H
) ( (x(t)) g
t
) (t H
) (
(x(s))ds f
s
) (s H
t
) (t H
ds
s
) 2 (s H
(x(t)) f
t
) (t H
(t) V
2 1 2 1
t
t
2 1 1
t
t
1 2 1
3

+
+
+ +
+ +
+ +

+ +
=

Therefore,
(x(t)) f
t
) (t H

M
) (t H
) (t H
1 ) ( ds
s
) 2 (s H
) (t H
) q(t
ds
s
) q(s
ds
s
) (s H
f(x(t))
2x(t)
(x(t)) f
t
) (t H
(t) V (t) V (t) V (t) V
2 1
2
1
1
t
t
1
1
t
t
t
t
1 2 1
3 2 1
+

+
+ +
+ +
+
+
+

+

+ + =

(14)
As t = t
k
, we have,
[
(x(s))ds g
s
) (s H
) (
(x(u))duds f
u
) (u H
s
) 2 (s H
(x(u))duds f
u
) q(u
s
) 2 (s H
f(x(s))ds
s
) q(s
f(x(s))ds
s
) (s H
)) )g(x(t c(t ) x(t ) V(t
2
t
t
1
t
s
2 1
t
t
1
t
s
2
t
t
1
2
t
t
t
t
1
k k k k
k
k
k k
k
k k
k
k
k
k
k

+ +
+ +
+ +
+
+ +
+

+ =

[
(x(s))ds g
s
) (s H
) (
(x(u))duds f
u
) (u H
s
) 2 (s H
(x(u))duds f
u
) q(u
s
) 2 (s H
f(x(s))ds
s
) q(s
f(x(s))ds
s
) (s H
)) )g(x(t c(t ) x(t a
2
t
t
1
t
s
2 1
t
t
1
t
s
2
t
t
1
2
t
t
t
t
1
k k k
2
k
k
k
k k
k
k k
k
k
k
k
k

+ +
+ +
+ +
+
+ +
+

+

), V(t
k

(15)
hence from (14) and (15), we get V(t) is decreasing and
), , (t L (x(t)) f
t
) (t H
0
1 2 1

+

and hence for 0 < h < 1 we have,
0. (x(s))ds f
s
) (s H
lim
t
h t
2 1
t
=
+

Since

+

+ +

t as 0 (x(u))du f
u
) (u H
M
2
(x(u))duds f
u
) q(u
s
) 2 (s H
t
t
2 1
2
t
t
t
s
2 1

and

+ +
+
+

+ +
+ +
+ +

t as 0 (x(s))ds f
s
) (s H
2M
(x(u))du f
u
) (u H
M
2
(x(s))ds g
s
) (s H
) (
(x(u))duds f
u
) (u H
s
) 2 (s H
t
t
2 1 2
t
t
2 1
2
t
t
2 1
t
t
t
s
2 1 1

We have 0. (t) V lim (t) V lim
3
t
2
t
= =

Thus
, V(t) lim (t) V lim
t
1
t
= =

that is,
. f(x(s))ds
s
) q(s
f(x(s))ds
s
) (s H
)) c(t)g(x(t x(t) lim
2
t
t
t
t
1
t
=

+
+

(16)
Now we will prove that the limit,

+
+

t
t
t
t
1
t
f(x(s))ds
s
) q(s
f(x(s))ds
s
) (s H
)) c(t)g(x(t x(t) lim

exists and is finite. Set

+
+ =
t
t
t
t
1
f(x(s))ds
s
) q(s
f(x(s))ds
s
) (s H
)) c(t)g(x(t x(t) z(t)

then
Bonfring International Journal of Data Mining, Vol. 2, No. 2, June 2012 16
ISSN 2277 - 5048 | 2012 Bonfring

+
+ =
t
t
t
t
1
k k k k
k
k
k
k
f(x(s))ds
s
) q(s
f(x(s))ds
s
) (s H
)) )g(x(t c(t ) x(t ) z(t

). z(t a
f(x(s))ds
s
) q(s
f(x(s))ds
s
) (s H
)) )g(x(t c(t ) x(t a
k k
t
t
t
t
1
k k k k
k
k
k
k

+
+ =

In view of (16) we have,
. (t) z lim
2
t
=

(17)
Moreover, equation (10) - (11) can be written as,
. 1,2,3,... k ), z(t a ) z(t
t t , t t 0, f(x(t))
t
) (t H
(t) z
k k k
k 0
1
= =
=
+
+

(18)
If = 0, then 0. z(t) lim
t
=

If > 0, then there exists a large
T
2
such that z(t) 0 for t T
2
. Therefore t
k
> T
2
, t [t
k
, t
k+1
).
Without loss of generality, we assume that z(t) > 0 on [t
k
, t
k+1
),
it follows that z(t
k+1
) = a
k
) z(t
1 k

+
> 0, thus z(t) > 0 on [t
k+1
,
t
k+2
). By induction, we can conclude that z(t) > 0 on [t
k
,).
From (17), we have,
f(x(s))ds
s
) q(s
f(x(s))ds
s
) (s H
)) c(t)g(x(t x(t) lim z(t) lim
t
t
t
t
1
t t
=

+
+ =

(19)
must exist and is finite. In view of (18), we have,
. ) )z(t a (1 z(t) ) z(t
)] z(t ) [z(t z(t) ) z(t f(x(s))ds
s
) (s H
t t t
k k
t t t
k k
t
t
1
k
k

< <

< <

=
+ =
+

Now let, t and note that , ) 1 (
1
<

= k
k
a we have
0. f(x(s))ds
s
) (s H
lim
t
t
1
t
=
+

(20)
From (19), we have
[
f(x(s))ds
s
) q(s
)) c(t)g(x(t x(t) lim
t
t
t
=

(21)
Next we show that |x(t)| is bounded. Infact, if |x(t)| is
unbounded, then there exists a sequence {s
n
} such that
s
n
, |x(s
n
)| as n and x(t) sup ) x(s
n 0
s t t
n
< <

= where, if
s
n
is not an impulsive point then ). x(s ) x(s
n n
=

Thus we have,

+
+
+

+
+

n as ds
s
) q(s
M )N ( 1 ) x(s
f(x(s))ds
s
) q(s
)) g(x(s ) c(s ) x(s
f(x(s))ds
s
) q(s
)) )g(x(s c(s ) x(s
s
s
2 2 n
s
s
n n n
s
s
n n n
n
n
n
n
n
n

which contradicts (21), so |x(t)| is bounded.
Also by (8) we obtain

+

t as 0 x(s)ds
s
) q(s
M
ds f(x(s))
s
) q(s
f(x(s))ds
s
) q(s
0
t
t
2
t
t
t
t

which together with (21) gives,
. ))] c(t)g(x(t [x(t) lim
t
= +

(22)
Next we shall prove that
finite. is and exists x(t) lim
t
(23)
If = 0, clearly , x(t) lim
t
=

which shows that (23) holds.

If 0 < < 1, in which c(t) is eventually positive or
negative. Otherwise, there is a sequence
1
,
2
, ,
k
, with

k
as k such that c(
k
) = 0 so c(
k
) 0. It is a
contradiction with > 0.
By condition (6), one can find a sufficiently large T such
that t > T, |c(t)| < 1. Set
x(t), sup lim v x(t), inf lim u
t t
= =
then we can choose two sequences {u
n
} and {v
n
} such that
u
n
, v
n
as n , and
v ) x(v lim u, ) x(u lim
n
n
n
n
= =


for t > T. Consider the following two possible cases
Case (1) : 0 < c(t) < 1 for t > T, we have,
v, N u ))] )g(x(u c(u ) [x(u lim
2 n n n
n
+ + =


and
u. N v ))] )g(x(v c(v ) [x(v lim
1 n n n
n
+ + =


Thus, we obtain
v(1 N
2
) u(1 N
1
).
Since 0 < < 1 and v u, it follows that u = v. By (21)
we observe that (23) holds.
Case (2) : When 1 < c(t) < 0, for t > T it can be easily
verified that u = v. This shows that (23) holds and so the
proof of theorem is complete.
Bonfring International Journal of Data Mining, Vol. 2, No. 2, June 2012 17
ISSN 2277 - 5048 | 2012 Bonfring

Theorem 2.2: The conditions of Theorem 2.1 imply that
every oscillatory solution of (4) - (5) tends to zero as t .
Theorem 2.3: The conditions in Theorem 2.1 together with
=
+

0
t
1
ds
s
) (s H
(24)
imply that every solution of (4) - (5) tends to zero as t
.

Proof: By Theorem 2.2, we only have to prove that every
nonoscillatory solution of (4) - (5) tends to zero as t . Let
x(t) be an eventually positive solution (4) - (5). We shall
prove 0. x(t) lim
t
=

As in the proof of Theorem 2.1,
integrating both sides of (18) from t
0
to t yields
. ) )z(t a (1 z(t) ) z(t f(x(s))ds
s
) (s H
t t t
k k 0
t
t
1
k 0
0

< <

=
+

Using (19) and , ) a (1
1 k
k
<

=
we have
. f(x(s))ds
s
) (s H
0
t
1
<
+

This, together with (24) yields 0. f(x(t)) inf lim
t
=

We
claim that
0. x(t) inf lim
t
=

(25)
Let {
m
} be a sequence such that
m
as m and
0 )) f(x( lim
m
m
=

we must have 0. ) x( inf lim
m
m
= =

l In fact,
if > 0, then, there is a subsequence } {
k
m
such that
/2 ) x(
k
m
l for k sufficiently large. By (A1), we have
M )) f(x(
1 m
k
for some > 0 and sufficiently large k, which
yields a contradiction because of 0. )) f(x( lim
k
m
k
=

Therefore
(25) holds. On the other hand, by Theorem 2.1, we have
0. x(t) lim
t
=

Thus the proof of Theorem 2.3 is complete.
Next we assume that (t) = at, (t) = bt, (t) = ht, where a,
b, h are real numbers such that 0 < a, b h < 1. The equations
(1) - (2) reduces to
k 0
t t , t t
0, f(x(h(t)))
t
q(t)
f(x(b(t)))
t
p(t)
] t))) c(t)g(x(a( [x(t)

= + +

(26)
1,2,3,... k , f(x(s))ds
s
q(s/h)
f(x(s))ds
s
p(s/b)
) a (1 ) x(t a ) x(t
k
k
k
k
t
ht
t
bt
k k k k
=

+ =

(27)

Theorem 2.4: Let (A1) - (A3) hold. Assume that
) c(t a ) c(t
k k k

=
1, c(t) lim
t
< =

(28)
(A7) ht/b t t for 0
h
bt
q p(t) (t) H
*
2
= >

= (29)
(A8) 0 ds
s
q(s/h)
lim
ht
bt
t
=

(30)
(A9)
.
M
2
ds
s
) (s/b H
(t/b) H
q(t/h)
ds
s
(s/b) H
M
(t/b) H
(t/ab) H
1 sup lim
2
t
bt
2
2
2
t/b
bt
2 2
2
2
t
<

(31)
Then every solution of (26) - (27) tends to a constant as
t .

Proof. Let x(t) be any solution of (26) and (27). We shall
prove that x(t) lim
t
exists and is finite. For this purpose we
rewrite (26) - (27) in the form
k 0
2
ht
bt
t
bt
2
t t , t t 0, f(x(t))
t
(t/b) H
f(x(s))ds
s
q(s/h)
f(x(s))ds
s
(s/b) H
)) c(t)g(x(at x(t)
k
k
= +

(32)
1,2,3,... k , f(x(s))ds
s
(s/b) H
f(x(s))ds
s
q(s/h)
) a (1 ) x(t a ) x(t
k
k
k
k
t
bt
2
ht
bt
k k k k
=

+ =

(33)
For (3), (28) we can select > 0 and > 0 sufficiently
small such that + < 1,

M
2
ds
s
) (s/b H
(t/b) H
q(t/h)
ds
s
(s/b) H
M
(t/b) H
(t/ab) H
1 ) ( sup lim
2
t
bt
2
2
2
t/b
bt
2 2
2
2
t
<

+ +

(34)
and
|c(t)| + , for t T (35)
Let V(t) = V
1
(t) + V
2
(t) + V
3
(t)
where,
2
ht
bt
t
bt
2
1
f(x(s))ds
s
q(s/h)
f(x(s))ds
s
(s/b) H
)) c(t)g(x(at x(t) (t) V

+ =

Bonfring International Journal of Data Mining, Vol. 2, No. 2, June 2012 18
ISSN 2277 - 5048 | 2012 Bonfring

=
t
bt
t
s
2
2
2
2
(x(u))duds f
u
q(u/h)
s
) (s/b H
(t) V

+ +
=
t
at
2 2
t
s
2 2
t
bt
2
2
3
(x(s))ds g
s
(s/ab) H
) (
(x(u))duds f
u
(u/b) H
s
) (s/b H
(t) V

As t t
k
, calculating
3 2 1
V , V , V along the solution of
(26) - (27),
[

ht
bt
2
ht
bt
2
t
bt
2 2
t
bt
2 2
2 2 2
1
(x(s))ds f
s
q(s/h)
ds
s
q(s/h)
(x(t)) f
(x(s))ds f
s
(s/b) H
ds
s
(s/b) H
(x(t)) f
(x(t)) f c(t) (x(at)) g c(t) )) 2x(t)f(x(t
t
(t/b) H
(t) V

ht
bt
2 2
t
bt
2
2 2
2
ds (x(s)) f
s
q(s/h)
t
(t/b) H
ds
s
) (s/b H
(x(t)) f
t
q(t/h)
(t) V

(x(at)) g
t
(t/b) H
) ( (x(t)) g
t
(t/ab) H
) (
(x(s))ds f
s
(s/b) H
t
(t/b) H
ds
s
) (s/b H
(x(t)) f
t
(t/b) H
(t) V
2 2 2 2
t
bt
2 2 2
t
bt
2
2 2 2
3
+ + +

Therefore,
(x(t)). f
t
(t/b) H
M
(t/b) H
(t/ab) H
1 ) ( ds
s
) (s/b H
(t/b) H
q(t/h)
ds
s
(s/b) H
M
2
(x(t)) f
t
(t/b) H
(t) V (t) V (t) V (t) V
2 2
2
2
2
t
bt
2
2
2
t/b
bt
2
2
2 2
3 2 1

+ + + +

+ + =

(36)
As t = t
k
, we have,
[

+ +
+
+

+ =
k
k
k k
k
k k
k
k
k
k
k
t
at
2 2
t
s
2 2
t
bt
2
2
t
s
2
t
bt
2
2
2
ht
bt
t
bt
2
k k k k
(x(s))ds g
s
(s/ab) H
) (
(x(u))duds f
u
(u/b) H
s
) (s/b H
(x(u))duds f
u
q(u/h)
s
) (s/b H
f(x(s))ds
s
q(s/h)
f(x(s))ds
s
(s/b) H
)) )g(x(at c(t ) x(t ) V(t

[
). V(t
(x(s))ds g
s
(s/ab) H
) (
(x(u))duds f
u
(u/b) H
s
) (s/b H
(x(u))duds f
u
q(u/h)
s
) (s/b H
f(x(s))ds
s
q(s/h)
f(x(s))ds
s
(s/b) H
)) )g(x(at c(t ) x(t a
k
t
at
2 2
t
s
2 2
t
bt
2
2
t
s
2
t
bt
2
2
2
ht
bt
t
bt
2
k k k
2
k
k
k
k k
k
k k
k
k
k
k
k

+ +
+
+

+ =

From (36) and (37), we get V(t) is decreasing and
), , (t L (x(t)) f
t
(t/b) H
0
1 2 2

and hence for 0 < h
1
< 1 we have,
0. (x(s))ds f
s
(s/b) H
lim
t
t h
2 2
t
1
=

Since

t as 0 (x(u))du f
u
(u/b) H
M
2
ds (x(u))du f ds
u
q(u/h)
s
) (s/b H
t
bt
2 2
2
t
bt
t
s
2
2
2

and
Bonfring International Journal of Data Mining, Vol. 2, No. 2, June 2012 19
ISSN 2277 - 5048 | 2012 Bonfring
+

+ +

t as 0 (x(s))ds f
s
(s/b) H
2M
(x(u))du f
u
(u/b) H
M
2
(x(s))ds g
s
(s/ab) H
) (
(x(u))duds f
u
(u/b) H
s
) (s/b H
2
t
at
2 2
2
t
bt
2
2
2
t
at
2
2
t
s
2
t
bt
2
2

Hence 0. (t) V lim (t) V lim
3
t
2
t
= =

Thus
, V(t) lim (t) V lim
t
1
t
= =

that is
. f(x(s))ds
s
q(s/h)
f(x(s))ds
s
(s/b) H
)) c(t)g(x(at x(t) lim
2
ht
bt
t
bt
2
t
=

(38)
Now we will prove that the limit,

ht
bt
t
bt
2
t
f(x(s))ds
s
q(s/h)
f(x(s))ds
s
(s/b) H
)) c(t)g(x(at x(t) lim

exists and is finite. Set

+ =
ht
bt
t
bt
2
1
f(x(s))ds
s
q(s/h)
f(x(s))ds
s
(s/b) H
)) c(t)g(x(at x(t) (t) z

then
). (t z a
f(x(s))ds
s
q(s/h)
f(x(s))ds
s
(s/b) H
)) )g(x(at c(t ) x(t a
f(x(s))ds
s
q(s/h)
f(x(s))ds
s
(s/b) H
)) )g(x(at c(t ) x(t ) (t z
k 1 k
ht
bt
t
bt
2
k k k k
ht
bt
t
bt
2
k k k k 1
k
k
k
k
k
k
k
k

+ =

+ =

In view of (38) we have,
. (t) z lim
2
1
t
=

(39)
Moreover, equation (32) - (33) can be written as,
. 1,2,3,... k ), (t z a ) (t z
t t , t t 0, f(x(t))
t
(t/b) H
(t) z
k 1 k k 1
k 0
2
1
= =
= +

(40)
If = 0, then 0. (t) z lim
1
t
=

If > 0, then there exists an
enough large T
2
such that z
1
(t) 0 for t T
2
. Therefore
t
k
> T
2
, t [t
k
, t
k+1
). Without loss of generality, we assume
that z
1
(t) > 0 on [t
k
, t
k+1
). It follows that
z
1
(t
k+1
) = a
k
z
1
(

+1 k
t ) > 0 and thus z
1
(t) > 0 on [t
k+1
, t
k+2
). By
induction, we can conclude that z
1
(t) > 0 on [t
k
, ). From
(39), we have,
f(x(s))ds
s
q(s/h)
f(x(s))ds
s
(s/b) H
)) c(t)g(x(at x(t) lim (t) z lim
ht
bt
t
bt
2
t
1
t
=

+ =

(41)
where = and is finite. In view of (40), we have,

< <

< <

+ =
+ =
t t bt
k 1 k 1 1
t t bt
k 1 k 1 1 1
t
bt
2
k
k
) (t )z a (1 (t) z (bt) z
)] (t z ) (t [z (t) z (bt) z f(x(s))ds
s
(s/b) H

letting t and note that , ) a (1
1 k
k
<

=
we have
0 f(x(s))ds
s
(s/b) H
lim
t
bt
2
t
=

(42)
From (41), we have
f(x(s))ds
s
q(s/h)
)) c(t)g(x(at x(t) lim
ht
bt
t
=

+


(43)
Next we shall prove that ))] c(t)g(x(at x(t) [ lim
t
+

exists and
is finite.
To prove this, first we prove that |x(t)| is bounded. Infact,
if |x(t)| is unbounded, then there exists a sequence {s
n
} such
that s
n
, |x(s
n
)| as n and x(t) sup ) x(s
n 0
s t t
n
< <

=
where, if s
n
is not an impulsive point then ). x(s ) x(s
n n
=

Thus
we have,

+
+

n as f(x(s))ds
s
q(s/h)
M )N ( 1 ) x(s
f(x(s))ds
s
q(s/h)
)) )g(x(as c(s ) x(s
n
n
n
n
hs
bs
2 2 n
hs
bs
n n n

which contradicts (43), so |x(t)| is bounded.

Also by (30) we obtain
Bonfring International Journal of Data Mining, Vol. 2, No. 2, June 2012 20
ISSN 2277 - 5048 | 2012 Bonfring


t as x(s)ds
s
q(s/h)
M f(x(s))ds
s
q(s/h)
0
ht
bt
2
ht
bt

which together with (43) gives
))] c(t)g(x(at [x(t) lim
t
= +

(44)
Finally, we shall prove that
x(t) lim
t
exists and is finite. (45)
The rest of the proof is similar to the proof of Theorem
2.1. This shows that (45) holds and so the proof of theorem is
complete.
Theorem 2.5: The conditions of Theorem 2.4 imply that
every oscillatory solution of (26) - (27) tends to zero as t .

Theorem 2.6: The conditions in Theorem 2.4 together with
=

0
t
2
ds
s
(s/b) H
(46)
imply that every solution of (26) - (27) tends to zero as t
.
Proof: By Theorem 2.5, we only have to verify that every
nonoscillatory solution of (26) - (27) tends to zero as t .
Let x(t) be an eventually positive solution (26) - (27). Now
we shall prove 0. x(t) lim
t
=

As in the proof of Theorem 2.4,
integrating both sides of (40) from t
0
to t yields

< <

=
t t t
k 1 k 1 0 1
t
t
2
k 0
0
) (t )z a (1 (t) z ) (t z f(x(s))ds
s
(s/b) H

by using (41) and , ) a (1
1 k
k
<

=
we have
. f(x(s))ds
s
(s/b) H
0
t
2
<

This, together with (46) yields 0. f(x(t)) inf lim
t
=

We
claim that
0. x(t) inf lim
t
=

(47)
The rest of the proof is similar to the proof of Theorem
2.3. Thus the proof of Theorem 2.6 is complete.
III. EXAMPLES
Example 3.1: Consider the impulsive neutral differential
equation
k t 2, t t 0, 1) 1))]x(t (x(t sin [1
8t
1
2) 2))]x(t (x(t sin [1
4t
1
1/2) 1/2))x(t (x(t cos (1
20t
1 t
x(t)
0
2
2
2
> = +
+ +

+

3,4,5,... k , )ds (x(s))]x(s sin [1
8s
1
)ds (x(s))]x(s sin [1
4s
1
k
1
) x(k
k
1 k
x(k)
k
1 k
2
k
2 k
2
3 3
3
=

+ +

(48)
One can easily verify that
, ds
s
) (s H
1,
20
1
c(t) lim
0
t
1
t
=
+
< =

and
1 0.25 ds
s
) 2 (s H
p) (t H
) q(t
ds
s
) (s H
M
p) (t H
) (t H
1 sup lim
t
t
1
1
t
t
1 2
1
1
t
< =

+
+
+
+

+
+

+
+ +
+

By Theorem 2.3, every solution of (48) tends to zero as t
.
Example 3.2: Consider the impulsive neutral differential
equation
k t 1, t t 0, (t/e) (x(t/e))]x sin [1
8t
1
(t/e) (x(t/e))]x sin [1
4t
1
t/e) (x(t/e))x( cos (1
30t
1 t
x(t)
0
2
2
2
> = +
+ +

+

1,2,3,... k , )ds (x(s))]x(s sin [1
8s
1
)ds (x(s))]x(s sin [1
4s
1
k
1
) x(k
k
1 k
x(k)
k
k/e
2
k
k/e
2
2 2
2
=

+ +

(49)
One can easily verify that
, ds
s
(s/b) H
1,
30
1
c(t) lim
0
t
2
t
= < =

and
1 0.541 ds
s
) (s/b H
(t/b) H
q(t/h)
ds
s
(s/b) H
M
(t/b) H
(t/ab) H
1 sup lim
t
bt
2
2
2
t/b
bt
2 2
2
2
t
< =

By Theorem 2.6, every solution of (49) tends to zero as t
.
IV. CONCLUSION
In this paper we establish sufficient conditions which
ensure that all solutions of (1) (2) tends to constant or zero
as t . We have also studied the asymptotic behavior
results for nonlinear functional impulsive differential
Bonfring International Journal of Data Mining, Vol. 2, No. 2, June 2012 21
ISSN 2277 - 5048 | 2012 Bonfring
equations by taking different choices of (t), (t) and (t).
REFERENCES
[1] V. Lakshimikantham, D.D. Bainov and P.S. Simeonov, Theory of
Impulsive Differential Equations, World Scientific, Singapore, 1989.
[2] D.D. Bainov and P.S. Simeonov, Impulsive Differential Equations:
Periodic Solutions and Applications, Longman, Harlow, 1993.
[3] Aimin Zhao and Jurang Yan, Asymptotic behavior of solutions of
impulsive delay differential equations, J. Math. Anal. Appl., Volume
201, pp. 943954, 1996.
[4] Jianhua Shen, Zhiguo Luo and Xinzhi Liu, Impulsive stabilization for
functional differential equations via Liapunov functional, J. Math.
Anal. Appl., Volume 240, pp. 115, 1999.
[5] Xinzhi Liu and G. Ballinger, Existence and continuability of solutions
for differential equations with delays and state dependent impulses,
Nonlinear Anal., Volume 51, pp. 633647, 2002.
[6] Gengping Wei and Jianhua Shen, Asymptotic behavior of solutions of
non linear impulsive delay differential equations with positive and
negative coefficients, Math & Comp. Modelling, Volume 44,
pp. 10891096, 2006.
[7] Jiowan Luo and Lokenath Debnath, Asymptotic behavior of solutions
of forced non-linear neutral delay differential equations with impulses,
J. Appl. Math. & Computing, Volume 12, pp. 3947, 2003.
[8] K.Z. Guan and J.H. Shen, Aymptotic behavior of solutions of a first
order impulsive neutral differential equation in Euler form, Appl. Math.
Letters, 2011, (to appear).
[9] S. Pandian, G. Purushothaman and Y. Balachandran, Asymptotic
behavior of solutions of nonlinear neutral delay impulsive differential
equations with positive and negative coefficients, Far East J. Math.
Sci., Volume 51, pp. 165178, 2011.
[10] J.H. Shen and J.S. Yu, Asymptotic behavior of solutions of neutral
differential equations with positive and negative coefficients, J. Math.
Anal. Appl., Volume 195, pp. 517526, 1995.
[11] J.H. Shen, Y.S. Liu and J.L. Li, Asymptotic behavior of solutions of
nonlinear neutral differential equations with impulses, J. Math. Anal.
Appl., Volume 332, 179189, 2007.
[12] G. Ladas, Y.G. Sficas and I.P. Stavroulakis, Asymptotic behavior of
solutions of retarded differential equations, Proc. Amer. Math. Soc.,
Volume 88, pp. 247253, 1983.