A quasi-random walk method for one-dimensional reaction–diffusion equations

S. Ogawa and C. Lécot

Mathematics and Computers in Simulation (MATCOM), 2003, vol. 62, issue 3, 487-494

Abstract: Probabilistic methods are presented to solve one-dimensional nonlinear reaction–diffusion equations. Computational particles are used to approximate the spatial derivative of the solution. The random walk principle is used to model the diffusion term. We investigate the effect of replacing pseudo-random numbers by quasi-random numbers in the random walk steps. This cannot be implemented in a straightforward fashion, because of correlations. If the particles are reordered according to their position at each time step, this has the effect of breaking correlations. For simple demonstration problems, the error is found to be significantly less when quasi-random sequences are used than when a standard random walk calculation is performed using pseudo-random points.

Keywords: Random walk; Reaction–diffusion equations; Kolmogorov equation; Nagumo’s equation (search for similar items in EconPapers)
Date: 2003
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378475402002434
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matcom:v:62:y:2003:i:3:p:487-494

DOI: 10.1016/S0378-4754(02)00243-4

Access Statistics for this article

Mathematics and Computers in Simulation (MATCOM) is currently edited by Robert Beauwens

More articles in Mathematics and Computers in Simulation (MATCOM) from Elsevier
Bibliographic data for series maintained by Catherine Liu ().