Back to Search
Start Over
Pathwise convergence rates for numerical solutions of Markovian switching stochastic differential equations
- Source :
-
Nonlinear Analysis: Real World Applications . Jun2012, Vol. 13 Issue 3, p1170-1185. 16p. - Publication Year :
- 2012
-
Abstract
- Abstract: This work develops numerical approximation algorithms for solutions of stochastic differential equations with Markovian switching. The existing numerical algorithms all use a discrete-time Markov chain for the approximation of the continuous-time Markov chain. In contrast, we generate the continuous-time Markov chain directly, and then use its skeleton process in the approximation algorithm. Focusing on weak approximation, we take a re-embedding approach, and define the approximation and the solution to the switching stochastic differential equation on the same space. In our approximation, we use a sequence of independent and identically distributed (i.i.d.) random variables in lieu of the common practice of using Brownian increments. By virtue of the strong invariance principle, we ascertain rates of convergence in the pathwise sense for the weak approximation scheme. [Copyright &y& Elsevier]
Details
- Language :
- English
- ISSN :
- 14681218
- Volume :
- 13
- Issue :
- 3
- Database :
- Academic Search Index
- Journal :
- Nonlinear Analysis: Real World Applications
- Publication Type :
- Academic Journal
- Accession number :
- 70158049
- Full Text :
- https://doi.org/10.1016/j.nonrwa.2011.09.012