Abstract
We study a random particle method for solving the reaction-diffusion equation u t = Ξ½ u x x + f ( u ) {u_t} = u {u_{xx}} + f(u) which is a one-dimensional analogue of the random vortex method. It is a fractional step method in which u t = Ξ½ u x x {u_t} = u {u_{xx}} is solved by random walking the particles while u t = f ( u ) {u_t} = f(u) is solved with a numerical ordinary differential equation solver such as Eulerβs method. We prove that the method converges when f ( u ) = u ( 1 β u ) f(u) = u(1 - u) , i.e. the Kolmogorov equation, and that when the time step Ξ t \Delta t is O ( N 4 β 1 ) O({\sqrt [4]{N}^{ - 1}}) the rate of convergence is like ln β‘ N β N 4 β 1 \ln N \cdot \,{\sqrt [4]{N}^{ - 1}} where N denotes the number of particles. Furthermore, we show that this rate of convergence is uniform as the diffusion coefficient Ξ½ u tends to 0. Thus, travelling waves with arbitrarily steep wavefronts may be modeled without an increase in the computational cost. We also present the results of numerical experiments including the use of second-order time discretization and second-order operator splitting and use these results to estimate the expected value and standard deviation of the error.
Cite
CITATION STYLE
Puckett, E. G. (1989). Convergence of a random particle method to solutions of the Kolmogorov equation π’_{π‘}=ππ’ββ+π’(1-π’). Mathematics of Computation, 52(186), 615β645. https://doi.org/10.1090/s0025-5718-1989-0964006-x
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.