Convergence Rates for Adaptive Weak Approximation of Stochastic Differential Equations

From MaRDI portal





Two adaptive algorithms are presented for obtaining approximations of moments of the solution of a system of Itô stochastic differential equations by using Monte Carlo simulation combined with the Euler method. The main distinction between the algorithms is that one uses deterministic time steps while the other uses stochastic time steps. Theorems on the stopping criteria, accuracy, efficiency, and convergence of these algorithms are proved. Numerical experiments are discussed which indicate the strengths of each algorithm with respect to the other and with respect to algorithms using uniform time steps.




Cited in
(24)








This page was built for publication: Convergence Rates for Adaptive Weak Approximation of Stochastic Differential Equations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5316801)