Abstract and Applied Analysis

Volume 2013 (2013), Article ID 232484, 9 pages

http://dx.doi.org/10.1155/2013/232484

Research Article

Euler-Maclaurin Method for Linear Differential Equations with Piecewise Constant Arguments with One Delay: Stability and Oscillations

Qi Wang,¹ Jiechang Wen,¹ and Shenshan Qiu²

¹School of Applied Mathematics, Guangdong University of Technology, Guangzhou 510006, China

²CSIB Software Technology Center, Administrative Commission of Guangzhou Tianhe Software Park, Guangzhou 510635, China

Received 17 January 2013; Revised 2 April 2013; Accepted 6 April 2013

Academic Editor: Chengming Huang

Copyright © 2013 Qi Wang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract.

This paper focuses on the stability and oscillations of Euler-Maclaurin method for linear differential equations with piecewise constant arguments . The necessary and sufficient conditions under which the numerical stability region contains the analytical stability region are given. Furthermore, the conditions of oscillation for the Euler-Maclaurin method are obtained. We prove that the Euler-Maclaurin method preserves the oscillations of the analytic solution. Moreover, the relationships between stability and oscillations are discussed for analytic solution and numerical solution, respectively. Finally, some numerical experiments for verifying the theoretical analysis are also provided.

1. Introduction

In the present paper we will consider the following differential equations with piecewise constant arguments (EPCA):

where and denotes the greatest integer function. Moreover, we assume that . The general form of this type of equations is

where the argument has intervals of constancy.

It is well known that studies of EPCA were motivated by the fact that they represent a hybrid of continuous and discrete dynamical systems and combine the properties of both the differential and difference equations. The local asymptotic stabilization of a class of instable autonomous nonlinear difference equations was studied in [1]. Convergence and stability of adaptation algorithm for a class of nominally first-order hybrid time-invariant linear systems were considered in [2], and stability for hybrid difference-differential systems was analyzed in [3]. The first work devoted to EPCA is the paper of Shah and Wiener [4] in 1983. In 1984 Cooke and Wiener [5] studied these equations with delay. The investigation of EPCA is an important subject because they play an important role in numerous applications [6–8]. In the literature, there are many papers dealing with the properties of EPCA, including the existence and uniqueness of solutions [9], the stability [10], the oscillations [11], and the existence of integral manifolds [12]. Moreover, the concept of EPCA has been generalized in [13–15] by introducing arbitrary piecewise constant functions as arguments. Significant parts of pioneer results for EPCA can be found in [16]. For more details of EPCA, the reader can see [17–22] and the references cited therein.

In recent ten years, much work has been done in the numerical solution of EPCA. For instance, in [23, 24], the stability of numerical solution in Runge-Kutta methods for (1) and the mixed type EPCA was studied, respectively. In [25], the numerical stability of -methods was considered for EPCA of advanced type. For EPCA with variable coefficients, Song and Liu [26] studied the asymptotic stability of the analytic and numerical solutions. The oscillations of -methods and Runge-Kutta methods were investigated in [27, 28] for EPCA of retarded type, respectively. However, as far as we know, very few results were obtained on combining the stability with the oscillations of the numerical solution in the same article except for [29]. Different from [29], the novel idea of our paper is that we will study both stability and oscillations of the numerical solution in the Euler-Maclaurin method for (1), and their relationships are analyzed quantitatively.

Euler-Maclaurin method is an important tool of numerical analysis which was discovered independently and almost simultaneously by Euler and Maclaurin in the first half of 18th century. Rota [30] called Euler-Maclaurin “one of the most remarkable formulas of mathematics.” After that, it shows us how to trade a finite sum for an integral. It works much like Taylor’s formula. The equation involves an infinite series that may be truncated at any point, leaving an error term that can be bounded.

It is well known that the trapezoidal rule can be derived from the Euler-Maclaurin formula. See, for example, Munro’s paper [31]. In [32], the author indicated how the Newton-Cotes quadrature formulas and various other quadrature formulas can be developed from special cases of periodic Euler-Maclaurin formula. With respect to the numerical analysis of delay differential equations (DDEs), few results on the Euler-Maclaurin method were obtained except for [33]. In our present paper, we will apply this method to (1) and investigate numerical stability and oscillations.

The rest of this paper is organized as follows. In Section 2, some necessary notations and results are given. In Section 3, we propose Euler-Maclaurin method to solve (1), and the asymptotical stability of numerical solution is discussed. In Section 4, we investigate the oscillations of the numerical solution and prove that the oscillations of the analytic solution are inherited by the Euler-Maclaurin method. In Section 5, we establish some relationships between stability and oscillations, and several numerical experiments are shown in Section 6. Finally, concluding remarks are given in Section 7.

2. Preliminaries

In this section, we will focus our attention on some preliminary results which will be used in the further analysis.

Proposition 1 (see [16]). A solution of (1) on is a function which satisfies the following conditions:

(i)  is continuous on  ;(ii)the derivative  exists at each point , with the possible exception of the points , where one-sided derivatives exist; (iii)equation (1) is satisfied on each interval   with integral end points.

Theorem 2 (see [16]). Equation (1) has a unique solution on

where is the fractional part of and

Theorem 3 (see [16]). The solution of (1) is asymptotically stable ( as ) for all , if and only if

Definition 4. A non-trivial solution of (1) is said to be oscillatory if there exists a sequence such that as and ; otherwise it is called non-oscillatory. We say (1) is oscillatory if all the non-trivial solutions of (1) are oscillatory; we say (1) is non-oscillatory if all the non-trivial solutions of (1) are non-oscillatory.

Theorem 5 (see [16]). Every solution of (1) is non-oscillatory if and only if

Remark 6. By Definition 4, we can see that if a solution of (1) is non-oscillatory and continuous, then it must be eventually positive or eventually negative. That is, there exists a such that or for .

3. Numerical Stability

3.1. Bernoulli’s Number and Bernoulli’s Polynomial

It is well known that

where and , , are called Bernoulli’s number and Bernoulli’s polynomial, respectively.

Proposition 7 (see [33]). The Bernoulli’s number satisfies the following properties:

(i),(ii),(iii), , (iv).

Proposition 8 (see [33]). The Bernoulli’s polynomial satisfies the following properties:

(i), ,(ii),(iii),(iv).

3.2. The Euler-Maclaurin Method and Discretization

Let be an integer, and assume that the function is at least times continuously differentiable on . Further assume that evenly divides and ; then Atkinson’s version of the Euler-Maclaurin formula [34] is as follows:

where denotes the th Bernoulli number and denotes the differentiation operator.

Let be a given stepsize; is a given integer and satisfies . The grid points are defined by ; let . Applying formula (8) to (1), we have

Lemma 9 (see [35]). Assume that has continuous derivative on the interval ; then we have

According to Theorem  2.2 in [33], we obtain the following theorem for convergence.

Theorem 10. For any given , the Euler-Maclaurin method is of order .

Equation (9) can be written as

where

It is not difficult to see that (11) is equivalent to

where .

3.3. Stability Analysis

Definition 11. Process (9) for (1) is called asymptotically stable at for all sufficiently small if and only if there exists a constant , such that for any given , relation (15) defines that satisfies as whenever .

Definition 12. The set, denoted by , of all points at which process (9) for (1) is asymptotically stable, for all sufficiently small , is called the asymptotical stability region.

Lemma 13 (see [33]). If , then for and for .

By relation (15), we can easily prove the following lemma.

Lemma 14. For any and , there exists a constant independent of and such that

So we have the following corollary.

Corollary 15. as if and only if as .

According to Definition 11, Corollary 15, and relation (14), the following theorem is obtained.

Theorem 16. The numerical solution of (1) is asymptotically stable if and only if

For convenience, we divide into two parts , where

therefore, by Definition 12 and Theorem 16, we have

Let us introduce the following sets of all points which satisfy condition (5) by ; in a similar way, we denote , where

We will study which conditions lead to and .

In the following, we assume , which implies that for the stepsize with . The following lemma will be useful to determine the stability and oscillatory conditions.

Lemma 17 (see [33]). If , then

when is even and

when is odd.

Then the first main result for stability is as follows.

Theorem 18. For the Euler-Maclaurin method, if and only if is odd.

Proof. In view of (19) and (20), we know that if and only if

that is,

which is equivalent to

In view of , thus (25) leads to

As a consequence of Lemma 17, the proof is complete.

Theorem 19. For all the Euler-Maclaurin method, we have .

4. Oscillations Analysis

Similar to Definition 4, we can easily get the definitions of oscillations and nonoscillations of numerical solution; for the sake of simplicity, we omit them. Then the relationships of the nonoscillations between the integer nodes and any nodes are as follows.

Theorem 20. and are given by (15) and (14), respectively; then is non-oscillatory if and only if is non-oscillatory.

Proof. The necessity is easy to prove, so we only consider the sufficiency. If is non-oscillatory, without loss of generality, we can assume that is an eventually negative solution of (14); that is, there exists a such that for . We will prove for all and .

If , then and ; hence

If , then and ; thus

Therefore . This completes the proof.

From Theorem 20, we get the following corollary.

Corollary 21. and are given by (15) and (14), respectively; then is oscillatory if and only if is oscillatory.

Theorem 22. Equation (14) is oscillatory if and only if

Proof. Equation (14) is oscillatory if and only if the corresponding characteristic equation has no positive roots, that is,

which is equivalent to

thus (29) is obtained. The proof is finished.

Let

we have the following lemma.

Lemma 23.    as ;

   if either of the following conditions is satisfied:

            and ,

            and ;

if either of the following conditions is satisfied:

           and ,

           and .

Proof. (II)   If and , then , which is equivalent to

that is,

so we have . Similarly, we can prove the other cases.

Definition 24. We say the Euler-Maclaurin method preserves the oscillations of (1) if (1) oscillates, then there is an , such that (15) oscillates for . Similarly, we say the Euler-Maclaurin method preserves the nonoscillations of (1) if (1) nonoscillates then there is an , such that (15) non-oscillates for .

By Theorems 5, 20, and 22 and Corollary 21, we have the following theorem.

Theorem 25. The Euler-Maclaurin method preserves the oscillations of (1) if and only if  .

The Euler-Maclaurin method preserves the non-oscillations of (1) if and only if  .

Applying Theorem 25 and Lemmas 17 and 23, we can obtain the following main theorems for oscillations.

Theorem 26. The Euler-Maclaurin method preserves the oscillations of (1) if is even.

Theorem 27. The Euler-Maclaurin method preserves the non-oscillations of (1) if is odd.

5. Relationships between Stability and Oscillations

Let

By Theorems 3, 5, 16, and 22, we can get the following other main theorems.

Theorem 28. When , the analytic solution of (1) is

(i)oscillatory and unstable if  ,(ii)oscillatory and asymptotically stable if  ,(iii)non-oscillatory and asymptotically stable if  ,(iv)non-oscillatory and unstable if  .

Theorem 29. When , the numerical solution of (1) is

(i)oscillatory and unstable if  ,(ii)oscillatory and asymptotically stable if  ,(iii)non-oscillatory and asymptotically stable if  ,(iv)non-oscillatory and unstable if  .

Theorem 30. When , the analytic solution and the numerical solution of (1) both are

(i)oscillatory and unstable if  ,(ii)oscillatory and asymptotically stable if  ,(iii)non-oscillatory and asymptotically stable if  .

Remark 31. In Theorem 30, we can see that the solution of (1) is not non-oscillatory and unstable at the same time. Otherwise, if the solution of (1) is both non-oscillatory and unstable, we can get ; it is inconsistent with .

6. Numerical Experiments

In this section, we will use the following four equations to demonstrate the main theorems

For (37) and (38), it is not difficult to see that by straightforward computing. Let the stepsize ; we shall use the Euler-Maclaurin method with , the -methods with , and the 2-Radau IA method to get the numerical solution at . On the other hand, the theoretical solutions are and for (37) and (38), respectively. In Tables 1 and 2, we have listed the absolute errors (AE), the relative errors (RE) at , and the ratio of the errors of the case over that of . We can see from these tables that the Euler-Maclaurin method with is of order 6; that is, the method preserves its order of convergence. Furthermore, the errors of the -methods and the 2-Radau IA method are both larger than that of the Euler-Maclaurin method. Therefore, compared with the two mentioned numerical methods, the Euler-Maclaurin method has higher accuracy.

Table 1: Errors and ratio for (37).

Euler-Maclaurin method
-methods
2-Radau IA method

AE
RE
AE
RE
AE
RE

Ratio
56.5107
56.5110
3.9745
3.9800
8.0552
8.0551

Table 2: Errors and ratio for (38).

Euler-Maclaurin method
-methods
2-Radau IA method

AE
RE
AE
RE
AE
RE

Ratio
63.8698
63.8699
4.0173
3.9655
7.8989
7.8987

In Figures 1 and 3, we draw the numerical solution with for (37) and (38), respectively. It is easy to see that the numerical solution is asymptotically stable. In Figure 2, we draw the stability region for (37); it can be seen that the analytical stability region is contained in the numerical stability region, which is in accordance with Theorem 18.

Figure 1: The numerical solution of (37) with and .

(a)

(b)

Figure 2: The stability region of (37): (a) the analytical stability region, (b) the numerical stability region with and .

Figure 3: The numerical solution of (38) with and .

For (39) and (40), the analytic solution of (39) is oscillatory, and the analytic solution of (40) is non-oscillatory according to Theorem 5. From Figures 4 and 5, we can see that the numerical solution of (39) is oscillatory and the numerical solution of (40) is non-oscillatory, which are in accordance with Theorems 26 and 27.

(a)

(b)

Figure 4: The analytic solution and the numerical solution of (39) with and .

(a)

(b)

Figure 5: The analytic solution and the numerical solution of (40) with and .

In Figure 4, let ; it is easy to calculate that , , , and . Obviously, and . Therefore, the analytic solution and the numerical solution of (39) are both oscillatory and asymptotically stable according to Theorems 28 and 29, which are in agreement with Figure 4. For (37), (38), and (40), we can verify them in the same way (see Figures 1, 3, and 5).

From Figures 1–5, we can see that the numerical results coincide with our theoretical analysis.

7. Conclusions

In this paper, the Euler-Maclaurin method is presented for solving an important EPCA. Asymptotical stability and oscillations of numerical solution are considered, respectively. Furthermore, the relationships between stability and oscillations are also revealed. Results of numerical examples have shown that the Euler-Maclaurin method has good convergence and stability, so it is applicable for the study of EPCA. That is, the Euler-Maclaurin method is an alternative numerical method for DDEs except for the classical -methods and Runge-Kutta methods. We will consider the nonlinear and multidimensional problems in the future work.

Acknowledgments

The first author’s work was supported by the National Natural Science Foundation of China (no. 11201084). The authors would like to thank the editor Chengming Huang and the reviewers for their useful comments which helped to improve the original version of the paper. The first author is also grateful to Professor Mingzhu Liu, Minghui Song, and Doctor Zhanwen Yang for their helpful comments and constructive suggestions.

References

M. de la Sen, “About the stabilization of a nonlinear perturbed difference equation,” Discrete Dynamics in Nature and Society, vol. 2012, Article ID 320302, 19 pages, 2012.

M. de La Sen, “On the robust adaptive stabilization of a class of nominally first-order hybrid systems,” IEEE Transactions on Automatic Control, vol. 44, no. 3, pp. 597–602, 1999.

V. M. Marchenko and J. J. Luazo, “On the stability of hybrid differential-difference systems,” Differentsial'nye Uravneniya, vol. 45, no. 5, pp. 728–740, 2009.

S. M. Shah and J. Wiener, “Advanced differential equations with piecewise constant argument deviations,” International Journal of Mathematics and Mathematical Sciences, vol. 6, no. 4, pp. 671–703, 1983.

K. L. Cooke and J. Wiener, “Retarded differential equations with piecewise constant delays,” Journal of Mathematical Analysis and Applications, vol. 99, no. 1, pp. 265–297, 1984.

L. Dai and M. C. Singh, “On oscillatory motion of spring-mass systems subjected to piecewise constant forces,” Journal of Sound and Vibration, vol. 173, no. 2, pp. 217–232, 1994.

Y. Muroya, “Persistence, contractivity and global stability in logistic equations with piecewise constant delays,” Journal of Mathematical Analysis and Applications, vol. 270, no. 2, pp. 602–635, 2002.

H. H. Liang and G. Q. Wang, “Oscillation criteria of certain third-order differential equation with piecewise constant argument,” Journal of Applied Mathematics, vol. 2012, Article ID 498073, 18 pages, 2012.

M. U. Akhmet and C. Büyükadalı, “Differential equations with state-dependent piecewise constant argument,” Nonlinear Analysis. Theory, Methods & Applications, vol. 72, no. 11, pp. 4200–4210, 2010.

M. U. Akhmet, D. Aruğaslan, and E. Yılmaz, “Stability in cellular neural networks with a piecewise constant argument,” Journal of Computational and Applied Mathematics, vol. 233, no. 9, pp. 2365–2373, 2010.

X. Fu and X. Li, “Oscillation of higher order impulsive differential equations of mixed type with constant argument at fixed time,” Mathematical and Computer Modelling, vol. 48, no. 5-6, pp. 776–786, 2008.

M. U. Akhmet, “On the reduction principle for differential equations with piecewise constant argument of generalized type,” Journal of Mathematical Analysis and Applications, vol. 336, no. 1, pp. 646–663, 2007.

M. U. Akhmet, “Integral manifolds of differential equations with piecewise constant argument of generalized type,” Nonlinear Analysis. Theory, Methods & Applications, vol. 66, no. 2, pp. 367–383, 2007.

M. U. Akhmet, “Stability of differential equations with piecewise constant arguments of generalized type,” Nonlinear Analysis. Theory, Methods & Applications, vol. 68, no. 4, pp. 794–803, 2008.

M. U. Akhmet, D. Arugaslanc, and E. Yılmaz, “Stability analysis of recurrent neural networks with piecewise constant argument of generalized type,” Neural Networks, vol. 23, no. 7, pp. 805–811, 2010.

J. Wiener, Generalized Solutions of Functional-Differential Equations, World Scientific Publishing, River Edge, NJ, USA, 1993.

E. Ait Dads and L. Lhachimi, “Pseudo almost periodic solutions for equation with piecewise constant argument,” Journal of Mathematical Analysis and Applications, vol. 371, no. 2, pp. 842–854, 2010.

Y. Muroya, “New contractivity condition in a population model with piecewise constant arguments,” Journal of Mathematical Analysis and Applications, vol. 346, no. 1, pp. 65–81, 2008.

M. U. Akhmet and E. Yılmaz, “Impulsive Hopfield-type neural network system with piecewise constant argument,” Nonlinear Analysis. Real World Applications, vol. 11, no. 4, pp. 2584–2593, 2010.

W. Dimbour, “Almost automorphic solutions for differential equations with piecewise constant argument in a Banach space,” Nonlinear Analysis. Theory, Methods & Applications, vol. 74, no. 6, pp. 2351–2357, 2011.

C. Zhang and L. Jiang, “Remotely almost periodic solutions to systems of differential equations with piecewise constant argument,” Applied Mathematics Letters, vol. 21, no. 8, pp. 761–768, 2008.

M. U. Akhmet, “Asymptotic behavior of solutions of differential equations with piecewise constant arguments,” Applied Mathematics Letters, vol. 21, no. 9, pp. 951–956, 2008.

M. Z. Liu, M. H. Song, and Z. W. Yang, “Stability of Runge-Kutta methods in the numerical solution of equation ,” Journal of Computational and Applied Mathematics, vol. 166, no. 2, pp. 361–370, 2004.

Q. Wang and Q. Zhu, “Stability analysis of Runge-Kutta methods for differential equations with piecewise continuous arguments of mixed type,” International Journal of Computer Mathematics, vol. 88, no. 5, pp. 1052–1066, 2011.

M. H. Song, Z. W. Yang, and M. Z. Liu, “Stability of -methods for advanced differential equations with piecewise continuous arguments,” Computers & Mathematics with Applications, vol. 49, no. 9-10, pp. 1295–1301, 2005.

M. Song and M. Z. Liu, “Stability of analytic and numerical solutions for differential equations with piecewise continuous arguments,” Abstract and Applied Analysis, vol. 2012, Article ID 258329, 14 pages, 2012.

M. Z. Liu, J. Gao, and Z. W. Yang, “Oscillation analysis of numerical solution in the -methods for equation ,” Applied Mathematics and Computation, vol. 186, no. 1, pp. 566–578, 2007.

M. Z. Liu, J. F. Gao, and Z. W. Yang, “Preservation of oscillations of the Runge-Kutta method for equation ,” Computers & Mathematics with Applications, vol. 58, no. 6, pp. 1113–1125, 2009.

Q. Wang, Q. Zhu, and M. Liu, “Stability and oscillations of numerical solutions for differential equations with piecewise continuous arguments of alternately advanced and retarded type,” Journal of Computational and Applied Mathematics, vol. 235, no. 5, pp. 1542–1552, 2011.

G.-C. Rota, “Combinatorial snapshots,” The Mathematical Intelligencer, vol. 21, no. 2, pp. 8–14, 1999.

W. D. Munro, “Classroom notes: note on the Euler-MacLaurin formula,” The American Mathematical Monthly, vol. 65, no. 3, pp. 201–203, 1958.

B. C. Berndt and L. Schoenfeld, “Periodic analogues of the Euler-Maclaurin and Poisson summation formulas with applications to number theory,” Acta Arithmetica, vol. 28, no. 1, pp. 23–68, 1975.

W. J. Lv, Z. W. Yang, and M. Z. Liu, “Stability of the Euler-Maclaurin methods for neutral differential equations with piecewise continuous arguments,” Applied Mathematics and Computation, vol. 186, no. 2, pp. 1480–1487, 2007.

K. E. Atkinson, An Introduction to Numerical Analysis, John Wiley & Sons, New York, NY, USA, 2nd edition, 1989.

J. Stoer and R. Bulirsch, Introduction to Numerical Analysis, vol. 12 of Texts in Applied Mathematics, Springer, New York, NY, USA, 2nd edition, 1993.