American Journal of Computational Mathematics
Vol.04 No.05(2014), Article ID:52755,7 pages
10.4236/ajcm.2014.45040

Mean Square Heun’s Method Convergent for Solving Random Differential Initial Value Problems of First Order

M. A. Sohaly

Department of Mathematics, Faculty of Science, Mansoura University, Mansoura, Egypt

Email: m_stat2000@yahoo.com

Copyright © 2014 by author and Scientific Research Publishing Inc.

This work is licensed under the Creative Commons Attribution International License (CC BY).

http://creativecommons.org/licenses/by/4.0/

Received 23 September 2014; revised 20 October 2014; accepted 12 November 2014

ABSTRACT

This paper deals with the construction of Heun’s method of random initial value problems. Sufficient conditions for their mean square convergence are established. Main statistical properties of the approximations processes are computed in several illustrative examples.

Keywords:

Stochastic Partial Differential Equations, Mean Square Sense, Second Order Random Variable, Finite Difference Scheme

1. Introduction

Random differential equation (RDE), is an ordinary differential equation (ODE) with random inputs that can model unpredictable real-life behavior of any continuous system and they are important tools in modeling complex phenomena. They arise in many physics and engineering applications such as wave propagation, diffusion through heterogeneous random media. Additional examples can be found in materials science, chemistry, biology, and other areas. However, reaching a solution of these equations in a closed form is not always possible or even easy. Due to the complex nature of RDEs, numerical simulations play an important role in studying this class of DEs. For this reason, few numerical and analytical methods have been developed for simulating RDEs. Random solutions are always studied in terms of their statistical measures.

This paper is interested in studying the following random differential initial value problem (RIVP) of the form:

(1)

Randomness may exist in the initial value or in the differential operator or both. In [1] [2] , the authors discussed the general order conditions and a global convergence proof was given for stochastic Runge-Kutta methods applied to stochastic ordinary differential equations (SODEs) of Stratonovich type. In [3] [4] , the authors discussed the random Euler method and the conditions for the mean square convergence of this problem. In [5] , the authors considered a very simple adaptive algorithm, based on controlling only the drift component of a time step but if the drift was not linearly bounded, then explicit fixed time step approximations, such as the Euler- Maruyama scheme, may fail to be ergodic. Platen, E. [6] discussed discrete time strong and weak approximation methods that were suitable for different applications. [12] discussed the mean square convergent Euler and Runge Kutta methods for random initial value problem. Other numerical methods are discussed in [7] -[12] .

In this paper the random Heun’s method is used to obtain an approximate solution for Equation (1). This paper is organized as follows. In Section 2, some important preliminaries are discussed. In Section 3, random differential equations are discussed. In Section 4, the convergence of random Heun’s method is discussed. Section 5 presents the solution of numerical example of first order random differential equation using random Heun’s method showing the convergence of the numerical solutions to the exact ones (if possible). The general conclusions are presented in Section 6.

2. Preliminaries

Definition 1 [13] . Let us consider the properties of a class of real r.v.’s whose second moments, are finite. In this case, they are called “second order random variables”, (2.r.v’s).

The Convergence in Mean Square [13]

A sequence of r.v’s converges in mean square (m.s) to a random variable X if: i.e. or where l.i.m is the limit in mean square sense.

3. Random Initial Value Problem (RIVP)

If we have the random differential equation

(2)

where X0 is a random variable, and the unknown as well as the right-hand side are stochastic processes defined on the same probability space, are powerful tools to model real problems with uncertainty.

Definition 2 [6] [7] .

・ Let is an m.s. bounded function and let then The “m.s. modulus of continuity of g” is the function

・ The function g is said to be m.s. uniformly continuous in T if:

Note that: (The limit depend on h because g is defined at every t so we can write).

In the problem (2) that we discusses we find that the convergence of this problem is depend on the right hand side (i.e.) then we want to apply the previous definition on hence:

Let be defined on S × T where S is bounded set in L2 Then we say that f is “randomly bounded

uniformly continuous” in S, if (note that:).

A Random Mean Value Theorem for Stochastic Processes

The aim of this section is to establish a relationship between the increment of a 2-s.p. and its m.s. derivative for some lying in the interval for. This result will be used in the next section to prove the convergence of the random Heun’s method discussed.

Lemma (3.2) [6] [7] .

Let is a 2-s.p., m.s. continuous on interval. Then, there exists such that:

(3)

Theorem (3.3) [6] [7] .

Let be a m.s. differentiable 2-s.p. in and m.s. continuous in. Then, there exists such that:

4. The Convergence of Random Heun’s Scheme

In this section we are interested in the mean square convergence, in the fixed station sense, of the random Heun’s method defined by:

(4)

where and are 2-r.v.’s, , and, satisfies the following conditions:

C1: is randomly bounded uniformly continuous.

C2: satisfies the m.s. Lipschitz condition:

(5)

Note that under hypothesis C1 and C2, we are interested in the m.s. convergence to zero of the error:

(6)

where is the theoretical solution 2-s.p. of the problem (2),.

Taking into account (2), and Th (3.3), one gets, since from (2) we have at then:. (Note: and we can use instead of.)

And from Th (3.3) at then we obtain:

Note that we deal with the interval and hence was the starting in the problem (2) and here is the starting and since Heun’s method deal with solution depend on previous solution and if we have instead of then we can use instead of hence the final form of the problem (2) is:

(7)

Now we have the solution of problem (2) is:

At then and the solution of Heun’s method (4) is:

Then we can define the error:

By (4) and (7) it follows that:

Then we obtain:

By taking the norm for the two sides:

(8)

Since:

(9)

Since the theoretical solution is m.s. bounded in, and under hypothesis C1, C2, we have:

(10)

where is Lipschitz constant (from C2) and:

From Th (3.3) we have and note that the two points are and in (10) then:

where: and

Then by substituting in (9) we have:

(11)

And another term:

Since:

where is Lipschitz constant (from C2) and:

From Th (3.3) we have and note that the two points are and in (10) then we have:

where and

And the last term:

Then by substituting in (8) we have:

Finally, we have:

Taking into account that where and by taking the limit as:

then we have:

i.e. converge in m.s. to zero as: hence

5. Case Study

Example: Solve the problem

, , ,

The theoretical solution is:

The approximations:

In this results showed in the table we have the Heun’s method gave better approximation as: than Euler and Rung-Kutta [12] for solving random variable, ınitial value problems.

6. Conclusion

The initially valued first order random differential equations can be solved numerically using the random Heun’s methods in mean square sense. The convergence of the presented numerical techniques has been proven in mean square sense. The results of the paper have been illustrated through an example.

References

  1. Burrage, K. and Burrage, P.M. (1996) High Strong Order Explicit Runge-Kutta Methods for Stochastic Ordinary Differential Equations. Applied Numerical Mathematics, 22, 81-101. http://dx.doi.org/10.1016/S0168-9274(96)00027-X
  2. Burrage, K. and Burrage, P.M. (1998) General Order Conditions for Stochastic Runge-Kutta Methods for Both Commuting and Non-Commuting Stochastic Ordinary Equations. Applied Numerical Mathematics, 28, 161-177. http://dx.doi.org/10.1016/S0168-9274(98)00042-7
  3. Cortes, J.C., Jodar, L. and Villafuerte, L. (2007) Numerical Solution of Random Differential Equations, a Mean Square Approach. Mathematical and Computer Modeling, 45, 757-765. http://dx.doi.org/10.1016/j.mcm.2006.07.017
  4. Cortes, J.C., Jodar, L. and Villafuerte, L. (2006) A Random Euler Method for Solving Differential Equations with Uncertainties. Progress in Industrial Mathematics at ECMI.
  5. Lamba, H., Mattingly, J.C. and Stuart, A. (2007) An Adaptive Euler-Maruyama Scheme for SDEs, Convergence and Stability. IMA Journal of Numerical Analysis, 27, 479-506. http://dx.doi.org/10.1093/imanum/drl032
  6. Platen, E. (1999) An Introduction to Numerical Methods for Stochastic Differential Equations. Acta Numerica, 8, 197-246. http://dx.doi.org/10.1017/S0962492900002920
  7. Higham, D.J. (2001) An Algorithmic Introduction to Numerical Simulation of SDE. SIAM Review, 43, 525-546. http://dx.doi.org/10.1137/S0036144500378302
  8. Talay, D. and Tubaro, L. (1990) Expansion of the Global Error for Numerical Schemes Solving Stochastic Differential Equation. Stochastic Analysis and Applications, 8, 483-509. http://dx.doi.org/10.1080/07362999008809220
  9. Burrage, P.M. (1999) Numerical Methods for SDE. Ph.D. Thesis, University of Queensland, Brisbane.
  10. Kloeden, P.E., Platen, E. and Schurz, H. (1997) Numerical Solution of SDE through Computer Experiments. 2nd Edition, Springer, Berlin.
  11. El-Tawil, M.A. (2005) The Approximate Solutions of Some Stochastic Differential Equations Using Transformation. Applied Mathematics and Computation, 164, 167-178. http://dx.doi.org/10.1016/j.amc.2004.04.062
  12. El-Tawil, M.A. and Sohaly, M.A. (2011) Mean Square Numerical Methods for Initial Value Random Differential Equations. Open Journal of Discrete Mathematics, 1, 66-84. http://dx.doi.org/10.4236/ojdm.2011.12009
  13. Kloeden, P.E. and Platen, E. (1999) Numerical Solution of Stochastic Differential Equations. Springer, Berlin.