Convergence of a random particle method to solutions of the Kolmogorov equation 𝑒_{𝑑}=πœˆπ‘’β‚“β‚“+𝑒(1-𝑒)

  • Puckett E
N/ACitations
Citations of this article
7Readers
Mendeley users who have this article in their library.

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

APA

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.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free