from discrete time random walks to numerical methods for

19
Never Stand Still Faculty of Science School of Mathematics and Statistics Dr. Christopher Angstmann SANUM 2016 From discrete time random walks to numerical methods for fractional order differential equations

Upload: others

Post on 19-Nov-2021

4 views

Category:

Documents


0 download

TRANSCRIPT

Page 1: From discrete time random walks to numerical methods for

Click to edit Present’s Name

Never Stand Still Faculty of Science School of Mathematics and Statistics

Dr. Christopher Angstmann SANUM 2016

From discrete time random walks to numerical methods for fractional order differential equations

Page 2: From discrete time random walks to numerical methods for

Collaborators

Everything Bruce Henry, UNSW

Fractional Fokker-Planck equation and reaction sub-diffusion Isaac Donnelly, and James Nichols, UNSW Byron Jacobs, University of the Witwatersrand

Fractional SIR models Anna McGann, UNSW

Page 3: From discrete time random walks to numerical methods for

References

C. N. Angstmann et al. A discrete time random walk model for anomalous diffusion, J. Comput. Phys. (2015), doi:10.1016/j.jcp.2014.08.003 C. N. Angstmann et al. From stochastic processes to numerical methods: A new scheme for solving reaction subdiffusion fractional partial differential equations J. Comput. Phys. (2016) doi:10.1016/j.jcp.2015.11.053 C. N. Angstmann et al. A fractional order recovery SIR model from a stochastic process. Bulletin of Mathematical Biology, (2016) doi:10.1007/s11538-016-0151-7

Page 4: From discrete time random walks to numerical methods for

The Idea

Consider a particle that is undergoing a random walk. At every point in time we have a probability distribution for the location of the particle. This probability distribution evolves in time according to a governing equation.

Page 5: From discrete time random walks to numerical methods for

The Idea

For a discrete time system the governing equation is a difference equation. For a continuous time system the governing equation is a differential equation. If we construct a sequence of discrete time random walks that tend towards a continuous time random walk, then we will also have a sequence of difference equations that tend to the differential equation.

Page 6: From discrete time random walks to numerical methods for

Advantages

As the approximation is always a governing equation for the random walk then we have some guarantees about its behavior. •  In the absence of reactions we know that the particle is not created

nor destroyed, so the scheme must conserve mass. •  The approximation is always a finite distance from the solution of the

differential equation. We can use the tools of stochastic processes on the numerical method.

Page 7: From discrete time random walks to numerical methods for

Example: A Biased Random Walk

The governing equation for finding the particle undergoing a biased random walk at position x, at time t is:

Taking the “diffusion” limit of this process gives a Fokker-Planck equation as the governing equation: Where

X(x, t) = pr(x��x, t��t)X(x��x, t��t) + pl(x+�x, t��t)X(x+�x, t��t)

D = lim�x,�t!0

�x

2

2�t

f(x, t) = lim�x!0

p

r

(x, t)� p

l

(x, t)

��x

@X(x, t)

@t

= D

@

2X(x, t)

@x

2� 2D�

@

@x

(f(x, t)X(x, t))

Page 8: From discrete time random walks to numerical methods for

Boltzmann weights

Boltzmann weights are taken for the jump probabilities. This guarantees that for all .

pr(x, t) =exp(��V (x+�x, t))

exp(��V (x+�x, t)) + exp(��V (x��x, t))

f(x, t) = �@V (x, t)

@x

0 < pr(x, t) < 1 �x

Page 9: From discrete time random walks to numerical methods for

Example: Burgers Equation

Burgers equation, can be approximated by u(x, t) =

u(x��x, t��t)

1 + exp(

�x

8⌫ (u(x� 2�x, t��t) + 2u(x��x, t��t) + u(x, t��t)))

+

u(x��x, t��t)

1 + exp(

�x

8⌫ (u(x� 2�x, t��t) + 2u(x��x, t��t) + u(x, t��t)))

@u(x, t)

@t

= ⌫

@

2u(x, t)

@x

2� u(x, t)

@u(x, t)

@x

Page 10: From discrete time random walks to numerical methods for

Example: Burgers Equation

Page 11: From discrete time random walks to numerical methods for

Fractional Fokker-Planck Equation

The fractional Fokker-Planck equation is Where is the Riemann-Liouville fractional derivative defined by This equation is typically derived from the limit of a Continuous Time Random Walk.

@u(x, t)

@t

= D

@

2

@x

2

�0D1�↵

t (u(x, t))�� 2D�

@

@x

�f(x, t) 0D1�↵

t (u(x, t))�

0D1�↵t (u(x, t))

0D1�↵t (u(x, t)) =

1

�(↵)

@

@t

Z t

0(t� v)↵�1

u(x, v) dv 0 < ↵ < 1

Page 12: From discrete time random walks to numerical methods for

Fractional Fokker-Planck Equation

To find approximations for a fractional Fokker-Planck equation we need to use a different discrete time random walk. We modify the random walk by letting the particle wait for a random number of time steps before jumping. This introduces a waiting time probability distribution, . By choosing an appropriate heavy tailed distribution the governing equations will limit to the fractional Fokker-Planck equation.

(n)

Page 13: From discrete time random walks to numerical methods for

Discrete Time Random Walk

For such a random walk the governing equation is, in general, Where K(n) is the memory kernel associated with the waiting time probability distribution. It is defined through it’s Z transform with

Where is the probability that the particle has not jumped by the n time step since arriving at the site.

u(x, n�t) =u(x, (n� 1)�t) + pr(x��x, (n� 1)�t)n�1X

m=0

K(n�m)u(x��x,m�t)

+ pl(x+�x, (n� 1)�t)n�1X

m=0

K(n�m)u(x+�x,m�t)�n�1X

m=0

K(n�m)u(x,m�t)

�(n)

Z{K(n)} =Z{ (n)}Z{�(n)}

Page 14: From discrete time random walks to numerical methods for

Sibuya Distribution

To limit to the fractional Fokker-Planck equation we take the Sibuya waiting time distribution, for and . This gives a tractable memory kernel

0 <α <1 n > 0

(n) = (�1)n+1 �(↵+ 1)

�(n+ 1)�(↵� n+ 1)�(n) =

nY

m=1

⇣1� ↵

m

Page 15: From discrete time random walks to numerical methods for

Example: Fractional Diffusion Equation

The simplest fractional example is the fractional diffusion equation, which just f(x,t)=0. Taking , and . With zero flux boundaries and the initial condition

∂ρ(x,t)∂t

= Dt1− 45 ∂

2ρ(x,t)∂x2

∂ρ(x,t)∂x x=0

= 0 ∂ρ(x,t)∂x x=1

= 0

α = 45 D = 1

ρ(x,0) = δ (x − 12 )

Page 16: From discrete time random walks to numerical methods for

Example: Fractional Diffusion Equation

0.0 0.2 0.4 0.6 0.8 1.0

0.995

1.000

1.005

1.010

1.015

x

XHx,2L

0.0 0.2 0.4 0.6 0.8 1.0

-0.002

0.000

0.002

0.004

x

0.10 1.000.500.20 0.300.15 1.500.70

0.005

0.010

0.050

0.100

0.500

1.000

t0.10 1.000.500.20 0.300.15 1.500.70

0.005

0.010

0.050

0.100

0.500

1.000

t

Page 17: From discrete time random walks to numerical methods for

Reaction sub-diffusion equations

Schemes for more complicated equations can also be found with this approach. For example the reaction sub-diffusion equation. The stochastic process used is slightly different in this case. We take an ensemble of randomly walking and reacting particles.

∂u(x,t)∂t

= D ∂2

∂x2exp −

0

t

∫ d(x,t ')dt '( )Dt1−α exp

0

t

∫ d(x,t ')dt '( )u(x,t)⎡⎣⎢

⎤⎦⎥

⎡⎣⎢

⎤⎦⎥− d(x,t)u(x,t)+ b(x,t)

Page 18: From discrete time random walks to numerical methods for

Non-linear morphogen death rates on semi-infinite domain

Page 19: From discrete time random walks to numerical methods for

References

C. N. Angstmann et al. A discrete time random walk model for anomalous diffusion, J. Comput. Phys. (2015) doi:10.1016/j.jcp.2014.08.003 C. N. Angstmann et al. From stochastic processes to numerical methods: A new scheme for solving reaction subdiffusion fractional partial differential equations J. Comput. Phys. (2016) doi:10.1016/j.jcp.2015.11.053 C. N. Angstmann et al. A fractional order recovery SIR model from a stochastic process. Bulletin of Mathematical Biology, (2016) doi:10.1007/s11538-016-0151-7