Processing math: 68%
Research article

Ostrowski type inequalities for exponentially s-convex functions on time scale

  • Received: 01 October 2021 Revised: 19 November 2021 Accepted: 21 November 2021 Published: 24 December 2021
  • MSC : 26A51, 26D10, 46N50

  • In this paper we establish some new inequalities of Ostrowski type for exponentially s-convex functions and s-convex functions on time scale. We also make comparison of our new results with already existing results by imposing some conditions.

    Citation: Anjum Mustafa Khan Abbasi, Matloob Anwar. Ostrowski type inequalities for exponentially s-convex functions on time scale[J]. AIMS Mathematics, 2022, 7(3): 4700-4710. doi: 10.3934/math.2022261

    Related Papers:

    [1] Muhammad Qiyas, Talha Madrar, Saifullah Khan, Saleem Abdullah, Thongchai Botmart, Anuwat Jirawattanapaint . Decision support system based on fuzzy credibility Dombi aggregation operators and modified TOPSIS method. AIMS Mathematics, 2022, 7(10): 19057-19082. doi: 10.3934/math.20221047
    [2] Muhammad Qiyas, Neelam Khan, Muhammad Naeem, Saleem Abdullah . Intuitionistic fuzzy credibility Dombi aggregation operators and their application of railway train selection in Pakistan. AIMS Mathematics, 2023, 8(3): 6520-6542. doi: 10.3934/math.2023329
    [3] Shichao Li, Zeeshan Ali, Peide Liu . Prioritized Hamy mean operators based on Dombi t-norm and t-conorm for the complex interval-valued Atanassov-Intuitionistic fuzzy sets and their applications in strategic decision-making problems. AIMS Mathematics, 2025, 10(3): 6589-6635. doi: 10.3934/math.2025302
    [4] Attaullah, Shahzaib Ashraf, Noor Rehman, Asghar Khan, Muhammad Naeem, Choonkil Park . Improved VIKOR methodology based on q-rung orthopair hesitant fuzzy rough aggregation information: application in multi expert decision making. AIMS Mathematics, 2022, 7(5): 9524-9548. doi: 10.3934/math.2022530
    [5] Muhammad Qiyas, Muhammad Naeem, Neelam Khan, Lazim Abdullah . Bipolar complex fuzzy credibility aggregation operators and their application in decision making problem. AIMS Mathematics, 2023, 8(8): 19240-19263. doi: 10.3934/math.2023981
    [6] Saleem Abdullah, Muhammad Qiyas, Muhammad Naeem, Mamona, Yi Liu . Pythagorean Cubic fuzzy Hamacher aggregation operators and their application in green supply selection problem. AIMS Mathematics, 2022, 7(3): 4735-4766. doi: 10.3934/math.2022263
    [7] Attaullah, Shahzaib Ashraf, Noor Rehman, Asghar Khan, Choonkil Park . A decision making algorithm for wind power plant based on q-rung orthopair hesitant fuzzy rough aggregation information and TOPSIS. AIMS Mathematics, 2022, 7(4): 5241-5274. doi: 10.3934/math.2022292
    [8] Rana Muhammad Zulqarnain, Xiao Long Xin, Muhammad Saeed . Extension of TOPSIS method under intuitionistic fuzzy hypersoft environment based on correlation coefficient and aggregation operators to solve decision making problem. AIMS Mathematics, 2021, 6(3): 2732-2755. doi: 10.3934/math.2021167
    [9] Esmail Hassan Abdullatif Al-Sabri, Muhammad Rahim, Fazli Amin, Rashad Ismail, Salma Khan, Agaeb Mahal Alanzi, Hamiden Abd El-Wahed Khalifa . Multi-criteria decision-making based on Pythagorean cubic fuzzy Einstein aggregation operators for investment management. AIMS Mathematics, 2023, 8(7): 16961-16988. doi: 10.3934/math.2023866
    [10] Qiansheng Zhang, Jingfa Liu . Entropy of credibility distribution for intuitionistic fuzzy variable. AIMS Mathematics, 2023, 8(4): 9671-9691. doi: 10.3934/math.2023488
  • In this paper we establish some new inequalities of Ostrowski type for exponentially s-convex functions and s-convex functions on time scale. We also make comparison of our new results with already existing results by imposing some conditions.



    Stochastic differential equations (SDEs) are used to describe phenomena in the context of natural science and engineering. To consider models of phenomena whose future states depend not only on the present states but also on the past states, stochastic differential delay equations (SDDEs) are used. For example, we refer to [1], in which the delay market model is studied. The study of SDDEs was started in a previous paper [2], in which Ito and Nisio considered SDEs that depend on infinite past processes. Following the paper, many properties of SDDEs have been discovered. Refer to the paper by Ivanov et al. [3] for a survey.

    Because solutions of SDDEs are influenced by past events, they do not have Markov properties. This makes representations of solutions complicated; therefore, approximate solutions of SDDEs have been studied.

    In [4], the strong discrete time approximation of an SDDE with a single constant time delay is studied. Under the global Lipschitz condition, the explicit solutions for linear stochastic delay equations are given. The global Lipschitz condition has been relaxed to the local Lipschitz condition in [5] and [6]. However, studies of SDDEs with a single constant time delay are still ongoing under the global Lipschitz condition (cf. [7] and [8]).

    As mentioned in [9], when we consider approximate solutions of SDEs, it is important to know the error rate of convergence of approximate solutions to the exact solutions. In [10] and [11], Kanagawa obtained the rate of convergence of Euler–Maruyama approximate solutions of SDEs in the L2-mean and Lp-mean for some p2, respectively. In [12], we stated the rate of convergence in the L2-mean for SDDEs with a single delay function. In [13], we studied the cases of SDDEs with multiple delay functions and stated the rate of convergence in the L2-mean. However, in [12] and [13], the results were given without detail of proof.

    The Euler–Maruyama approximation scheme for SDEs is implemented by a step function, which is a discretization of Brownian motion B(t). The random increments are given by ΔBn=B(tn)B(tn1),n=1,2,, and the values provided by pseudo-random variables. Brownian motion, however, moves the time interval [tn1,tn]. With the awareness of such issues, Kanagawa proposed a method of confidence interval estimations to predict the exact solutions in [14]. His method is supported by stochastic analysis ([10] and [11]) and Chebyshev's inequality. Through confidence interval estimations, we can expect sample paths of solutions of SDEs in each time interval (see Figure 6 in [9] and [15]). We remark that it is not possible to obtain confidence intervals by generating many trajectories using simulation studies and measuring the results, because we cannot obtain information on the behavior of {B(t),t(tn1,tn)}. Refer to Chapter 11 in [16], [9], [17] and [18] for details on simulation studies for SDEs. In the case of SDDEs, the confidence interval estimations for the Euler–Maruyama approximate solutions were studied in [12] and [13] only for the special case of SDDEs, which have no drift terms following [14] and [15].

    This paper is a continuation of our previous works [12] and [13]. In this paper, we consider SDDEs under the global Lipschitz condition containing multiple delay functions. In this sense, the model considered in this paper is an extension of those in [4], [7] and [8]. The purpose of this paper is two-fold. The first is to state a convergence theorem in the Lp-mean for some p2 following the method by Kanagawa ([11]). We remark that the convergence theorem showed in this paper includes the results in [12] and [13]. The second is to present the confidence interval estimations for the general case of SDDEs, which have diffusion terms and drift terms.

    This paper is organized as follows. In the following section, we provide a setting of the SDDE and its Euler–Maruyama approximation scheme. After that we state our main theorem, i.e., the rate of convergence in the Lp-mean for some p2. In Section 3, we provide confidence interval estimations for the Euler–Maruyama approximate solutions of SDDEs for the general case and the special case. In Section 4, we present numerical examples of confidence interval estimations provided in Section 3. In Section 5, we provide proofs for the general case of SDDEs. We also provide the proofs for the special case of SDDEs.

    Let (Ω,F,P) be a complete probability space. On the space, we provide a filtration {Ft}t0 that satisfies the usual conditions; that is, it is right continuous and F0 contains all P-null sets. We denote such a space by (Ω,F,P;Ft). Let B(t)=t(B1(t),,Bm(t)) be an m-dimensional standard Brownian motion on (Ω,F,P;Ft). Let τ>0 and C([τ,0];Rn) denotes the space of continuous functions ξ:[τ,0]Rn with norms generated by supτt0|ξ(t)|. Additionally, CFt([a,b];Rn) denotes the family of Ft-measurable C([a,b];Rn)-valued random variables.

    We next provide a setting of an SDDE. We first introduce delay functions as follows:

    (D) (ⅰ) Let δi(t) be a Borel measurable function such that

    τδi(t)t for i=1,,. (2.1)

    (ⅱ) For each δi, we assume that

    |δi(t)δi(s)|ρ|ts|, s,t0 for some positive constant ρ. (2.2)

    Initial data are given by information for t0, which is denoted by {ξ(t),τt0}CF0([τ,0];Rn). For ξ, we assume the following:

    (P) (ⅰ) For some p2, there exists K0< such that

    supτt0E[|ξ(t)|p]=K0. (2.3)

    (ⅱ) For the same p in (2.3), there exist K1>0 and γ(0,1] such that

    E[|ξ(t)ξ(s)|p]K1(ts)γ, τs<t0. (2.4)

    Let f(x0,,x) and g(x0,,x) be B(Rn)B(Rn×)-measurable functions with values in Rn and Rn×m, respectively. Let T be a positive constant. We consider the following n-dimensional SDDE:

    dX(t)=f(X(t),,X(δ(t)))dt+g(X(t),,X(δ(t)))dB(t),0tT,X(t)=ξ(t),τt0. (2.5)

    For the functions f and g, we assume the following:

    (H) For any x0,,x,¯x0,,¯xRn, there exists K2>0 such that

    |f(x0,,x)f(¯x0,,¯x)|2|g(x0,,x)g(¯x0,,¯x)|2K2(|x0¯x0|2++|x¯x|2), (2.6)

    where ab:=max{a,b}.

    We remark that (H) implies that

    |f(x0,,x)|2|g(x0,,x)|2K(1+|x0|2++|x|2), (2.7)

    where

    K:=2(K2|f(0,,0)|2|g(0,,0)|2). (2.8)

    We next explain the Euler–Maruyama approximation scheme for the SDDE (2.5). We set a time step Δ with an integer N such that

    Δ:=τ/N1ρ+1. (2.9)

    Using the time step, we provide a discrete approximate solution of the SDDE (2.5) by

    ¯y((k+1)Δ)=¯y(kΔ)+f(¯y(kΔ),,¯y(I()kΔΔ))Δ+g(¯y(kΔ),,¯y(I()kΔΔ))ΔBk,k=0,1,,N1,¯y(t)=ξ(t),τt0, (2.10)

    where ΔBk=B((k+1)Δ)B(kΔ) and I(i)kΔ is the integer part of δi(kΔ)/Δ for i=1,2,,.

    We consider a continuous approximate solution. Let 1S(t) denote the indicator function of a subset of time interval S. We set

    z0(t):=k=01[kΔ,(k+1)Δ)(t)¯y(kΔ),zi(t):=k=01[kΔ,(k+1)Δ)(t)¯y(I(i)kΔΔ),i=1,,, (2.11)

    and define a continuous Euler–Maruyama approximate solution:

    y(t)={ξ(t),τt0,ξ(0)+t0f(z0(s),,z(s))ds+t0g(z0(s),,z(s))dB(s), 0tT.

    We remark that for each k, the discrete solution ˉy(kΔ) and the continuous solution y(kΔ) are the same. Then, we obtain the rate of convergence in the Lp-mean as follows.

    Theorem 2.1. For the SDE with multiple delays (2.5), we assume (D), (P) and (H). Then, for p2 in (P) there exist constants C1 and C2 such that

    E[sup0tT|X(t)y(t)|p]4p1Kp/22Tp(1+cp)(+2)p/21(C1+C2) Δγexp[4p1Kp/22Tp(1+cp)(+2)p/21(+1)], (2.12)

    where cp=pp(p+1)/22p/2(p1)p(p1)/2.

    Remark 2.1. We remark that rates of convergence of approximate solutions of SDEs in the Lp-mean are given by the strong order to the power p/2 (e.g. Theorem 1 in [11]). For SDDEs, the rates of convergence are influenced by not only p but also the Hölder continuous of initial data γ.

    We provide the proof of Theorem 2.1 in the final section.

    In this section, we consider confidence interval estimations for approximate solutions. Theorem 2.1 implies an error estimation for Euler-Maruyama approximate solutions of diffusion processes governed by SDEs with multiple delays. The inequality (2.12) tells us

    limΔ0E[sup0tT|X(t)y(t)|2]=0.

    The definition of time step (2.9) and Chebyshev's inequality imply that for any ϵ>0,

    P{sup0tT|X(t)y(t)|ϵ}1E[sup0tT|X(t)y(t)|2]/ϵ21O(N1)/ϵ2as N .

    This inequality provides only the order of the hazard rate; hence, more information is required to obtain a confidence interval estimation. In this section, we present refined estimations for a general case and a special case.

    Using the inequality (2.12) in Theorem 2.1 with p=2, we obtain the following confidence interval estimation.

    Theorem 3.1. For the SDE with multiple delays (2.5), we assume (D), (P) and (H). Then, for any ϵ>0

    P[sup0tT|X(t)y(t)|ϵ]120ϵ2K2T2(C1+C2)e20K2T2(+1)Δγ. (3.1)

    Proof. Theorem 2.1 and Chebyshev's inequality imply that

    P{sup0tT|X(t)y(t)|>ϵ}<1ϵ2E[sup0tT|X(t)y(t)|2]<20ϵ2K2T2(C1+C2)e20K2T2(+1)Δγ,

    which proves Theorem 3.1.

    The expressions of constants C1 and C2 in Theorems 2.1 are complicated, and they are given in (5.5) and (5.9), respectively (see also (5.7) in Lemma 5.3). For SDDEs which have no drift terms, the expressions become simpler. We next consider the special case and provide confidence interval estimations.

    For the case f0 in (2.5), the SDDE is given by

    d˜X(t)=g(˜X(t),,˜X(δ(t)))dB(t),0tT,˜X(t)=ξ(t),τt0. (3.2)

    ˜y(t) denotes a discreate Euler–Maruyama approximate solution of ˜X(t). Then, we obtain the following confidence interval estimation.

    Corollary 3.1. For the SDE with multiple delays (3.2), we assume (D), (P) and (H). Then, there exist constants ˜C1 and ˜C2 such that, for any ϵ>0

    P[sup0tT|˜X(t)˜y(t)|ϵ]18ϵ2K2T(˜C1+˜C2)e8K2T(+1)Δγ, (3.3)

    where

    ˜C1=K{1+˜C3(+1)}, ˜C3=2(K0+KT)e2KT(+1),

    and ˜C2 is a constant which is given as follows:

    for delay functions δi(t),i=1,,,

    ˜Ci2={˜C1(ρ+1),0I(i)kΔΔδi(t),˜C1ρ,0δi(t)I(i)kΔΔ,2˜C1(ρ+1)+2K1(ρ+1)γ,I(i)kΔΔ0δi(t),2˜C1ρ+2K1ργ,δi(t)0I(i)kΔΔ,K1(ρ+1)γ,I(i)kΔΔδi(t)0 or δi(t)I(i)kΔΔ0, (3.4)

    and we set

    ˜C2:=maxi=1,,˜Ci2. (3.5)

    Example 4.1. Recall that B(t)=t(B1(t),,Bm(t)) is an m-dimensional standard Brownian motion. Given an n-dimensional vector function f=(f1,,fn) and an n×m-matrix function g=(gij), we consider the following n-dimensional SDDE:

    dXl(t)=fl(X(t),,X(δ(t)))dt+mj=1glj(X(t),,X(δ(t)))dBj(t), 0tT, (4.1)

    which is the l-th component of the n-dimensional SDDE. We assume that Lipschitz's constant in (2.2) is given by ρ=101. To apply Theorem 3.1, we give the setting as follows:

    Finish time: T=1;

    Time step: Δ=104;

    Uniform boundedness of initial data: K0=101;

    Hölder continuity of initial data: γ=1,K1=101;

    The constant K2 in (2.6): K2=102(n1).

    In the case of =n=2, we set C2 as given in (5.9) (see also (5.7) in Lemma 5.3). Then, Theorem 3.1 implies that

    P{sup0t1|X(t)y(t)|1.94×102}0.9.

    Under the same setting as listed above, we present ϵ's in (3.1) for other cases of and n with the confidence levels 0.9 and 0.95 in Tables 1 and 2, respectively.

    Table 1.  Numerical results for n and on Example 4.1 with the confidence level 0.9.
    n 1 2 3 4 5 10
    2 1.068×102 1.944×102 3.028×102 4.404×102 6.156×102 2.470×101
    3 8.760×104 1.444×103 2.038×103 2.684×103 3.399×103 8.314×103
    4 8.742×105 1.440×104 2.030×104 2.671×104 3.379×104 8.224×104

     | Show Table
    DownLoad: CSV
    Table 2.  Numerical results for n and on Example 4.1 with the confidence level 0.95.
    n 1 2 3 4 5 10
    2 1.151×102 2.749×102 4.282×102 6.228×102 8.706×102 3.494×101
    3 1.239×103 2.043×103 2.882×103 3.797×103 4.807×103 1.176×102
    4 1.236×104 2.037×104 2.870×104 3.778×104 4.778×104 1.163×103

     | Show Table
    DownLoad: CSV

    We consider the following SDE with piecewise constant arguments (Example 1 in [19]):

    dX(t)={X(t)+X([t])+X([t1])}dt+{X(t)+X([t1])}dB(t), 0t2,X(t)=1, 1t0.

    Since the example above has piecewise constant time delays, the explicit solution is given by

    X(t)={exp{t2+B(t)}(ξ(0)+t0es2B(s)ds+t0es2B(s)dB(s)),t[0,1],exp{t12+B(t)B(1)}(X(1)+X(1)t1es12{B(s)B(1)}}ds+t0es12{B(s)B(1)}dB(s)),t[1,2].

    In the case of delay functions, the representations of explicit solutions of SDDEs by the stochastic integral are complicated. In such a case, we consider approximate solutions for SDDEs.

    Example 4.2. We consider the following one-dimensional SDDE with two-time delay functions.

    dX(t)={X(t)+X(δ1(t))+X(δ2(t))}dt+{X(t)+X(δ1(t))+X(δ2(t))}dB(t), (4.2)

    where Lipschitz's constant in (2.2) is given by ρ=101. To apply Theorem 3.1, we give the setting as follows:

    Finish time: T=2;

    Time step: Δ=104;

    Uniform boundedness of initial data: K0=101;

    Hölder continuity of initial data: γ=1,K1=101;

    The constant K2 in (2.6): K2=102.

    We set C2 in the same manner as that in Example 4.1. Then, Theorem 3.1 implies that

    P{sup0t1|X(t)y(t)|0.15}0.9.

    Example 4.3. We consider the SDDE (3.2). To apply Corollary 3.1, we give the setting as follows:

    Finish time: T=1;

    Time step: Δ=104;

    Lipschitz constant of the time delay: ρ=101;

    Uniform boundedness of initial data: K0=101;

    Hölder continuity of initial data: γ=1,K1=101;

    The constant K2 in (2.6): K2=102(n1).

    Under the conditions above, ˜C2 in (3.5) is determined. In the case of =n=2, we obtain that

    P{sup0t1|˜X(t)˜y(t)|8.04×103}0.9.

    Under the same setting as listed above, we present ϵ's in (3.3) for other cases of and n with the confidence levels 0.9 and 0.95 in Tables 3 and 4, respectively.

    Table 3.  Numerical results for n and on Example 4.3 with the confidence level 0.9.
    n 1 2 3 4 5 10
    2 5.458×103 8.040×103 1.041×102 1.276×102 1.512×102 2.961×102
    3 4.797×104 6.935×104 8.691×104 1.027×103 1.177×103 1.893×103
    4 4.791×105 6.925×105 8.675×105 1.025×104 1.174×104 1.886×104

     | Show Table
    DownLoad: CSV
    Table 4.  Numerical results for n and on Example 4.3 with the confidence level 0.95.
    n 1 2 3 4 5 10
    2 7.718×103 1.137×102 1.472×102 1.804×102 2.145×102 4.187×102
    3 6.784×104 9.808×104 1.229×103 1.453×103 1.664×103 2.678×103
    4 6.775×105 9.794×105 1.227×104 1.450×104 1.660×104 2.667×104

     | Show Table
    DownLoad: CSV

    Lemma 5.1. Under the assumptions (P) (i) and (H),

    supt[τ,T]E[|y(t)|p]3p1{K0+C3T}exp{3p1C3(+1)T}, (5.1)

    where

    C3=Kp/2(+2)p/21(Tp1+Tp/21{p(p1)2}p/2). (5.2)

    Proof. (ⅰ) For the case τt0,

    E[|y(t)|p]supτt0E[|ξ(t)|p]=K0.

    (ⅱ) For the case 0tT,

    E[|y(t)|p]=E[|ξ(0)+t0f(z0(s),,z(s))ds+t0g(z0(s),,z(s))dB(s)|p]3p1{E[|ξ(0)|p]+E[|t0f(z0(s),,z(s))ds|p]+E[|t0g(z0(s),,z(s))dB(s)|p]}=:3p1(I1+I2+I3).

    Using Hölder's inequality and the inequality (2.7), we obtain

    I2tp1E[t0|f(z0(s),,z(s))|pds]Kp/2tp1E[t0{1+|z0(s)|2++|z(s)|2}p/2ds]Kp/2(+2)p/21tp1E[t0{1+|z0(s)|p++|z(s)|p}ds].

    Using Burkholder–Davis–Gundy's inequality, we obtain

    I3tp/21{p(p1)2}p/2E[t0|g(z0(s),,z(s))|pds]Kp/2tp/21{p(p1)2}p/2E[t0{1+|z0(s)|2++|z(s)|2}p/2ds]Kp/2(+2)p/21tp/21{p(p1)2}p/2E[t0{1+|z0(s)|p++|z(s)|p}ds].

    Thus,

    I2+I3Kp/2(+2)p/21(tp1+tp/21{p(p1)2}p/2){t+(+1)t0supτusE[|y(u)|p]ds}C3{t+(+1)t0supτusE[|y(u)|p]ds}.

    Using Gronwall's lemma, we obtain

    supτtTE[|y(t)|p]3p1{K0+C3T}exp{3p1C3(+1)T}. 

    Following Lemma 5.1, we set

    C4:=3p1{K0+C3T}exp{3p1C3(+1)T}, (5.3)

    which does not depend on Δ.

    Lemma 5.2. Under the assumptions (D), (P) ( i ) and (H), for any t[0,T]

    E[|y(t)z0(t)|p]2p1Kp/2(+2)p/21(Δp1+Δp/21{p(p1)2}p/2){1+C4(+1)}Δ. (5.4)

    Proof. For a fixed t, there exists k such that t[kΔ,(k+1)Δ). We remark that z0(t)=ˉy(kΔ). In the same manner as those for showing Lemma 5.1, we obtain

    E[|y(t)z0(t)|p]=E[|y(t)ˉy(kΔ)|p]E[|tkΔf(z0(s),,z(s))ds+tkΔg(z0(s),,z(s))dB(s)|p]2p1{E[|tkΔf(z0(s),,z(s))ds|p]+E[|tkΔg(z0(s),,z(s))dB(s)|p]}2p1Kp/2(+2)p/21(Δp1+Δp/21{p(p1)2}p/2)E[tkΔ{1+|z0(s)|p++|z(s)|p}ds]2p1Kp/2(+2)p/21(Δp1+Δp/21{p(p1)2}p/2){1+C4(+1)}Δ. 

    Following Lemma 5.2, we set

    C1:=2p1Kp/2(+2)p/21(1+{p(p1)2}p/2){1+C4(+1)}, (5.5)

    which does not depend on Δ either.

    Lemma 5.3. Under the assumptions (D), (P) and (H), for any t[0,T]

    E[|y(δi(t))zi(t)|p]Ci2Δγ, i=1,,, (5.6)

    where Ci2 is given as follows:

    Ci2={2p1Kp/2(+2)p/21((ρ+1)p1+(ρ+1)p/21{p(p1)2}p/2){1+C4(+1)}(ρ+1),0I(i)kΔΔδi(t),2p1Kp/2(+2)p/21(ρp1+ρp/21{p(p1)2}p/2){1+C4(+1)}ρ,0δi(t)I(i)kΔΔ,2p1{2p1Kp/2(+2)p/21((ρ+1)p1+(ρ+1)p/21{p(p1)2}p/2){1+C4(+1)}(ρ+1)+K1(ρ+1)γ},I(i)kΔΔ0δi(t),2p1{K1ργ+2p1Kp/2(+2)p/21((ρ+1)p1+(ρ+1)p/21{p(p1)2}p/2){1+C4(+1)}ρ},δi(t)0I(i)kΔΔ,K1(ρ+1)γ,I(i)kΔΔδi(t)0 or δi(t)I(i)kΔΔ0. (5.7)

    Proof. (Ⅰ) Case in which 0I(i)kΔΔδi(t):

    For a fixed t[0,T], there exists k such that t[kΔ,(k+1)Δ). Then,

    y(δi(t))zi(t)=y(δi(t))y(I(i)kΔΔ).

    As δi(t)I(i)kΔΔ(ρ+1)Δ,

    E[|y(δi(t))zi(t)|p]2p1{E[|δi(t)I(i)kΔΔf(z0(s),,z(s))ds|p]+E[|δi(t)I(i)kΔΔg(z0(s),,z(s))dB(s)|p]}2p1Kp/2(+2)p/21({(ρ+1)Δ}p1+{(ρ+1)Δ}p/21{p(p1)2}p/2){1+C4(+1)}(ρ+1)Δ.

    This inequality and Δ<1 imply a constant Ci2 for this case.

    (Ⅱ) Case in which 0δi(t)I(i)kΔΔ:

    As I(i)kΔΔδi(t)δi(kΔ)δi(t)ρΔ,

    E[|y(δi(t))zi(t)|p]2p1{E[|I(i)kΔΔδi(t)f(z0(s),,z(s))ds|p]+E[|I(i)kΔΔδi(t)g(z0(s),,z(s))dB(s)|p]}2p1Kp/2(+2)p/21((ρΔ)p1+(ρΔ)p/21{p(p1)2}p/2){1+C4(+1)}ρΔ.

    (Ⅲ) Case in which I(i)kΔΔ0δi(t):

    As δi(t)δi(t)I(i)kΔΔ(ρ+1)Δ, Lemma 5.2, and (P) (ⅱ) imply that

    E[|y(δi(t))zi(t)|p]2p1{E[|y(δi(t))ξ(0)|p]+E[|ξ(0)ξ(I(i)kΔΔ)|p]}2p1{2p1Kp/2(+2)p/21(δi(t)p1+δi(t)p/21{p(p1)2}p/2){1+C4(+1)}δi(t)+K1(I(i)kΔΔ)γ}2p1{2p1Kp/2(+2)p/21((ρ+1)p1Δpγ+(ρ+1)p/21Δp/2γ{p(p1)2}p/2){1+C4(+1)}(ρ+1)+K1(ρ+1)γ}Δγ.

    (Ⅳ) Case in which δi(t)0I(i)kΔΔ:

    As I(i)kΔΔI(i)kΔΔδi(t)δi(kΔ)δi(t)ρΔ, in the same manner as that in case (Ⅲ) we obtain

    E[|y(δi(t))zi(t)|p]2p1{E[|y(δi(t))ξ(0)|p]+E[|ξ(0)ξ(I(i)kΔΔ)|p]}2p1{K1ργ+2p1Kp/2(+2)p/21((ρ+1)p1Δpγ+(ρ+1)p/21Δp/2γ{p(p1)2}p/2){1+C4(+1)}ρ}Δγ.

    (Ⅴ) Cases in which I(i)kΔΔδi(t)0 or δi(t)I(i)kΔΔ0:

    As |δi(t)I(i)kΔΔ|(ρ+1)Δ,

    E[|y(δi(t))zi(t)|p]E[|ξ(δi(t))ξ(I(i)kΔΔ)|p]K1|δi(t)I(i)kΔΔ|γK1(ρ+1)γΔγ.  (5.8)

    Following Lemma 5.3, we set

    C2:=maxi=1,,Ci2. (5.9)

    Proof of Theorem 2.1. For any t1T,

    E[sup0tt1|X(t)y(t)|p]=E[sup0tt1|t0{f(X(s),,X(δ(s)))f(z0(s),,z(s))}ds+t0{g(X(s),,X(δ(s)))g(z0(s),,z(s))}dB(s)|p]2p1E[sup0tt1|t0{f(X(s),,X(δl(s)))f(z0(s),,z(s))}ds|p]+2p1E[sup0tt1|t0{g(X(s),,X(δ(s)))g(z0(s),,z(s))}dB(s)|p]=:2p1(I4+I5). (5.10)

    Using Hölder's inequality, for any t1T we have

    I4Tp1E[|t10{f(X(s),,X(δ(s)))f(z0(s),,z(s))}2ds|p/2]. (5.11)

    Using Burkholder–Davis–Gundy's inequality, for any tiT we have

    I5Tp1cpE[|t10{g(X(s),,X(δ(s)))g(z0(s),,z(s))}2ds|p/2], (5.12)

    where cp=pp(p+1)/22p/2(p1)p(p1)/2. The inequalities (5.11) and (5.12), and the assumption (H) imply that

    (the right-hand side of (5.10))2p1Kp/22Tp1(1+cp)(+2)p/21E[t10{|X(s)z0(s)|p+i=1|X(δi(s))zi(s)|p}ds]22(p1)Kp/22Tp1(1+cp)(+2)p/21{E[t10{|X(s)y(s)|p+i=1|X(δi(s))y(δi(s))|p}ds]+E[t10{|y(s)z0(s)|p+i=1|y(δi(s))zi(s)|p}ds]}4p1Kp/22Tp1(1+cp)(+2)p/21{(+1)t10E[sup0rs|X(r)y(r)|p]ds+T(E[sup0sT|y(s)z0(s)|p]+i=1E[sup0sT|y(δi(s))zi(s)|p])}. (5.13)

    Lemma 5.2, Lemma 5.3 and Gronwall's lemma imply that

    (the right-hand side of (5.13))4p1Kp/22Tp1(1+cp)(+2)p/21{(+1)t10E[sup0rs|X(r)y(r)|2]ds+T(C1Δ+C2Δγ)}4p1Kp/22Tp(1+cp)(+2)p/21(C1Δ+C2Δγ)exp[4p1Kp/22Tp(1+cp)(+2)p/21(+1)]4p1Kp/22Tp(1+cp)(+2)p/21(C1+C2)exp[4p1Kp/22Tp(1+cp)(+2)p/21(+1)]Δγ. 

    We prove Corollary 3.1 in the following steps:

    1st step (corresponding to Lemma 5.1)

    For the case τt0, we obtain that E[|˜y(t)|2]K0.

    For the case 0tT, we obtain that

    E[|˜y(t)|2]=E[|ξ(0)+t0g(z0(s),z1(s),,zl(s))dB(s)|2]2{E[|ξ(0)|2]+E[t0|g(z0(s),z1(s),,zl(s)|2dB(s)]}.

    This inequality and Gronwall's lemma imply that

    supτtTE[|˜y(t)|2]2(K0+KT)e2KT(+1)=˜C3. (5.14)

    2nd step (corresponding to Lemma 5.2)

    We consider the approximate solution of SDDE (2.10) with f0 and use the same notation zi(t),i=0,1,, in (2.11) in the following step. We obtain

    E[|˜y(t)z0(t)|2]E[|tkΔg(z0(s),z1(s),,zl(s))dB(s)|2]KE[tkΔ{1+|z0(s)|p++|z(s)|p}ds]K{1+˜C3(+1)}Δ=˜C1Δ. (5.15)

    3rd step (corresponding to Lemma 5.3)

    In the fifth case in (3.4), we can show that the constant ˜Ci2 coincides with Ci2 by using the inequality (5.8) with p=2.

    We next provide the proof for the third case in (3.4). As δi(t)δi(t)I(i)kΔΔ(ρ+1)Δ, we have

    E[|˜y(δi(t))zi(t)|2]2{E[|˜y(δi(t))ξ(0)|2]+E[|ξ(0)ξ(I(i)kΔΔ)|2]}=:2{I6+I7}. (5.16)

    Using the estimation (5.15) with t=0, we have

    I6˜C1(ρ+1)Δ. (5.17)

    Using the estimate (5.8), we have

    I7K1(ρ+1)γΔγ. (5.18)

    Then, (5.17) and (5.18) imply that

    (Right-hand side of (5.16))2{˜C1(ρ+1)+K1(ρ+1)γ}Δγ.

    For the other three cases in (3.4), proofs are given in the same manner as those for showing the cases (Ⅰ), (Ⅱ) and (Ⅳ) in the proof of Lemma 5.3.

    We set ˜C2 as (3.5). Then, for any t[0,T] we have

    E[|˜y(δi(t))zi(t)|2]˜C2Δγ. (5.19)

    4th step

    In the case of f0, we obtain that

    E[sup0tt1|˜X(t)˜y(t)|2]4E[t10|g(˜X(s),,˜X(δ(s)))g(z0(s),,z(s))|2ds]4K2E[t10(|˜X(s)z0(s)|2+i=1|˜X(δi(s))zi(s)|2)ds]8K2E[t10(|˜X(s)˜y(s)|2+i=1|˜X(δi(s))˜y(δi(t))|2)ds]+8K2E[t10(|˜y(s)z0(s)|2+i=1|˜y(δi(t))zi(s)|2)ds]=:8K2(I8+I9). (5.20)

    For I_8 , we have

    \begin{align} I_8 \leq & (\ell+1) \int_{0}^{t_1} E\left[ \sup\limits_{0 \leq r\leq s} \left| \widetilde{X}(r)-\widetilde{y}(s) \right|^2 \right]ds. \end{align} (5.21)

    Using (5.14) and (5.19), we have

    \begin{align} I_9 \leq & T \left\{ E \left[ \sup\limits_{0 \leq s\leq T} \left| \widetilde{y}(s)-z_{0}(s) \right|^2 \right] + \sum\limits_{i = 1}^{\ell} E \left[\sup\limits_{0 \leq s\leq T} \left| \widetilde{y}(\delta_{i}(t))-z_{i}(s) \right|^2 \right] \right\} \\ \leq & T \left( \widetilde{C}_1 \varDelta + \ell \widetilde{C}_2 \varDelta^{\gamma} \right). \end{align} (5.22)

    (5.21), (5.22) and Gronwall's lemma imply that

    \begin{align} & E \left[ \sup\limits_{0\leq t \leq T} |\widetilde{X}(t)-\widetilde{y}(t)|^2 \right] \leq 8K_{2}T \left( \widetilde{C}_1 + \ell \widetilde{C}_2 \right) e^{8K_2T(\ell+1)} \varDelta^{\gamma}. \end{align} (5.23)

    This inequality and Chebyshev's inequality imply (3.3).

    In this article, we consider the problem of Euler–Maruyama approximate solutions of SDEs with multiple delay functions. The main result of this article is Theorem 2.1. In the theorem, we obtain the rate of convergence of approximate solutions to the exact solutions. We have applied the results to obtain confidence interval estimations for the approximate solutions. This information improves the understanding of gaps between exact solutions of SDEs with multiple delays by applying stochastic analysis and numerical solutions through simulation studies.

    The authors thank Professor Yozo Tamura for his useful comments. They also thank Edanz (https://jp.edanz.com/ac) for editing a draft of this manuscript. This research was supported by JSPS KAKENHI Grant number 18K03324.

    All authors declare no conflicts of interest in this paper.



    [1] A. Ostrowski, Über die Absolutabweichung einer differentiierbaren Funktion von ihrem Integralmittelwert, Commentarii Mathematici Helvetici, 10 (1937), 226–227. http://dx.doi.org/10.1007/bf01214290 doi: 10.1007/bf01214290
    [2] D. S. Mitrinovíc, J. E. Pecaríc, A. M. Fink, Inequalities involving functions and their integrals and derivatives, 1 Eds., Springer Netherlands, 1991. http://dx.doi.org/10.1007/978-94-011-3562-7
    [3] M. Bohner, T. Matthews, Ostrowski inequalities on time scales, Journal of Inequalities in Pure and Applied Mathematics, 9 (2008), 6.
    [4] H. Hudzik, L. Maligranda, Some remarks on s-convex functions, Aeq. Math., 48 (1994), 100–111. http://dx.doi.org/10.1007/BF01837981 doi: 10.1007/BF01837981
    [5] N. Mehreen, M. Anwar, Hermite–Hadamard type inequalities for exponentially p-convex functions and exponentially s-convex functions in the secondsense with applications, J. Inequal. Appl., 2019 (2019), 92. http://dx.doi.org/10.1186/s13660-019-2047-1 doi: 10.1186/s13660-019-2047-1
    [6] M. Bohner, A. Peterson, Dynamic equations on time scales, 1 Eds., Boston, M A: Birkhäuser Boston Inc., 2001. http://dx.doi.org/10.1007/978-1-4612-0201-1
    [7] M. Alomari, q-Bernoulli inequality, Turkish Journal of Science, 3 (2018), 32–39.
    [8] A. Ekinci, Inequalities for convex functions on time scales, TWMS J. App. Eng. Math., 9 (2019), 64–72.
    [9] A. A. El-Deeb, S. Rashid, On some new double dynamic inequalities associated with Leibniz integral rule on time scales, Adv. Differ. Equ., 2021 (2021), 125. http://dx.doi.org/10.1186/s13662-021-03282-3 doi: 10.1186/s13662-021-03282-3
    [10] M. Z. Sarıkaya, New weighted Ostrowski and Chebyshev type inequalities on time scales, Comput. Math. Appl., 60 (2010), 1510–1514. http://dx.doi.org/10.1016/j.camwa.2010.06.033 doi: 10.1016/j.camwa.2010.06.033
    [11] U. M. Ozkan, M. Z. Sarıkaya, H. Yıldırım, Extensions of certain integral inequalities on time scales, Appl. Math. Lett., 21 (2008), 993–1000. http://dx.doi.org/10.1016/j.aml.2007.06.008 doi: 10.1016/j.aml.2007.06.008
    [12] M. E. Ozdemir, New refinements of Hadamard integral inequality via k-fractional integrals for p-convex function, Turkish Journal of Science, 6 (2021), 1–5.
    [13] S. Rashid, M. A. Noor, K. I. Noor, F. Safdar, Y. M. Chu, Hermite-Hadamard type inequalities for the class of convex functions on time scale, Mathematics, 7 (2019), 956. http://dx.doi.org/10.3390/math7100956 doi: 10.3390/math7100956
    [14] J. M. Shen, S. Rashid, M. A. Noor, R. Ashraf, Y. M. Chu, Certain novel estimates within fractional calculus theory on time scales, AIMS Mathemaics, 5 (2020), 6073–6086. http://dx.doi.org/10.3934/math.2020390 doi: 10.3934/math.2020390
    [15] S. I. Butt, M. Nadeem, G. Farid, On Caputo fractional derivatives via exponential s-convex functions, Turkish Journal of Science, 5 (2020), 140–146.
    [16] N. Mahreen, M. Anwar, Ostrowski type inequalities via some exponen-tially convex functions with applications, AIMS Mathematics, 5 (2020), 1476–1483. http://dx.doi.org/10.3934/math.2020101 doi: 10.3934/math.2020101
    [17] M. Alomari, M. Darus, S. S. Dragomir, P. Cerone, Ostrowski type inequalities for functions whose derivatives are s-convex in the second sense, Appl. Math. Lett., 23 (2010), 1071–1076. http://dx.doi.org/10.1016/j.aml.2010.04.038 doi: 10.1016/j.aml.2010.04.038
  • This article has been cited by:

    1. Issam Aboutaib, Janusz Brzdęk, Lahbib Oubbi, Barrelled Weakly Köthe–Orlicz Summable Sequence Spaces, 2023, 12, 2227-7390, 88, 10.3390/math12010088
  • Reader Comments
  • © 2022 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Metrics

Article views(2193) PDF downloads(80) Cited by(2)

Other Articles By Authors

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog