Consider the advection equation ut=ux on the unit interval x∈[0,1] and t⩾0, where u=u(x,t), subject to the initial condition u(x,0)=φ(x) and the boundary condition u(1,t)=0, where φ is a given smooth function on [0,1].
(i) We commence by discretising the advection equation above with finite differences on the equidistant space-time grid {(mΔx,nΔt),m=0,…,M+1,n=0,…,T} with Δx=1/(M+1) and Δt>0. We obtain an equation for umn≈u(mΔx,nΔt) that reads
umn+1=umn+21μ(um+1n−um−1n),m=1,…,M,n∈Z+
with the condition u0n=0 for all n∈Z+and μ=Δt/Δx.
What is the order of approximation (that is, the order of the local error) in space and time of the above discrete solution to the exact solution of the advection equation? Write the scheme in matrix form and deduce for which choices of μ this approximation converges to the exact solution. State (without proof) any theorems you use. [You may use the fact that for a tridiagonal M×M matrix
⎝⎜⎜⎜⎛α−β00β⋱⋱00⋱⋱−β00βα⎠⎟⎟⎟⎞
the eigenvalues are given by λℓ=α+2iβcosM+1ℓπ.]
(ii) How does the order change when we replace the central difference approximation of the first derivative in space by forward differences, that is um+1n−umn instead of (um+1n−um−1n)/2? For which choices of μ is this new scheme convergent?
(iii) Instead of the approximation in (i) we consider the following method for numerically solving the advection equation,
umn+1=μ(um+1n−um−1n)+umn−1
where we additionally assume that um1 is given. What is the order of this method for a fixed μ ?