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

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.


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: 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.

Preliminaries
Definition 1 [13].Let us consider the properties of a class of real r.v.'s 1 2 , , , n X X X  whose second moments, , , E X E X  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.
where l.i.m is the limit in mean square sense.

Random Initial Value Problem (RIVP)
If we have the random differential equation where X 0 is a random variable, and the unknown ( ) X t as well as the right-hand side 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.

( ) ( )
, f X t t ) then we want to apply the previous definition on , f X t t be defined on S × T where S is bounded set in L 2 Then we say that f is "randomly bounded uniformly continuous" in S, if

A Random Mean Value Theorem for Stochastic Processes
The aim of this section is to establish a relationship between the increment ( ) ( )

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: where n X and ( ) .
Note that under hypothesis C1 and C2, we are interested in the m.s.convergence to zero of the error: ( ) where ( ) X t is the theoretical solution 2-s.p. of the problem (2), 0 n t t t nh = = + .Taking into account (2), and Th (3.3), one gets, since from (2) we have at t t ξ = then: and we can use ξ instead of t ξ .) And from Th (3.3) at t t ξ = then we obtain: ∋ ∈ and hence 0 t was the starting in the problem (2) and here n t is the starting and since Heun's method deal with solution depend on previous solution and if we have , , for some , .
Now we have the solution of problem (2) is: and the solution of Heun's method (4) is: . n X Then we can define the error: n n e X X t = − By ( 4) and ( 7) it follows that: ( ) Then we obtain: By taking the norm for the two sides: n n Since the theoretical solution ≤ < ∞ and under hypothesis C1, C2, we have: , , where ( ) ) and: From Th (3.3) we have and note that the two points are ( ) Then by substituting in (9) we have: .
Then by substituting in (8) we have:

K t hM h h k t k t w h hk t M hk t M K t hM h h k t k t w h hk t M hk t M K t hM
Taking into account that 0 0 e = where ( ) 0 0 0 0 e X X t = − = and by taking the limit as: 0 h → then we have: In this results showed in the table we have the Heun's method gave better approximation as: 0 h → than Euler and Rung-Kutta [12] for solving random variable, ınitial value problems.

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.