Abstract
In this article, an operational matrix method based on shifted Vieta–Fibonacci polynomials is utilised to find the numerical solution of fractional order stochastic integro-differential equations. In this method, the operational matrices are developed by using the shifted Vieta–Fibonacci polynomials for the fractional order Caputo differential operator in order to solve the present concerned problem. Using Newton cotes nodes as collocation points, operational matrices are employed to convert the above-mentioned equation into a system of linear algebraic equations. The coherent procedure for the appropriate numerical technique is described in this article. Additionally, the convergence analysis and error bound of the suggested method are well established. In order to illustrate the effectiveness, consistency, plausibility, and reliability of the proposed technique, three numerical examples are given. Moreover, the results obtained by the proposed method have been compared with those obtained by the Chelyshkov operational matrix method.
Similar content being viewed by others
Avoid common mistakes on your manuscript.
1 Introduction
It is generally known that fractional derivatives may characterise the memory and heredity properties of certain materials and processes in ways that integer order derivatives can not. Recently, many applications across a wide range of fields, including viscoelastic materials (Meral et al. 2010), signal processing (Machado and Lopes 2015), meteorology, earthquake (El-Misiery and Ahmed 2006), optimal control (Sahu and Saha Ray 2018), fluid-dynamic (Momani and Odibat 2006), quantum mechanics (Atman and Şirin 2020), finance (Scalas et al. 2000) and in other fields of science and engineering (Sun et al. 2018) have been remodeled using fractional calculus. Integro-differential equations have a strong physical foundation and are widely used in fields of study including polymer rheology (Lodge et al. 1978) and population model (Yzbaı et al. 2013). Deterministic fractional equations such as fractional order pantograph Volterra delay-integro-differential equations (Behera and Saha Ray 2022), Riemann–Liouville fractional integro-differential equations (Ahmad and Nieto 2011), fractional integro-differential equations (Arikoglu and Ozkol 2009) are used to represent real physical problems, which often rely on a noise source that is disregarded owing to the absence of sophisticated computational tools. As computational power has increased recently, real world phenomena can now be more effectively modeled using stochastic fractional equations such as stochastic fractional differential equations, stochastic fractional integral equations, stochastic fractional integro-differential equations (SFIDE).
This article investigates the numerical solution of the following SFIDE:
where \(\lambda _{1}\) and \(\lambda _{2}\) are constant numbers and \(^CD^{\alpha }_{\eta }\) is the Caputo fractional differential operator of order \(0<\alpha <1\). In Eq. (1.1), \(g(\eta )\) and \(\kappa _i (\eta , \zeta )\) for \(i=1,2\) are known smooth functions, and \(z(\eta )\) is an unknown function. Brownian motion process is defined as \(B=\{B(t);t\ge 0\}\) and \(z(\eta )\) is a stochastic process defined on the probability space \((\Omega , {\mathcal {F}}, {\mathbb {P}})\). This is referred to as the solution of SFIDE.
There are several numerical methods to solve SFIDE, such as block pulse approximation (Mirzaee et al. 2019), cubic B spline approximation (Mirzaee and Alipour 2020), meshless discrete collocation method based on radial basis functions (Mirzaee and Samadyar 2019), shifted Legendre spectral collocation method (Taheri et al. 2017), Bernstein polynomials approximation (Mirzaee and Samadyar 2017), Galerkin method (Kamrani 2016), explicit finite difference method (Saha Ray and Patra 2013) and different other methods that have been implemented to solve SFIDE.
The main motivation of this study is to solve the SFIDE (Eq. (1.1)) using shifted Vieta–Fibonacci polynomials. These kinds of equations may be found in many different fields, including physics, biology, physiology, optics, and climatology. Explicitly solving SFIDE can be difficult and time-consuming. So, here, the operational matrix method is implemented to solve these equations. Using shifted Vieta–Fibonacci polynomials, a new stochastic operational matrix has been derived for the first time in this paper. The proposed method is effective, applicable, and consistent.
In this study, the numerical results of Eq. (1.1) obtained by the shifted Vieta–Fibonacci operational matrix (SVFOM) method are further compared with the orthonormal Chelyshkov operational matrix (OCOM) method and actual solutions. Equation (1.1) can be transformed into a system of algebraic equations by using operational matrices along with suitable collocation points. The resultant equations can be easily solved to get the desired approximate solution.
This article is organised as follows:
A few fundamental concepts about shifted Vieta–Fibonacci polynomials (SVFPs), stochastic calculus, and fractional calculus have been introduced in Sect. 2. In Sect. 3, operational matrices (OMs) for product, integral, fractional, and stochastic integrals have been constructed using shifted Vieta–Fibonacci polynomial. The SFIDE problem is handled using the suggested operational matrix approach in Sect. 4, which also provides a review of the collocation technique. In Sect. 5, theorems relating to error estimation and convergence analysis are covered. Section 6 represents the reliability and efficiency of the suggested numerical method using a few illustrative examples, and a brief overview is provided in Sect. 7.
2 Preliminaries
This section covers the properties of SVFPs as well as some fundamental stochastic calculus concepts.
2.1 Stochastic calculus
Definition 1
(Itô Integral (Øksendal 2003)) Let \({\mathcal {V}} = {\mathcal {V}}(U,V)\) be the class functions \(g(\gamma ,\delta ): [0,\infty ) \times \Omega \rightarrow {\mathbb {R}}\) and \(g \in {\mathcal {V}}(U,V)\). Thus, the definition of the Itô integral of g is given by
where \(\psi _{m}\) is a sequence of elementary functions such that
Theorem 2.1.1
(The Itô isometry (Øksendal 2003)). Let \(g \in {\mathcal {V}}(U,V)\), be elementary and bounded functions. Then
2.2 Fractional calculus
Definition 2
Consider \(p-1<\alpha <p, \alpha>0, \eta >0, \alpha , \eta \in {\mathbb {R}}\), then the Caputo fractional differential operator \(^CD^{\alpha }_{\eta } z(\eta )\) of order \(\alpha \) is defined as (Saha Ray 2015)
Also, the Riemann–Liouville (RL) fractional integral operator \(J^{\alpha }_{\eta }\) of order \(\alpha \) is defined as
The operators \( ^CD^{\alpha }_{\eta }\) and \(J^{\alpha }_{\eta }\) has the following characteristics:
-
1.
\(J^{\alpha }_{\eta }(\delta _1 z(\eta )+\delta _2 z(\eta ))=\delta _1 J^{\alpha }_{\eta }(z(\eta ))+\delta _2 J^{\alpha }_{\eta }(z(\eta )), \quad \alpha \ge 0\).
-
2.
\(J^{\beta _1}_{\eta }J^{\beta _2}_{\eta }z(\eta )=J^{\beta _1 + \beta _2 }_{\eta }z(\eta ), \quad \beta _1, \beta _2 \ge 0.\)
-
3.
\(^CD^{\alpha }_{\eta }J^{\alpha }_{\eta }z(\eta )=z(\eta ),\quad \alpha \ge 0\).
-
4.
\(J^{\alpha }_{\eta } ({^C}D^{\alpha }_{\eta }) z(\eta )=z(\eta )-\sum _{i=0}^{p-1} z^i(0)\frac{\eta ^i}{i!}, \quad p-1<\alpha <p, \quad p\in {\mathbb {N}}. \)
2.3 Shifted Vieta–Fibonacci polynomials and its characteristics
Many problems in mathematical physics have been solved using SVFPs, such as the Lane–Emden equation, reaction-advection–diffusion, Emden–Fowler equation, etc.
Vieta–Fibonacci polynomials
According to the following relation, the Vieta–Fibonacci polynomials \({{\mathcal {V}}}{{\mathcal {F}}}_{m}(\eta )\) of degree m in \(\eta \) are defined on the interval [− 2, 2].
where \(\eta = 2 \cos \theta \) and \(\theta \in [0, \pi ]\).
These polynomials can also be generated by the following recurrence relation:
with the initial values \({{\mathcal {V}}}{{\mathcal {F}}}_{0}(\eta )=0, {{\mathcal {V}}}{{\mathcal {F}}}_{1}(\eta )=1\).
Shifted Vieta–Fibonacci polynomials
Definition 5
The shifted Vieta–Fibonacci polynomials \({{\mathcal {V}}}{{\mathcal {F}}}_{m}^*(\eta )\), of degree m in \(\eta \) on [0, 1] are defined as follows (Sadri et al. 2022)
Also, these polynomials, can be generated via the following recurrence relation:
using the initial values \({{\mathcal {V}}}{{\mathcal {F}}}_{0}^*(\eta )=0, {{\mathcal {V}}}{{\mathcal {F}}}_{1}^*(\eta )=1\).
The SVFPs are also defined by using the following series:
These polynomials are orthogonal with respect to the weight function \( w(\eta ) = \sqrt{\eta -{\eta }^2}\), i.e.
2.4 Function approximation by SVFPs
Let \(H = L^{2}_{\omega }(I)\), \(I = [0,1]\), and S = span\(\{{{\mathcal {V}}}{{\mathcal {F}}} _{1}^*(\eta ), {{\mathcal {V}}}{{\mathcal {F}}} _{2}^*(\eta ),\ldots , {{\mathcal {V}}}{{\mathcal {F}}} _{m+1}^*(\eta )\}\). Then for any \(y(\eta ) \in H\), \(y_{m}(\eta ) \in S\) is a best approximation; that is
where \(A = [a_{1}, a_{2},\ldots ,a_{m+1}]^{T}\) and \( V_F^*(\eta ) = [{{\mathcal {V}}}{{\mathcal {F}}} _{1}^*(\eta ), {{\mathcal {V}}}{{\mathcal {F}}} _{2}^*(\eta ),\ldots , {{\mathcal {V}}}{{\mathcal {F}}} _{m+1}^*(\eta )]^T\). Furthermore,
In order to approximate the two-dimensional kernel function \(\kappa (\eta , \zeta )\), following approximation is used.
where \({\mathbb {K}}\) is a \((m+1)\times (m+1)\) order kernal matrix.
Here, the orthogonality property of the SVFPs, together with the weight function \(w(\eta )\) in Eq. (2.8), is used to generate the kernel matrix.
It follows
where
\(Q = \left\langle V_F^*(.),V_F^{*T}(.)\right\rangle _{w} \) .
The matrix form for these SVFPs is as follows:
where
2.4.1 \({\tilde{A}}\) matrix
Using Eq. (2.7)
\({\tilde{A}} = \begin{pmatrix} 1 &{}\quad 0 &{}\quad \dots &{}\quad 0 \\ \dfrac{(-1)^{1}\Gamma (2+1)}{\Gamma (2) \Gamma (2)} &{}\quad \dfrac{(-1)^{2-2}2^{2}\Gamma (2+2)}{\Gamma (2-1) \Gamma (2+2)} &{}\quad \dots &{}\quad 0 \\ \vdots &{}\quad \vdots &{}\quad \ddots &{}\quad \vdots \\ \dfrac{(-1)^{m}\Gamma (m+2)}{\Gamma (m+1) \Gamma (2)} &{}\quad \dfrac{(-1)^{m-1}2^{2}\Gamma (m+3)}{\Gamma (m) \Gamma (2+2)} &{}\quad \dots &{}\quad \dfrac{(-1)^{0}2^{2m}}{\Gamma (1) }\\ \end{pmatrix}_{(m+1)\times (m+1)}\),
where \({\tilde{A}}\) is lower triangular non singular matrix, hence \({\tilde{A}}^{-1}\) exists.
Therefore,
3 Operational matrix for SVFPs
To solve the SFIDE by operational matrix method, it is necessary to evaluate the following OMs:
3.1 Product operational matrix
The OM for the product is determined in this section.
where \({\hat{P}}\) is an OM of \((m+1)\times (m+1)\) order that is found by applying the orthogonality property of SVFPs with the weight function \(w(\eta )\).
3.2 Integral operational matrix
In terms of OM, the integration of vector \(V_F^*(\eta )\) can be described as follows:
where \({\tilde{P}}\) is an integral OM with a \((m+1)\times (m+1)\) dimension that can be found by utilising the orthogonality property of SVFPs with the weight function \(w(\eta )\).
Using Eq. (3.3), we obtain
3.3 Stochastic operational matrix
Here, the stochastic OM can be used to approximate the Itô integral of the vector \(V_F^*(\eta )\) as follows:
where \(H_s\) is a stochastic OM with a \((m+1)\times (m+1)\) dimension that can be found by utilising the orthogonality property of SVFPs with the weight function \(w(\eta )\).
From Eq. (3.5), we have
3.3.1 Calculation for \(H_{s}\) matrix
From Eq. (2.13)
Now,
Thus,
where,
The Simpson’s \(\dfrac{1}{3}\) rule is used to evaluate the integrals in Eq. (3.9), resulting in
Now, \(B\left( \dfrac{\eta }{2}\right) , B(\eta ) \) in Eq. (3.10) are approximated by B(0.25) and B(0.5), respectively.
Thus,
where
and \(L_{m}(\eta ) = [1, \eta ,\ldots , \eta ^m]_{(m+1)\times 1}^T\).
Using Eqs. (2.15) and (3.11), we get
Hence,
3.4 Fractional integral operational matrix
The OM for fractional integrals is discussed in this section.
where \(F^{\alpha }\) is a fractional OM with a \((m+1)\times (m+1)\) dimension that can be found by utilising the orthogonality property of SVFPs with the weight function \(w(\eta )\).
From Eq. (3.14), we obtain
where \(J^{\alpha }_{\eta }\) is defined in Eq. (2.5).
4 Numerical method
In the operational matrix technique, SVFPs are used to approximate each term in Eq. (1.1).
Let,
where \(A_1, A_2\), and \(A_3\) are vectors of order \((m+1)\times 1\), which can be defined in the following manner as in Eqs. (2.9) and (2.10).
By using the RL operator properties
then, applying Eq. (3.14) into Eq. (4.4),
by using Eq. (4.2) in Eq. (4.5)
where \(\Delta = A_2 + (F^{\alpha })^T A_1\) and \(F^{\alpha }\) is defined in Eq. (3.15).
Now, by substituting Eqs. (2.11), (4.1), (4.3), and (4.6) into Eq. (1.1), the following is obtained:
By using Eq. (3.1) in Eq. (4.7),
where \({\hat{\Delta }} = \left\langle V_F^*(\eta )V_F^{*T}(\eta )\Delta , V_F^{*T}(\eta ) \right\rangle _{w(\eta )} Q^{-1}.\)
By substituting Eqs. (3.3) and (3.5) in Eq. (4.8),
An algebraic system of equations is created by collocating Eq. (4.9) at the Newton cotes nodes provided by \(\eta _{r} = \dfrac{2r-1}{2(m+1)}, r = 1,2,\ldots ,m+1\). After solving this system of algebraic equations, the coefficient vector \(A_1\) is generated. Now, calculate \(\Delta ^T = A_2 ^T + A_1 ^TF^{\alpha }\). After that the final approximate solution by the SVFPs method is obtained by the equation \(z(\eta ) \simeq z_m(\eta )=\Delta ^T V_F^*(\eta )\).
5 Error bound and convergence analysis
5.1 Error bound
Theorem 5.1.1
(Agarwal et al. 2021) Suppose that \(z(\eta ) \in C^{m+1}[0,1]\) and \(z_m(\eta )\) be the approximate solution of \(z(\eta )\) defined in Eq. (4.6), then
where
Theorem 5.1.2
Let \(k(\eta ,\zeta )\) be the sufficiently smooth function in \(\Omega \) such that \(k(\eta ,\zeta ) \in L^{2}(\Omega )\cap C^{\infty }(\Omega )\), where \(\Omega \) = \(([0,L] \times [0,T])\). Suppose that \(k_{m,n}(\eta ,\zeta )\) is the best approximation to \(k(\eta ,\zeta )\) out of the linear span \(\Pi _{m,n }(\Omega )\). Now assume
then there exists \( {\mathcal {R}} > 0\) such that
where \({\mathcal {R}} = \max \{b_1,b_2, b_3\}\) and \({\mathcal {C}}= \int _0^L \int _0^T w(\eta )w(\zeta )d\eta d\zeta \).
According the concept of interpolation, which is similar as Saha Ray and Singh (2021), we obtain the following desired results.
Theorem 5.1.2
Let \(z_{m}(\eta ) = \Delta ^T V_F^*(\eta )\) be the approximate solution and \(z(\eta )\) be the exact solution of Eq. (1.1). Furthermore, suppose that if
-
1.
\(|z(\eta )| \le {\mathcal {M}}, \forall \eta \in [0,1]\),
-
2.
\(|\kappa _i (\eta ,\zeta )| \le {\mathcal {K}}_i, i=1,2, \forall (\eta ,\zeta ) \in [0,1] \times [0,1]\),
-
3.
\( \frac{4}{\Gamma ( \alpha ))^2}[\lambda ^2_1(2{\mathcal {K}}_1^2+4 {\mathcal {S}}_1^2(m))+\lambda ^2_2(2{\mathcal {K}}_2^2+4 {\mathcal {S}}_2^2(m))] < 1\).
Then,
and by the Theorems 5.1.1 and 5.1.2
where, \(g_m(\eta )\) and \(P_{(m,m)}[\kappa _i](\eta ,\zeta )\) are the approximate polynomials using SVFPs and
Proof
Let \(z_m(\eta )\) be the approximate solution of Eq. (1.1).
Let \(|z(\eta )-z_m(\eta )|\) be an error function, then by Eq. (1.1) and (5.5),
Now, applying the RL operator \((J^{\alpha }_{\eta })\) on both sides of the Eq. (5.6),
where \(J^{\alpha }_{\eta }\) is defined in Eq. (2.5).
By using the properties of \(J^{\alpha }_{\eta }\) which are given in Sect. 2.2, Eq. (5.7) can be written as
Using inequality \((c_1+c_2+c_3)^2\le 4(c_1^2+c_2^2+c_3^2)\), we obtain
Let Eq. (5.9) be written as
Now,
Since, \(0<\zeta <1\) and \(0< \alpha<1, 0<\zeta< \eta <1\). It implies \(0< \eta - \zeta< 1- \zeta <1\). Now, using the Cauchy–Schwarz inequality in Eq. (5.11), the following is obtained:
Again,
Since, \(\left| \eta -\gamma \right| \le 1\), then by using the Cauchy–Schwarz inequality
By changing the order of integration, the following is obtained:
Now,
Since, \(\left| \eta -\gamma \right| \le 1\), then by using the Cauchy–Schwarz inequality
Now, by using the Itô isometry property, following is obtained:
By changing the order of integration
Now, by substituting Eqs. (5.12), (5.15), (5.19) into Eq. (5.10)
Then,
\(\square \)
5.2 Convergence analysis
Theorem 5.2.1
Let \(z(\eta )\) and \(z_m(\eta )\) be the exact and approximate solutions of Eq. (1.1) respectively. And
-
1.
\(|z(\eta )| \le {\mathcal {M}}, \forall \eta \in [0,1]\),
-
2.
\(|\kappa _i (\eta ,\zeta )| \le {\mathcal {K}}_i, i=1,2, \forall (\eta ,\zeta ) \in [0,1] \times [0,1]\),
-
3.
\( \frac{4}{\Gamma ( \alpha ))^2}[\lambda ^2_1(2{\mathcal {K}}_1^2+4 {\mathcal {S}}_1^2(m))+\lambda ^2_2(2{\mathcal {K}}_2^2+4 {\mathcal {S}}_2^2(m))] < 1\).
Then \(z_m(\eta ) \rightarrow z(\eta )\) as \(m \rightarrow \infty \) in \(L^2\).
Proof
Consider the SFIDE as follows:
Using the same explanation as that used to prove the previous theorem, we can get to the following:
By using Eqs. (5.12), (5.15) and(5.18)
Since \(\eta \le 1\), then
Now,
Let,
Therefore,
Applying Grönwall inequality, we obtain
It implies
So, \(z_m(\eta )\) converges to \(z(\eta )\) as \(m \rightarrow \infty \) in \(L^2\). \(\square \)
6 Applications of the proposed method
Three examples are solved in this section using the proposed numerical approach that was described in the previous section.
Example 1
Consider the following fractional order stochastic integro-differential equation:
with the initial condition \(z(0)=0\). The exact solution of Eq. (6.1) is not available. If \(\alpha = 0.75\) and \(\lambda _2 =0\), the exact solution is \(z(\eta )=\eta ^3 \) and the approximate solution is obtained by the proposed SVFPs method. Table 1 represents the absolute error comparison between two methods based on the orthonormal Chelyshkov polynomials (OCPs) and SVFPs. For the numerical solution of Eq. (6.1) for various values of \(\alpha \) with \(m = 4\) and \(m = 6\), the proposed operational matrix collocation approach is employed. Newton cotes nodes have been selected from the collocation points. Tables 2 and 3 provide the comparison between numerical solutions obtained by the operational matrix method based on OCPs and SVFPs for the above problem for different values of m. The plot of SVFPs solutions for different values of \(\alpha \) with \(m=4\) and \(m=6\) are shown in Figs. 1 and 2, respectively.
Example 2
Consider the following fractional order stochastic integro-differential equation:
with the initial condition \(z(0)=0\). The exact solution of Eq. (6.2) is not known. For the numerical solution of Eq. (6.2) for different values of \(\alpha \), the proposed operational matrix collocation method is utilised. Newton cotes nodes have been selected from the collocation points. Tables 4 and 5 provide the numerical solutions comparison obtained by the operational matrix method based on OCPs and SVFPs for the above problem for different values of m. The plot of SVFPs solutions, for different values of \(\alpha \) with \(m=4\) and \(m=6\) are shown in Figs. 3 and 4, respectively.
Example 3
Consider the following fractional order stochastic integro-differential equation:
with the initial condition \(z(0)=0\). The exact solution of Eq. (6.3) is unknown. The proposed operational matrix collocation technique is used to solve Eq. (6.3) numerically for different values of \(\alpha \) with \(m = 4\) and \(m = 6\). From the collocation points, Newton cotes nodes have been chosen. With respect to the above-mentioned problem, Tables 6 and 7 compare the numerical solutions derived using the operational matrix technique based on OCPs and SVFPs for different values of m. The plot of SVFPs solutions for different values of \(\alpha \) with \(m=4\) and \(m=6\) are shown in Figs. 5 and 6, respectively.
7 Conclusion
The main objective of this work is to apply the operational matrix method to solve SFIDE. In this study, a novel stochastic operational matrix has been generated for the first time using shifted Vieta–Fibonacci polynomials. The SFIDE has been transformed into a system of algebraic equations. With the use of these operational matrices, the resultant algebraic system of equations is numerically solved by applying the collocation technique. The error bound and the convergence analysis of the proposed numerical technique have also been described. The precision and effectiveness of the suggested numerical technique are demonstrated using three different examples. The numerical experiments reveal that the proposed numerical scheme based on SVFPs and OCPs based numerical method have the best agreement of results. As a consequence, it is clear from the numerical experiment results that the proposed numerical approach is extremely effective, accurate, and reliable. In future, we have a plan to work on fractional stochastic integro-differential equations with the ABC fractional derivative.
Data Availability
This article includes all the data that were generated or analyzed during this research.
References
Agarwal P, El-Sayed AA, Tariboon J (2021) Vieta–Fibonacci operational matrices for spectral solutions of variable-order fractional integro-differential equations. J Comput Appl Math 382:113063
Ahmad B, Nieto JJ (2011) Riemann-Liouville fractional integro-differential equations with fractional nonlocal integral boundary conditions. Bound Value Probl 1:1–9
Arikoglu A, Ozkol I (2009) Solution of fractional integro-differential equations by using fractional differential transform method. Chaos Solitons Fractals 40(2):521–529
Atman KG, Şirin H (2020) Nonlocal phenomena in quantum mechanics with fractional calculus. Rep Math Phys 86(2):263–270
Behera S, Saha Ray S (2022) An efficient numerical method based on Euler wavelets for solving fractional order pantograph Volterra delay-integro-differential equations. J. Comput. Appl. Math. 406:113825
El-Misiery AEM, Ahmed E (2006) On a fractional model for earthquakes. Appl Math Comput 178(2):207–211
Kamrani M (2016) Convergence of Galerkin method for the solution of stochastic fractional integro differential equations. Optik 127(20):10049–10057
Lodge AS, McLeod JB, Nohel JA (1978) A nonlinear singularly perturbed Volterra integrodifferential equation occurring in polymer rheology. Proc R Soc Edinb Sect A Math 80(1–2):99–137
Machado JT, Lopes AM (2015) Analysis of natural and artificial phenomena using signal processing and fractional calculus. Fract Calc Appl Anal 18:459–478
Meral FC, Royston TJ, Magin R (2010) Fractional calculus in viscoelasticity: an experimental study. Commun Nonlinear Sci Numer Simul 15(4):939–945
Mirzaee F, Alipour S (2020) Cubic B-spline approximation for linear stochastic integro-differential equation of fractional order. J Comput Appl Math 366:112440
Mirzaee F, Samadyar N (2017) Application of orthonormal Bernstein polynomials to construct a efficient scheme for solving fractional stochastic integro-differential equation. Optik 132:262–273
Mirzaee F, Samadyar N (2019) On the numerical solution of fractional stochastic integro-differential equations via meshless discrete collocation method based on radial basis functions. Eng Anal Bound Elem 100:246–255
Mirzaee F, Alipour S, Samadyar N (2019) Numerical solution based on hybrid of block-pulse and parabolic functions for solving a system of nonlinear stochastic Itô-Volterra integral equations of fractional order. J Comput Appl Math 349:157–171
Momani S, Odibat Z (2006) Analytical approach to linear fractional partial differential equations arising in fluid mechanics. Phys Lett A 355(4–5):271–279
Øksendal B (2003) Stochastic differential equations. Springer, Berlin, pp 65–84
Sadri K, Hosseini K, Baleanu D, Salahshour S, Park C (2022) Designing a matrix collocation method for fractional delay integro-differential equations with weakly singular kernels based on Vieta–Fibonacci polynomials. Fractal Fract 6(1):2
Saha Ray S (2015) Fractional calculus with applications for nuclear reactor dynamics. CRC Press, Boca Raton
Saha Ray S, Patra A (2013) Numerical solution of fractional stochastic neutron point kinetic equation for nuclear reactor dynamics. Ann Nucl Energy 54:154–161
Saha Ray S, Singh P (2021) Numerical solution of stochastic Itô-Volterra integral equation by using Shifted Jacobi operational matrix method. Appl Math Comput 410:126440
Sahu PK, Saha Ray S (2018) Comparison on wavelets techniques for solving fractional optimal control problems. J Vib Control 24(6):1185–1201
Scalas E, Gorenflo R, Mainardi F (2000) Fractional calculus and continuous-time finance. Physica A Stat Mech Appl 284(1–4):376–384
Sun H, Zhang Y, Baleanu D, Chen W, Chen Y (2018) A new collection of real world applications of fractional calculus in science and engineering. Commun Nonlinear Sci Numer Simul 64:213–231
Taheri Z, Javadi S, Babolian E (2017) Numerical solution of stochastic fractional integro-differential equation by the spectral collocation method. J Comput Appl Math 321:336–347
Yzbaı S, Sezer M, Kemancı B (2013) Numerical solutions of integro-differential equations and application of a population model with an improved Legendre method. Appl Math Model 37(4):2086–2101
Acknowledgements
This research work was financially supported by NBHM, Mumbai, under Department of Atomic Energy, Government of India vide Grant Ref. no. 02011/4/2021 NBHM(R.P.)/R &D II/6975 dated 17/06/2021.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Vasily E. Tarasov.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Gupta, R., Saha Ray, S. A new effective coherent numerical technique based on shifted Vieta–Fibonacci polynomials for solving stochastic fractional integro-differential equation. Comp. Appl. Math. 42, 256 (2023). https://doi.org/10.1007/s40314-023-02398-4
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1007/s40314-023-02398-4
Keywords
- Fractional stochastic integro-differential equation
- Itô integral
- Brownian motion
- Vieta–Fibonacci polynomial
- Convergence analysis