A new algorithm for numerical simulation of Langevin equations
Abstract
Formulated is a new systematic method for obtaining higher order corrections in numerical simulation of stochastic differential equations (SDEs), i.e., Langevin equations. Random walk step algorithms within a given order of finite , are obtained so as to reproduce within that order a corresponding transition density of the Fokker-Planck equations, in the weak Taylor approximation scheme. A great advantage of our method is its straightforwardness such that direct perturbative calculations produce the algorithm as an end result, so that the procedure is tractable by computer. Examples in general form for curved space cases as well as flat space cases are given in some order of approximations. Simulations are performed for specific examples of U(1) system and SU(2) systems, respectively.
Cite
@article{arxiv.hep-lat/9610017,
title = {A new algorithm for numerical simulation of Langevin equations},
author = {H. Nakajima and S. Furui},
journal= {arXiv preprint arXiv:hep-lat/9610017},
year = {2009}
}
Comments
4 pages,latex,2 figures(GNU plot).Presented at LATTICE96(algorithms), the International Symposium on Lattice Field Theory, 4 - 8 June 1996, in St. Louis, Missouri, USA