Michael V. Tretyakov
University of Leicester
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Michael V. Tretyakov.
Archive | 2004
G. N. Milʹshteĭn; Michael V. Tretyakov
1 Mean-square approximation for stochastic differential equations.- 2 Weak approximation for stochastic differential equations.- 3 Numerical methods for SDEs with small noise.- 4 Stochastic Hamiltonian systems and Langevin-type equations.- 5 Simulation of space and space-time bounded diffusions.- 6 Random walks for linear boundary value problems.- 7 Probabilistic approach to numerical solution of the Cauchy problem for nonlinear parabolic equations.- 8 Numerical solution of the nonlinear Dirichlet and Neumann problems based on the probabilistic approach.- 9 Application of stochastic numerics to models with stochastic resonance and to Brownian ratchets.- A Appendix: Practical guidance to implementation of the stochastic numerical methods.- A.1 Mean-square methods.- A.2 Weak methods and the Monte Carlo technique.- A.3 Algorithms for bounded diffusions.- A.4 Random walks for linear boundary value problems.- A.5 Nonlinear PDEs.- A.6 Miscellaneous.- References.
SIAM Journal on Numerical Analysis | 2002
Grigori N. Milstein; Yu. M. Repin; Michael V. Tretyakov
Stochastic Hamiltonian systems with multiplicative noise, phase flows of which preserve symplectic structure, are considered. To construct symplectic methods for such systems, sufficiently general fully implicit schemes, i.e., schemes with implicitness both in deterministic and stochastic terms, are needed. A new class of fully implicit methods for stochastic systems is proposed. Increments of Wiener processes in these fully implicit schemes are substituted by some truncated random variables. A number of symplectic integrators is constructed. Special attention is paid to systems with separable Hamiltonians. Some results of numerical experiments are presented. They demonstrate superiority of the proposed symplectic methods over very long times in comparison with nonsymplectic ones.
SIAM Journal on Numerical Analysis | 2001
Grigori N. Milstein; Yu. M. Repin; Michael V. Tretyakov
Hamiltonian systems with additive noise possess the property of preserving symplectic structure. Numerical methods with the same property are constructed for such systems. Special attention is paid to systems with separable Hamiltonians and to second-order differential equations with additive noise. Some numerical tests are presented.
SIAM Journal on Numerical Analysis | 2005
Grigori N. Milstein; Michael V. Tretyakov
We propose a new concept which allows us to apply any numerical method of weak approximation to a very broad class of stochastic differential equations (SDEs) with nonglobally Lipschitz coefficients. Following this concept, we discard the approximate trajectories which leave a sufficiently large sphere. We prove that accuracy of any method of weak order p is estimated by
SIAM Journal on Numerical Analysis | 2013
Michael V. Tretyakov; Zhongqiang Zhang
\varepsilon +O(h^{p}),
SIAM Journal on Scientific Computing | 2006
Grigori N. Milstein; Michael V. Tretyakov
where
Nucleic Acids Research | 2012
Christopher D. Bayliss; Fadil A. Bidmos; Awais Anjum; Vladimir T. Manchev; Rebecca L . Richards; Jean-Philippe Grossier; Karl G. Wooldridge; Julian M. Ketley; Paul A. Barrow; Michael Jones; Michael V. Tretyakov
\varepsilon
SIAM Journal on Numerical Analysis | 2010
Jonathan C. Mattingly; Andrew M. Stuart; Michael V. Tretyakov
can be made arbitrarily small with increasing radius of the sphere. The results obtained are supported by numerical experiments.
web science | 1997
Grigori N. Milstein; Michael V. Tretyakov
A version of the fundamental mean-square convergence theorem is proved for stochastic differential equations (SDEs) in which coefficients are allowed to grow polynomially at infinity and which satisfy a one-sided Lipschitz condition. The theorem is illustrated on a number of particular numerical methods, including a special balanced scheme and fully implicit methods. The proposed special balanced scheme is explicit and its mean-square order of convergence is 1/2. Some numerical tests are presented.
web science | 1997
Grigori N. Milstein; Michael V. Tretyakov
Efficient numerical algorithms are proposed for a class of forward-backward stochastic differential equations (FBSDEs) connected with semilinear parabolic partial differential equations. As in [J. Douglas, Jr., J. Ma, and P. Protter, Ann. Appl. Probab., 6 (1996), pp. 940-968], the algorithms are based on the known four-step scheme for solving FBSDEs. The corresponding semilinear parabolic equation is solved by layer methods which are constructed by means of a probabilistic approach. The derivatives of the solution u of the semilinear equation are found by finite differences. The forward equation is simulated by mean-square methods of order 1/2 and 1. Corresponding convergence theorems are proved. Along with the algorithms for FBSDEs on a fixed finite time interval, we also construct algorithms for FBSDEs with random terminal time. The results obtained are supported by numerical experiments.