Abstract
The Razumikhin-type stability theorems of neutral stochastic functional differential equations (NFDEs) were investigated by several authors, but there was almost no Razumikhin-type theorems on the general asymptotic stability of NFDEs with infinite delay. This paper investigates the Razumikhin-type p th moment asymptotic stability of neutral stochastic pantograph equations (NSPEs). Sufficient conditions of the p th moment asymptotic stability for NSPEs are obtained. The NSPE is a special class of NFDEs with infinite delay. We should emphasize that the Razumikhin-type theorem of this paper is established without taking difficulties from infinite delay into account. We also develop the backward Euler method for NSPEs. We prove that the backward Euler method can preserve the asymptotic behavior of the mean square stability of exact solutions under suitable conditions. Numerical examples are demonstrated for illustration.
MSC: 65C30, 65L20, 60H10.
Similar content being viewed by others
1 Introduction
Neutral stochastic functional differential equations (NSFDEs) can be used to model various phenomena and processes in the field of the chemical-engineering and aero elasticity. Stability analysis of NSFDEs has attracted increasing attention; for instance, see [1–5]. Among the methods contributed to the study of stability for NSFDEs, the Razumikhin technique is a powerful and effective method. In this paper, we consider the following neutral stochastic pantograph equation (NSPE):
where . NSPE (1) is an important extension of stochastic pantograph equations (see [6, 7]), and NSPE (1) stems from neutral pantograph equations (NPEs). NPEs play important roles in mathematical and industrial problems (see [8]). Many authors have studied NPEs numerically and analytically. We refer the reader to [8–14]. One class of NPEs reads
Taking the environmental disturbances into account, we are led to NSPE (1). The almost sure asymptotic stability of Eq. (1) has been studied (please see [15]). In this paper, we aim to study the p th moment asymptotic stability of Eq. (1) by using the Razumikhin technique.
The Razumikhin technique has been successfully applied to study the stability of various NSFDEs (see, e.g., [1–3, 16–20]). Recently, Wu et al. [17] studied the stability of the following NSFDE with unbounded delay:
by using the Razumikhin technique, where , and some techniques are adopted to overcome the difficulties from infinite delay. Note that Eq. (1) is also a class of NSFDEs with time delay as . For given , it is easy to see that the solution of Eq. (1) depends on states of , but the solution of Eq. (3) depends on states of . Obviously, the Razumikhin-type stability theorem of Eq. (3) obtained in [17] can be applied to Eq. (1). However, the general asymptotic stability of Eq. (3), one of important stability criteria, has not been considered. In many cases, the general asymptotic stability of the equilibrium of systems is much more economically and practically feasible in contrast to the exponential stability and general decay stability. Moreover, to the best of the authors’ knowledge, so far no result has been concerned with Razumikhin-type theorems on the general asymptotic stability of Eq. (1).
In this paper, the Razumikhin-type p th moment asymptotic stability of Eq. (1) is established without taking difficulties from infinite delay into account. On the other hand, as most NSFDEs could not be solved explicitly, numerical solutions have become essential. Efficient numerical methods for various NSFDEs can be found in [21–23]. In this paper, we develop the backward Euler method for Eq. (1). We show that the backward Euler method can preserve the asymptotic behavior of the mean square stability of exact solutions to Eq. (1).
The paper is organized as follows. In Section 2, we introduce some necessary notations and definitions. In Section 3, we establish the Razumikhin-type theorem on the p th moment asymptotic stability for Eq. (1). In Section 4, we study the mean square asymptotic stability of the backward Euler method for Eq. (1). Numerical experiments are presented in the finial section.
2 Preliminaries
Throughout this paper, unless otherwise specified, we use the following notations. Let be a complete probability space with filtration satisfying the usual conditions (i.e., it is right continuous and contains all P-null sets). is an r-dimensional Brownian motion defined on the probability space. denotes the Euclidean norm in . The inner product of x, y in is denoted by or . If A is a vector or matrix, its transpose is denoted by . If A is a matrix, its norm is defined by . Let and denote the family of all continuous functions ξ from to with the norm . For , denote by the family of all -measurable, -value random variables with .
Consider an n-dimensional neutral stochastic pantograph equation
with initial data . Here , , and are all continuous functions.
As usual, thought this paper, we assume that Eq. (4) has a unique global solution on with . Moreover, we assume that , , for the stability purpose, so that Eq. (4) admits a trivial solution .
The following assumption and definition will be used in the following sections.
Assumption (H) Assume that there is a constant such that
Definition 2.1 The trivial solution of Eq. (4) is said to be:
(1) p th moment stable if, for every , there exists such that
whenever ;
(2) p th moment asymptotically stable if it is p th moment stable and there exists a such that implies
(3) globally p th moment asymptotically stable if it is p th moment stable and, moreover, for all initial data ,
To study the stability of Eq. (4), we need to introduce some other notations. Let denote the family of all nonnegative functions on , which are once differentiable in t and twice differentiable in x. Define an operator LV, associated with Eq. (4), acting on by
for and , where
The following inequality (see Lemma 4.1 of chapter 6 in [24] ) will be used in this paper: Let , . Then for any ,
3 Razumikhin-type theorem
In this section, we investigate the p th moment asymptotic stability of Eq. (4) by using the Razumikhin-type technique.
Theorem 3.1 Let , , and Assumption (H) hold. Assume that there exists a function such that
and, moreover,
for all satisfying
where . Then the trivial solution of Eq. (4) is globally pth moment asymptotically stable.
Proof For any given initial data , let be the solution of the system (4).
(1) For any given , we will prove that there exists a such that implies for . Let . Using the inequality (5) with and Assumption (H), we have
Since is continuous, there exists a such that
Then, by (6),
We assert that
We will prove (8) by contradiction. Suppose that there exists a such that
Set . Then there exists a sufficiently small such that
Using the inequality (5) with and Assumption (H), we obtain that
Using (6) and (10), we have
for , which also holds for . Then we have
That is,
Using (6) yields
Applying , (9) and (12), we obtain that
By Itô’s formula and (7),
which contradicts (9). Therefore (8) must hold. In a similar way to (11), we have
That is,
The p th moment stability is proved.
(2) By the same argument as shown in (1), we can obtain that for any initial data , there exists a constant such that
and
We first show that
In order to prove (13), it is enough to show that for any given γ with , there exists a such that for . Let satisfy . Obviously, for . Set , , , . Let M be the smallest nonnegative integer such that .
We will show that
We will prove (14) by induction. Obviously, (14) holds for . Assume that (14) holds for . Then we will obtain that there exists a such that
Otherwise, for all , we have
which implies that
Using Itô’s formula, (7) and (16), we have
which contradicts (16). So, (15) must hold. We assert that for all ,
Otherwise, there is a such that
Set . Then there exists a sufficiently small such that
which implies that
Then, by Itô’s formula and (7),
Hence , which contradicts (21). We therefore have
On the other hand, using (6), (10) and (23), we can obtain that
Moreover, by (6),
for . That is, (14) holds for . By induction, (14) holds for . Thus
So, (13) must hold. Using (6) yields
Since , we conclude that . Using (10), we have
which implies that
The proof is complete. □
Remark The result obtained in Theorem 3.1 is different from the ones in [2, 16, 17, 19, 20]. The results obtained in [2, 16, 19, 20] only deal with NSFDEs with finite delay. It is easy to see that NSPE (4) is a class of NSFDEs with infinite delay. So, these results obtained in [2, 16, 19, 20] cannot be applied to NSPE (4). On the other hand, the result obtained in [17] studied the stability of NSFDEs with infinite delay. But Theorem 3.1 studied the p th moment asymptotic stability of NSPE (4). Since Theorem 3.1 is established without taking difficulties from infinite delay into account, the conditions of Theorem 3.1 are much weaker than the one obtained in [17]. So, our work is not trivial.
If we take , the condition (7) may be written as
for all satisfying
where .
Corollary 3.1 Let Assumption (H) hold. Assume that there are two positive constants and such that
for all and . If
then the trivial solution of Eq. (4) is globally pth moment asymptotically stable.
Proof As in Theorem 3.1, let be the solution of the system (4) for any given initial data . By the condition (27), we can choose such that
Let and satisfy
Note that for any ,
Hence
It then follows from (26) and (29) that
where . Using (28) yields
That is, the condition (25) is satisfied. Hence the conclusion follows from Theorem 3.1. The proof is complete. □
Corollary 3.2 Let Assumption (H) hold. Assume that there are four positive constants , , and such that
for all and . If
then the trivial solution of Eq. (4) is mean square stable.
Proof Using (31), we have
for all . Then the desired conclusion is obtained from Corollary 3.1 as taking . The proof is complete. □
4 Mean square stability of the backward Euler method
In this section, we develop the backward Euler method for Eq. (4). We will show that the backward Euler method can preserve the mean square stability of exact solutions of Eq. (4).
To define the backward Euler method for Eq. (4), we introduce a mesh as follows. We assume that the initial time . Set . We define grid points in by
where the initial step size , and define the other grid points by
Let . It is easy to see that grid points satisfy for and the step size satisfies
For the given mesh , the backward Euler method for Eq. (4) is defined as follows:
with the initial values
Here, () is an approximation value of and -measurable. is the Brownian motion increment.
Definition 4.1 The numerical solution () of Eq. (4) is said to be mean square stable if for every , there exists such that
whenever the initial values satisfy and, moreover,
Theorem 4.1 Assume the backward Euler method (33) is well defined. Let Assumption (H), conditions (31) and (32) hold. Then the backward Euler method approximate solution (33) is mean square stable.
Proof Set . For , by (33),
Then we can obtain that
which subsequently leads to
By the condition (31),
Using the equality yields
and
Inserting these inequalities into (35) and using Assumption (H), we have
Let , , and . Using these notations, (36) implies that
By the condition (32), we have
Let . There exists a positive integer N such that
that is,
Set . Then, by (37),
where denotes the ‘greatest integer in’ function. (38) implies
The proof is complete. □
5 Numerical experiments
In this section, we present numerical experiments to illustrate theoretical results obtained in the previous sections.
Consider the following scalar problem:
For Eq. (39), we can obtain that , , , and corresponding to Corollary 3.2. By Corollary 3.2, the solution of Eq. (39) is mean square stable. Theorem 4.1 shows that the backward Euler method approximation of Eq. (39) can preserve the mean square stability of the exact solution .
A set of 20 blocks each containing 100 outcomes (, , ) is simulated, and denotes the n th step value of the backward Euler method approximation of the j th trajectory in the i th block. We compute of the backward Euler method approximation by
Two tests are developed with different initial step sizes . Results are shown in Figure 1. It is easy to see that these results are compatible with the conclusion of Theorem 4.1.
Conclusion
In this paper, we have firstly investigated the p th moment asymptotic stability of NSPEs. Although the NSPE is a special class of NFDEs with infinite delay, we show that the Razumikhin-type theorem on the p th moment asymptotic stability of NSPEs can be established without taking into account difficulties from infinite delay. On the other hand, we also develop the backward Euler method for NSPEs. We show that the backward Euler method can preserve the mean square stability of exact solutions under suitable conditions. Numerical examples have been provided to demonstrate the validity of our results.
References
Mao X: Exponential stability in mean square of neutral stochastic differential functional equations. Syst. Control Lett. 1995, 26: 245–251. 10.1016/0167-6911(95)00018-5
Mao X: Razumikhin-type theorems on exponential stability of neutral stochastic functional differential equations. SIAM J. Math. Anal. 1997, 28: 389–401. 10.1137/S0036141095290835
Mao X, Rodkina A, Koroleva N: Razumikhin-type theorems for neutral stochastic functional differential equations. Funct. Differ. Equ. 1998, 5(1–2):195–211.
Mao X: Asymptotic properties of neutral stochastic differential delay equations. Stoch. Stoch. Rep. 2000, 68: 273–295. 10.1080/17442500008834226
Mao X, Shen Y, Yuan C: Almost surely asymptotic stability of neutral stochastic differential delay equations with Markovian switching. Stoch. Process. Appl. 2008, 118: 1385–1406. 10.1016/j.spa.2007.09.005
Fan Z, Liu M, Cao W: Existence and uniqueness of the solutions and convergence of semi-implicit Euler methods for stochastic pantograph equations. J. Math. Anal. Appl. 2007, 325: 1142–1159. 10.1016/j.jmaa.2006.02.063
Fan Z, Song M, Liu M: The α th moment stability for the stochastic pantograph equation. J. Comput. Appl. Math. 2009, 233: 109–120. 10.1016/j.cam.2009.04.024
Iserles A: On the generalized pantograph functional-differential equations. Eur. J. Appl. Math. 1993, 4: 1–38.
Huang C, Vandewalle S: Discretized stability and error growth of the nonautonomous pantograph equation. SIAM J. Numer. Anal. 2005, 42: 2020–2042. 10.1137/S0036142902419296
Wang W, Li S: On the one-leg h -methods for solving nonlinear neutral functional differential equations. Appl. Math. Comput. 2007, 193: 285–301. 10.1016/j.amc.2007.03.064
Liu Y: Asymptotic behaviour of functional-differential equations with proportional time delay. Eur. J. Appl. Math. 1996, 7: 11–30.
Koto T: Stability of Runge-Kutta methods for the generalized pantograph equation. Numer. Math. 1999, 84: 233–247. 10.1007/s002110050470
Bellen A, Maset S, Torelli L: Contractive initializing methods for the pantograph equation of neutral type.3. Recent Trends in Numerical Analysis 2000, 35–41.
Ma S, Yang Z, Liu M: -stability of modified Runge-Kutta methods for nonlinear neutral pantograph equations. J. Math. Anal. Appl. 2007, 335: 1128–1142. 10.1016/j.jmaa.2007.02.035
Yu Z: Almost surely asymptotic stability of exact and numerical solutions for neutral stochastic pantograph equations. Abstr. Appl. Anal. 2011., 2011: Article ID 143079 10.1155/2011/143079
Zhou S, Hu S: Razumikhin-type theorems of neutral stochastic functional differential equations. Acta Math. Sci. 2009, 29(1):181–190.
Wu F, Hu S, Mao X: Razumikhin-type theorem for neutral stochastic functional differential equations with unbounded delay. Acta Math. Sci. 2011, 31(4):1245–1258.
Randjelovic J, Jankovic S: On the p -th moment exponential stability criteria of neutral stochastic functional differential equations. J. Math. Anal. Appl. 2007, 326: 266–280. 10.1016/j.jmaa.2006.02.030
Jankovic S, Randjelovic J, Jovanovic M: Razumikhin-type exponential stability criteria of neutral stochastic functional differential equations. J. Math. Anal. Appl. 2009, 355: 811–820. 10.1016/j.jmaa.2009.02.011
Huang L, Deng F: Razumikhin-type theorems on stability of neutral stochastic functional differential equations. IEEE Trans. Autom. Control 2008, 53(7):1718–1723.
Gan S, Schurz H, Zhang H: Mean square convergence of stochastic θ -methods for nonlinear neutral stochastic differential delay equations. Int. J. Numer. Anal. Model. 2011, 8: 201–213.
Zhou S, Wu F: Convergence of numerical solutions to neutral stochastic delay differential equations with Markovian switching. J. Comput. Appl. Math. 2009, 229: 85–96. 10.1016/j.cam.2008.10.013
Yin B, Ma Z: Convergence of the semi-implicit Euler method for neutral stochastic delay differential equations with phase semi-Markovian switching. Appl. Math. Model. 2011, 35: 2094–2109. 10.1016/j.apm.2010.11.002
Mao X: Stochastic Differential Equations and Their Applications. Ellis Horwood, Chichester; 1997.
Acknowledgements
The author would like to thank the referees for their helpful comments and suggestions.
Author information
Authors and Affiliations
Corresponding author
Additional information
Competing interests
The author declares that he has no competing interests.
Authors’ original submitted files for images
Below are the links to the authors’ original submitted files for images.
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 2.0 International License (https://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
About this article
Cite this article
Yu, Z. Razumikhin-type theorem and mean square asymptotic behavior of the backward Euler method for neutral stochastic pantograph equations. J Inequal Appl 2013, 299 (2013). https://doi.org/10.1186/1029-242X-2013-299
Received:
Accepted:
Published:
DOI: https://doi.org/10.1186/1029-242X-2013-299