SLIDE 27 Numerical Schemes: Space and time approximations
Time Approximation: Semi-Discretization in Time (P)
= 0, ∀t > 0 u(0) = u0 Scheme 1. un+1−un
∆t
+ Aun = 0, (explicit) Euler method, Scheme 2. un+1−un
∆t
+ Aun+1 = 0, (implicit) Euler method, Scheme 3. un+1−un
∆t
+ A un+un+1
2
= 0, Crank-Nicolson method, Scheme 4. un+1 = r(∆tA)un, Runge-Kutta schemes,
Theorem
The operator A is mα-accretive, 0 ≤ α ≤ π
2 ,
r is an approximation of order p, and r is A(α)-acceptable. Then there exists a constants K such that ∀u0 ∈ D(Ap), the solution of scheme (4) satisfies ∀n ≥ 2, |u(tn) − un| ≤ K cosα ∆tp|Apu0| If in addition the rational fraction r is strongly A(α)-acceptable, we have for all u0 ∈ H, ∀n ≥ 2, |u(tn) − un| ≤ K ′ tp
n (cosα)p+1 ∆tp|u0|
Sarangam Majumdar (Dipartimento di Ingegneria e Scienze dell’Informazione e Matematica Universita’ degli Studi dell’Aquila) Mathematical model of talking bacteria 14 / 36