Open Access

Numerical oscillations for first-order nonlinear delay differential equations in a hematopoiesis model

Advances in Difference Equations20132013:163

https://doi.org/10.1186/1687-1847-2013-163

Received: 12 November 2012

Accepted: 24 May 2013

Published: 10 June 2013

Abstract

In this paper, we consider the oscillations of numerical solutions for the nonlinear delay differential equations in a hematopoiesis model. Using two θ-methods, namely the linear θ-method and the one-leg θ-method, several conditions, under which the numerical solutions oscillate, are obtained. Moreover, it is proved that every non-oscillatory numerical solution tends to an equilibrium point of the original system. Some numerical experiments are provided to support the theoretical results.

MSC:65L05, 65L20.

Keywords

nonlinear delay differential equations numerical solutions oscillations non-oscillations

1 Introduction

In recent years, there has been much research activity concerning the oscillatory behavior of solutions of difference equations [1, 2], differential equations with piecewise continuous arguments (EPCA) [3, 4], dynamic equations [5, 6] and partial differential equations [7, 8]. Among these investigations, oscillations of solutions of delay differential equations (DDEs) have also been the subject of many recent studies [912]. The strong interest in this study is motivated by the fact that it has many useful applications in some mathematical models such as biology, ecology, spread of some infectious diseases in humans and so on. For more information on this study, the reader can see [13, 14] and the references therein.

Relative to the investigation of the oscillations of the analytic solutions, much research has been focused on the corresponding behavior of the numerical solutions for DDEs. In [15, 16], oscillations of numerical solutions in θ-methods and Runge-Kutta methods for a linear EPCA x ( t ) + a x ( t ) + a 1 x ( [ t 1 ] ) = 0 were considered, respectively. Wang et al. [17] studied numerical oscillations of alternately advanced and retarded EPCA, the conditions of oscillations for the θ-methods are obtained. To the best of our knowledge, until now very few results dealing with the oscillations of the numerical solutions for nonlinear DDEs have been reported except for [18]. Different from [18], in our paper, we consider another nonlinear DDEs in a hematopoiesis model and get some new results.

In this paper, we consider the following equation:
x ( t ) + p x ( t ) q x ( t ) r + x α ( t τ ) = 0 , t 0 ,
(1)
with the conditions
p , q , r , τ ( 0 , ) , α N = { 1 , 2 , } , q / p > r .
(2)
Equation (1) is one of the models proposed by Nazarenko [19] to study the control of a single population of cells. Here x ( t ) is the size of the population of cells, and cells are lost at a rate p, and the function
F ( u ) = q u r + u α ( t τ )

is the flux function, which depends on the size of cells x ( t ) and x ( t τ ) at times t and t τ , respectively, and τ is the time of maturation. The model (1) has been recently investigated by several researchers. Kubiaczyk and Saker [20] considered Equation (1) and gave a sufficient condition for oscillations of all solutions about the positive unique equilibrium point K and proved that every non-oscillatory positive solution of Equation (1) tends to K as t . Following up the investigation in [20], Saker and Agarwal [21] studied the oscillations and global attractivity of Equation (1) with time periodic coefficients. Song et al. [22] considered the existence of local and global Hopf bifurcations of Equation (1). Up to now, few results on the properties of numerical solutions for Equation (1) were established. In the present paper, we investigate some sufficient conditions under which the numerical solutions are oscillatory. We also consider the asymptotic behavior of non-oscillatory numerical solutions.

The remainder of this paper is organized as follows. In the next section, some necessary concepts and results for oscillations of the analytic solutions are given. In Section 3, we obtain a recurrence relation by applying the θ-methods to the simplified form which comes from making an invariant oscillation transformation on Equation (1). Moreover, the oscillations of the numerical solutions are discussed and conditions under which the numerical solutions oscillate are obtained. In Section 4, we investigate the asymptotic behavior of non-oscillatory solutions, and the results of some numerical experiments are given in Section 5. Finally, conclusions are drawn in Section 6.

2 Preliminaries

Definition 2.1 A solution x ( t ) of Equation (1) is said to oscillate about K if x ( t ) K has arbitrarily large zeros. Otherwise, x ( t ) is called non-oscillatory. When K = 0 , we say that x ( t ) oscillates about zero or simply oscillates.

Definition 2.2 A sequence { x n } is said to oscillate about { y n } if { x n y n } is neither eventually positive nor eventually negative. Otherwise, { x n } is called non-oscillatory. If { y n } = { y } is a constant sequence, we simply say that { x n } oscillates about { y } . When { y n } = { 0 } , we say that { x n } oscillates about zero or simply oscillates.

Definition 2.3 We say Equation (1) oscillates if all of its solutions are oscillatory.

Theorem 2.4 (see [23])

Consider the difference equation
a n + 1 a n + j = k l q j a n + j = 0 ,
(3)
assume that k , l N and q j R for j = k , , l . Then the following statements are equivalent:
  1. (i)

    Every solution of Equation (3) oscillates;

     
  2. (ii)

    The characteristic equation λ 1 + j = k l q j λ j = 0 has no positive roots.

     

Theorem 2.5 (see [23])

Consider the difference equation
a n + 1 a n + ω a n k = 0 ,
(4)
where n = 0 , 1 , 2 ,  , ω R and k Z . Then every solution of Equation (4) oscillates if and only if one of the following conditions holds:
  1. (i)

    k = 1 and ω 1 ;

     
  2. (ii)

    k = 0 and ω 1 ;

     
  3. (iii)

    k { , 3 , 2 } { 1 , 2 , } and ω ( k + 1 ) k + 1 / k k > 1 .

     

Lemma 2.6 For x > 1 and x 0 , we have ln ( 1 + x ) > x / ( 1 + x ) .

Lemma 2.7 For x < 1 and x 0 , we have e x < 1 / ( 1 x ) .

Lemma 2.8 (see [24])

For all m M ,
  1. (i)

    ( 1 + a / ( m θ a ) ) m e a if and only if 1 / 2 θ 1 for a > 0 , φ ( 1 ) θ 1 for a < 0 ;

     
  2. (ii)

    ( 1 + a / ( m θ a ) ) m < e a if and only if 0 θ < 1 / 2 for a < 0 , 0 θ φ ( 1 ) for a > 0 ,

     

where φ ( x ) = 1 / x 1 / ( e x 1 ) and M is a positive constant.

Theorem 2.9 (see [20])

Assume that condition (2) holds, then every solution of Equation (1) oscillates about K if and only if
α q K α ( r + K α ) 2 τ > 1 e ,
(5)
where
K = ( q p r ) 1 / α

is the unique positive equilibrium point of Equation (1).

For simplicity, let
T = α q K α ( r + K α ) 2 ,
(6)
then (5) can be written as
T τ > 1 e .
(7)

3 Oscillations of numerical solutions

3.1 Transformation

We associate an initial condition of the form
x ( t ) = ψ ( t ) , τ t 0 ,
(8)

with Equation (1), where ψ C ( [ τ , 0 ] , ( 0 , ) ) , ψ ( 0 ) > 0 .

According to the corresponding method in [20], let us introduce an invariant oscillation transformation x ( t ) = K e z ( t ) , then Equation (1) can be reduced to
z ( t ) + α q K α ( r + K α ) 2 f ( z ( t τ ) ) = 0 ,
(9)
where
f ( u ) = r + K μ α e α u 1 r + K α e α u .

Then x ( t ) oscillates about K if and only if z ( t ) oscillates.

3.2 The difference scheme

Applying the linear θ-method and the one-leg θ-method to Equation (9), we obtain the same recurrence relation
z n + 1 = z n h θ α q K α ( r + K α ) 2 f ( z n + 1 m ) h ( 1 θ ) α q K α ( r + K α ) 2 f ( z n m ) ,
(10)

where 0 θ 1 , h = τ / m , m is a positive integer. z n + 1 and z n + 1 m are approximations to z ( t ) and z ( t τ ) of Equation (9) at t n + 1 , respectively.

Let z n = ln ( x n / K ) , then we have
x n + 1 = x n exp ( h θ p K α x n + 1 m α r + x n + 1 m α + h ( 1 θ ) p K α x n m α r + x n m α ) .
(11)

Definition 3.1 We call the iteration formula (11) the exponential θ-method for Equation (1), where θ [ 0 , 1 ] , h = τ / m , m N = { 1 , 2 , } , x n + 1 and x n + 1 m are approximations to x ( t ) and x ( t τ ) of Equation (1) at t n + 1 , respectively.

The convergence of the exponential θ-method is given in the following theorem.

Theorem 3.2 The exponential θ-method (11) is convergent with order
{ 1 , when θ 1 / 2 , 2 , when θ = 1 / 2 .

Proof By the method of steps which is introduced in [25], we can easily get this proof. □

3.3 Oscillation analysis

It is not difficult to show that x n oscillates about K if and only if z n is oscillatory. In order to study the oscillations of (11), we only need to consider the oscillations of (10). The following conditions which are taken from [20] will be used in the next analysis:
u f ( u ) > 0 , for  u 0 , lim u 0 f ( u ) u = 1 .
(12)
For (10), its linearized form is given by
z n + 1 = z n h θ α q K α ( r + K α ) 2 z n + 1 m h ( 1 θ ) α q K α ( r + K α ) 2 z n m .
(13)
Then, by taking into account (6), Equation (13) is equivalent to
z n + 1 z n + h θ T z n + 1 m + h ( 1 θ ) T z n m = 0 .
(14)

It follows from [23] that (10) oscillates if (14) oscillates under condition (12).

Definition 3.3 The iteration (11) is said to be oscillatory if all of its solutions are oscillatory.

Definition 3.4 We say that the exponential θ-method preserves the oscillations of Equation (1) if Equation (1) oscillates, then there is a h 0 > 0 or h 0 = such that (11) oscillates for h < h 0 . Similarly, we say that the exponential θ-method preserves the non-oscillations of Equation (1) if Equation (1) non-oscillates, then there is a h 0 > 0 or h 0 = such that (11) non-oscillates for h < h 0 .

In the following, we study whether the exponential θ-method preserves the oscillations of Equation (1). That is, when Theorem 2.9 holds, we investigate the conditions under which (11) is oscillatory.

Lemma 3.5 The characteristic equation of (13) is given by
ξ = R ( h T ξ m ) ,
(15)

where the function R ( x ) = 1 + x / ( 1 θ x ) , θ is a parameter in the exponential θ-method.

Proof Let z n = ξ n z 0 in (13), we have
ξ n + 1 z 0 = ξ n z 0 h θ T ξ n + 1 m z 0 h ( 1 θ ) T ξ n m z 0 .
That is,
ξ = 1 h θ T ξ 1 m h ( 1 θ ) T ξ m ,
which is equivalent to
ξ = 1 h ( 1 θ ) T ξ m 1 + h θ T ξ m = 1 h T ξ m 1 + h θ T ξ m .
In view of [26], the stability function of the θ-method is
R ( x ) = 1 + ( 1 θ ) x 1 θ x = 1 + x 1 θ x ,

then the characteristic equation of (13) is given by (15). This completes the present proof. □

Lemma 3.6 If T τ > 1 / e , then the characteristic equation (15) has no positive roots for 0 θ 1 / 2 .

Proof Let V ( ξ ) = ξ R ( h T ξ m ) . By Lemma 2.8, we know that
R ( h T ξ m ) exp ( h T ξ m ) , ξ > 0 , 0 θ 1 / 2 .
(16)
Now we are going to prove that W ( ξ ) = ξ exp ( h T ξ m ) > 0 for ξ > 0 . Suppose the opposite, that is, there exists a ξ 0 > 0 such that W ( ξ 0 ) 0 , then ξ 0 exp ( h T ξ 0 m ) , and
ξ 0 m exp ( h m T ξ 0 m ) = exp ( T τ ξ 0 m ) .
(17)
Multiplying both sides of the inequality (17) by T τ e ξ 0 m , we obtain
T τ e ξ 0 m ξ 0 m T τ e ξ 0 m exp ( T τ ξ 0 m ) ,
which gives
T τ e T τ ξ 0 m exp ( 1 T τ ξ 0 m ) ,

therefore we have the following two cases.

Case I: If 1 T τ ξ 0 m = 0 , then T τ e 1 , we arrive at the contradiction with the condition T τ > 1 / e .

Case II: If 1 T τ ξ 0 m 0 , then according to Lemma 2.7, we get
exp ( 1 T τ ξ 0 m ) < 1 1 ( 1 T τ ξ 0 m ) = 1 T τ ξ 0 m ,
that is,
T τ ξ 0 m exp ( 1 T τ ξ 0 m ) < 1 ,

so T τ e < 1 , which is also a contradiction to T τ > 1 / e .

Consequently, for ξ > 0 ,
V ( ξ ) = ξ R ( h T ξ m ) ξ exp ( h T ξ m ) = W ( ξ ) > 0 ,

which implies that the characteristic equation (15) has no positive roots. The proof is completed. □

Without loss of generality, in the case of 1 / 2 < θ 1 , we assume that m > 1 .

Lemma 3.7 If T τ > 1 / e and 1 / 2 < θ 1 , then the characteristic equation (15) has no positive roots for h < h 0 , where
h 0 = { , if T τ 1 , τ ( 1 + ln T τ ) , if T τ < 1 .
Proof Since R ( h T ξ m ) is an increasing function of θ when ξ > 0 , then for ξ > 0 and 1 / 2 < θ 1 ,
R ( h T ξ m ) = 1 h ( 1 θ ) T ξ m 1 + h θ T ξ m 1 1 + h T ξ m .
In the following, we prove that the inequality
ξ 1 1 + h T ξ m > 0 , ξ > 0 ,
(18)

holds under certain conditions.

From (18), it follows that
ξ 1 1 + h T ξ m = ξ 1 m 1 + h T ξ m ρ ( ξ ) ,
where
ρ ( ξ ) = ξ m ξ m 1 + h T ,
so we only need to prove ρ ( ξ ) > 0 for ξ > 0 . It is easy to know that ρ ( ξ ) is the characteristic polynomial of the following difference scheme:
z n + 1 z n + h T z n + 1 m = 0 .
According to Theorems 2.4 and 2.5, we have that ρ ( ξ ) has no positive roots if and only if
h T m m ( m 1 ) m 1 > 1 ,
or, equivalently,
ln T τ + ( m 1 ) ln m m 1 > 0 .
(19)

We examine two cases depending on the position of : Either T τ 1 or T τ < 1 .

Case I: If T τ 1 , in view of m > 1 , then (19) holds true.

Case II: If T τ < 1 and h < τ ( 1 + ln T τ ) , then by Lemma 2.6 we obtain
ln T τ + ( m 1 ) ln m m 1 = ln T τ + ( m 1 ) ln ( 1 + 1 m 1 ) > ln T τ + ( m 1 ) 1 m 1 1 + 1 m 1 = ln T τ + m 1 m > 0 .
Therefore the inequality (18) holds for h < h 0 , where
h 0 = { , if  T τ 1 , τ ( 1 + ln T τ ) , if  T τ < 1 .
So we arrive at
V ( ξ ) = ξ R ( h T ξ m ) ξ 1 1 + h T ξ m > 0

holds for h < h 0 and ξ > 0 , which implies that the characteristic equation (15) has no positive roots. This completes the proof. □

Remark 3.8 Since T τ ( 1 / e , 1 ) , then h 0 = τ ( 1 + ln T τ ) > 0 , thus h 0 is meaningful.

In view of (12), Lemmas 3.6, 3.7 and Theorem 2.4, we have the first main theorem of this paper.

Theorem 3.9 If T τ > 1 / e , then (11) is oscillatory for
h < { , when 0 θ 1 / 2 , h 0 , when 1 / 2 < θ 1 ,

where h 0 is defined in Lemma  3.7.

4 Asymptotic behavior of non-oscillatory solutions

In this section, we investigate the asymptotic behavior of non-oscillatory solutions of (11). The following lemma is a useful result on asymptotic behavior of Equation (1).

Lemma 4.1 (see [20])

Let x ( t ) be a positive solution of Equation (1), which does not oscillate about K. Then lim t x ( t ) = K .

From the relationship between Equations (1) and (9), we know that the non-oscillatory solution of Equation (9) satisfies lim t z ( t ) = 0 if Lemma 4.1 holds. Next, we will prove that the numerical solution of Equation (1) can inherit this property.

Lemma 4.2 Let z n be a non-oscillatory solution of (10), then lim n z n = 0 .

Proof Without loss of generality, we may assume that z n > 0 for sufficiently large n. Then by condition (12) we know that f ( z i ) > 0 for sufficiently large i. Moreover, it can be seen from (10) that
z n + 1 z n + h θ T f ( z n + 1 m ) + h ( 1 θ ) T f ( z n m ) = 0 ,
(20)
which gives
z n + 1 z n = h θ T f ( z n + 1 m ) h ( 1 θ ) T f ( z n m ) < 0 ,
hence z n + 1 z n < 0 , then { z n } is decreasing. So there exists an η 0 such that
lim n z n = η .
(21)
Now we are going to prove that η = 0 . If this is not the case, that is, if η > 0 , then there exists N N and ε > 0 such that for n m > N , 0 < η ε < z n < η + ε . Hence η ε < z n m and η ε < z n 1 + m . So (20) yields
z n + 1 z n = h θ T f ( z n + 1 m ) h ( 1 θ ) T f ( z n m ) < h θ T f ( η ε ) h ( 1 θ ) T f ( η ε ) = h T f ( η ε ) < 0 ,
which implies that z n + 1 z n < A < 0 , where
A = h T ( r + K α ) α 1 e α ( η ε ) r + K α e α ( η ε ) .

Thus z n as n , which is a contradiction to (21). Hence, we finish the proof. □

Therefore, the second main theorem of this paper is as follows.

Theorem 4.3 Let x n be a positive solution of (11), which does not oscillate about K, then lim n x n = K .

5 Numerical experiments

In this section, we give some numerical examples to illustrate our results, consider the nonlinear DDEs [22]
x ( t ) + x ( t ) 2 x ( t ) 1 + x 2 ( t τ ) = 0 , t 0 .
(22)

Obviously, the parameters are p = 1 , q = 2 , r = 1 , α = 2 and q / p = 2 > 1 in Equation (1) and the positive equilibrium is K = 1 . In the following, we give three different values of τ and discuss the accuracy of the numerical solution and the oscillatory behavior of Equation (22).

First of all, we consider the equation
x ( t ) + x ( t ) 2 x ( t ) 1 + x 2 ( t 1.4 ) = 0 , t 0 ,
(23)
with initial value x ( t ) = 1.5 for t 0 . Let the stepsize h = 1.4 / m , we shall use the exponential θ-method with different θ and the Euler method to get the numerical solution at t = 5 . On the other hand, the exact solution is x ( 5 ) 1.2887 . In Table 1 we have listed the absolute errors (AE) and the relative errors (RE) at t = 5 . We can see from this table that the errors of the Euler method are larger than those of the exponential θ-method. Therefore, compared with the classical Euler method, the exponential θ-method has higher accuracy. Furthermore, in Figures 1 and 2, the plots of the error as a function of time and as a function of the stepsize for a sequence of stepsizes are presented. The two figures also show that the effect of approximation of the numerical solution is good.
Figure 1

The error as a function of time.

Figure 2

The error as a function of the stepsize.

Table 1

Comparisons of errors between the exponential θ -method and the Euler method

 

Exponential θ-method

Euler method

θ = 0.2

θ = 0.5

θ = 0.7

AE

RE

AE

RE

AE

RE

AE

RE

m = 7

0.0144

0.0112

0.0030

0.0023

0.0174

0.0135

0.0229

0.0177

m = 14

0.0085

0.0066

0.0010

7.8091e − 4

0.0080

0.0062

0.0140

0.0109

m = 28

0.0044

0.0034

5.1373e − 4

3.9864e − 4

0.0040

0.0031

0.0075

0.0058

m = 35

0.0035

0.0027

4.5459e − 4

3.5275e − 4

0.0032

0.0025

0.0060

0.0047

m = 70

0.0016

0.0013

3.7574e − 4

2.9156e − 4

0.0017

0.0013

0.0029

0.0023

In addition, it is easy to see that condition (5) holds true. That is, the analytic solutions of Equation (23) are oscillatory. In Figures 3-5, we draw the figures of the analytic solutions and the numerical solutions of Equation (23), respectively. In Figure 4, m = 28 , θ = 1 / 5 [ 0 , 1 / 2 ] and T τ = 1.4 > 1 / e . Simultaneously, in Figure 5, m = 70 , θ = 4 / 5 ( 1 / 2 , 1 ] and T τ = 1.4 1 > 1 / e . From the two figures, we can see that the numerical solutions of Equation (23) oscillate about K = 1 , which is in agreement with Theorem 3.9.
Figure 3

The analytic solution of ( 23 ).

Figure 4

The numerical solution of ( 23 ) with m = 28 and θ = 0.2 .

Figure 5

The numerical solution of ( 23 ) with m = 70 and θ = 0.8 .

Next, we consider the following equation:
x ( t ) + x ( t ) 2 x ( t ) 1 + x 2 ( t 0.8 ) = 0 , t 0 ,
(24)
with initial value x ( t ) = 1.5 for t 0 . In Equation (24), it is not difficult to see that condition (5) is fulfilled. That is, the analytic solutions of Equation (24) are oscillatory. In Figures 6-8, we draw the figures of the analytic solutions and the numerical solutions of Equation (24), respectively. In Figure 7, m = 40 , θ = 2 / 5 [ 0 , 1 / 2 ] and T τ = 0.8 > 1 / e . Further, in Figure 8, m = 20 , θ = 3 / 4 ( 1 / 2 , 1 ] . By simple calculation, we have 1 / e < T τ = 0.8 < 1 and h = τ / m = 0.04 < h 0 = 0.6215 . We can see from the three figures that the numerical solutions of Equation (24) oscillate about K = 1 , which are consistent with Theorem 3.9. On the other hand, we notice that h = 0.04 0.4 < h 0 = 0.6215 under the assumption 1 < m N , so the stepsize h 0 is not optimal.
Figure 6

The analytic solution of ( 24 ).

Figure 7

The numerical solution of ( 24 ) with m = 40 and θ = 0.4 .

Figure 8

The numerical solution of ( 24 ) with m = 20 and θ = 0.75 .

Moreover, we consider another equation
x ( t ) + x ( t ) 2 x ( t ) 1 + x 2 ( t 0.3 ) = 0 , t 0 ,
(25)
with initial value x ( t ) = 1.5 for t 0 . For Equation (25), it is easy to see that T τ = 0.3 < 1 / e , so condition (5) is not satisfied. That is, the analytic solutions of Equation (25) are non-oscillatory. In Figures 9-11, we draw the figures of the analytic solutions and the numerical solutions of Equation (25), respectively. In Figure 9, we can see that x ( t ) K = 1 as t . From Figures 10 and 11, we can also see that the numerical solutions of Equation (25) satisfy x n K = 1 as n . That is, the numerical method preserves the asymptotic behavior of non-oscillatory solutions of Equation (25), which coincides with Theorem 4.3.
Figure 9

The analytic solution of ( 25 ).

Figure 10

The numerical solution of ( 25 ) with m = 60 and θ = 0.1 .

Figure 11

The numerical solution of ( 25 ) with m = 30 and θ = 0.6 .

Finally, by Definition 3.4, we can see from these figures that the exponential θ-method preserves the oscillations of Equations (23) and (24) and the non-oscillations of Equation (25), respectively.

All the above numerical examples are in agreement with the main results in this paper.

6 Conclusions

In this paper, we discuss the oscillations of the numerical solutions of a nonlinear

DDEs in a hematopoiesis model. The convergent exponential θ-method, namely the linear θ-method and the one-leg θ-method in an exponential form, is constructed. We obtain some conditions under which the numerical solutions oscillate in the case of oscillations of the analytic solutions. We also prove that non-oscillatory numerical solutions can preserve the corresponding properties of the analytic solutions. It is pointed out that the stepsize h 0 in Lemma 3.7 is not optimal, which gives us the further working direction.

Declarations

Acknowledgements

The authors would like to express their deep gratitude to the referees for their valuable suggestions and comments. The first author would like to thank Professor Mingzhu Liu and Doctor Zhanwen Yang for their selfless help. This work is financially supported by the National Natural Science Foundation of China (No. 11201084).

Authors’ Affiliations

(1)
School of Applied Mathematics, Guangdong University of Technology
(2)
CSIB Software Technology Center
(3)
College of Science, Harbin Engineering University

References

  1. Agarwal RP, Karakoc F: Oscillation of impulsive partial difference equations with continuous variables. Math. Comput. Model. 2009, 50: 1262-1278. 10.1016/j.mcm.2009.07.013MathSciNetView ArticleGoogle Scholar
  2. Yamaoka N: Oscillation criteria for second-order nonlinear difference equations of Euler type. Adv. Differ. Equ. 2012., 2012: Article ID 218Google Scholar
  3. Muroya Y: New contractivity condition in a population model with piecewise constant arguments. J. Math. Anal. Appl. 2008, 346: 65-81. 10.1016/j.jmaa.2008.05.025MathSciNetView ArticleGoogle Scholar
  4. Song MH, Liu MZ:Numerical stability and oscillation of the Runge-Kutta methods for equation x ( t ) = a x ( t ) + a 0 x ( M [ ( t + N ) / M ] ) = 0 . Adv. Differ. Equ. 2012., 2012: Article ID 146Google Scholar
  5. Jia BG, Erbe L, Peterson A: A Wong-type oscillation theorem for second order linear dynamic equations on time scales. J. Differ. Equ. Appl. 2010, 16: 15-36. 10.1080/10236190802409312MathSciNetView ArticleGoogle Scholar
  6. Candan T: Oscillation criteria for second-order nonlinear neutral dynamic equations with distributed deviating arguments on time scales. Adv. Differ. Equ. 2013., 2013: Article ID 112Google Scholar
  7. Kubiaczyk I, Saker SH: Oscillation of delay parabolic differential equations with several coefficients. J. Comput. Appl. Math. 2002, 147: 263-275. 10.1016/S0377-0427(02)00427-2MathSciNetView ArticleGoogle Scholar
  8. Wang CY, Wang S, Yan XP: Oscillation of a class of partial functional population model. J. Math. Anal. Appl. 2010, 368: 32-42. 10.1016/j.jmaa.2010.03.005MathSciNetView ArticleGoogle Scholar
  9. Liu LH, Bai YZ: New oscillation criteria for second-order nonlinear neutral delay differential equations. J. Comput. Appl. Math. 2009, 231: 657-663. 10.1016/j.cam.2009.04.009MathSciNetView ArticleGoogle Scholar
  10. Bonotto EM, Gimenes LP, Federson M: Oscillation for a second-order neutral differential equation with impulses. Appl. Math. Comput. 2009, 215: 1-15. 10.1016/j.amc.2009.04.039MathSciNetView ArticleGoogle Scholar
  11. Zhang CH, Li TX, Sun B, et al.: On the oscillation of higher-order half-linear delay differential equations. Appl. Math. Lett. 2011, 24: 1618-1621. 10.1016/j.aml.2011.04.015MathSciNetView ArticleGoogle Scholar
  12. Li TX, Han ZL, Zhao P, et al.: Oscillation of even-order neutral delay differential equations. Adv. Differ. Equ. 2010., 2010: Article ID 184180Google Scholar
  13. Gopalsamy K: Stability and Oscillations in Delay Differential Equations of Population Dynamics. Kluwer Academic, Dordrecht; 1992.View ArticleGoogle Scholar
  14. Bainov DD, Mishev DP: Oscillation Theory for Neutral Differential Equations with Delay. Hilger, New York; 1991.Google Scholar
  15. Liu MZ, Gao JF, Yang ZW: Oscillation analysis of numerical solution in the θ -methods for equation x ( t ) + a x ( t ) + a 1 x ( [ t 1 ] ) = 0 . Appl. Math. Comput. 2007, 186: 566-578. 10.1016/j.amc.2006.07.119MathSciNetView ArticleGoogle Scholar
  16. Liu MZ, Gao JF, Yang ZW:Preservation of oscillations of the Runge-Kutta method for equation x ( t ) + a x ( t ) + a 1 x ( [ t 1 ] ) = 0 . Comput. Math. Appl. 2009, 58: 1113-1125. 10.1016/j.camwa.2009.07.030MathSciNetView ArticleGoogle Scholar
  17. Wang Q, Zhu QY, Liu MZ: Stability and oscillations of numerical solutions for differential equations with piecewise continuous arguments of alternately advanced and retarded type. J. Comput. Appl. Math. 2011, 235: 1542-1552. 10.1016/j.cam.2010.08.041MathSciNetView ArticleGoogle Scholar
  18. Gao JF, Song MH, Liu MZ: Oscillation analysis of numerical solutions for nonlinear delay differential equations of population dynamics. Math. Model. Anal. 2011, 16: 365-375. 10.3846/13926292.2011.601768MathSciNetView ArticleGoogle Scholar
  19. Nazarenko VG: Influence of delay on auto-oscillation in cell populations. Biofisika 1976, 21: 352-356.Google Scholar
  20. Kubiaczyk I, Saker SH: Oscillation and stability in nonlinear delay differential equations of population dynamics. Math. Comput. Model. 2002, 35: 295-301. 10.1016/S0895-7177(01)00166-2MathSciNetView ArticleGoogle Scholar
  21. Saker SH, Agarwal S: Oscillation and global attractivity in a nonlinear delay periodic model of population dynamics. Appl. Anal. 2002, 81: 787-799. 10.1080/0003681021000004429MathSciNetView ArticleGoogle Scholar
  22. Song YL, Wei JJ, Han MA: Local and global Hopf bifurcation in a delayed hematopoiesis model. Int. J. Bifurc. Chaos 2004, 14: 3909-3919. 10.1142/S0218127404011697MathSciNetView ArticleGoogle Scholar
  23. Gyori I, Ladas G: Oscillation Theory of Delay Differential Equations with Applications. Academic Press, Oxford; 1993.Google Scholar
  24. Song MH, Yang ZW, Liu MZ: Stability of θ -methods for advanced differential equations with piecewise continuous arguments. Comput. Math. Appl. 2005, 49: 1295-1301. 10.1016/j.camwa.2005.02.002MathSciNetView ArticleGoogle Scholar
  25. Hale JK: Theory of Functional Differential Equations. Springer, New York; 1977.View ArticleGoogle Scholar
  26. Yang ZW, Liu MZ, Song MH:Stability of Runge-Kutta methods in the numerical solution of equation u ( t ) = a u ( t ) + a 0 u ( [ t ] ) + a 1 u ( [ t 1 ] ) . Appl. Math. Comput. 2005, 162: 37-50. 10.1016/j.amc.2003.12.081MathSciNetView ArticleGoogle Scholar

Copyright

© Wang et al.; licensee Springer 2013

This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.