(a) Give the definition of a normal matrix. Prove that if A is normal, then the (Euclidean) matrix ℓ2-norm of A is equal to its spectral radius, i.e., ∥A∥2=ρ(A).
Here, μ=hk is the Courant number, with k=Δt,h=Δx=M+11, and umn is an approximation to u(mh,nk).
Using the eigenvalue analysis and carefully justifying each step, determine conditions on μ>0 for which the method is stable. [Hint: All M ×M Toeplitz anti-symmetric tridiagonal (TAT) matrices have the same set of orthogonal eigenvectors, and a TAT matrix with the elements aj,j=a and aj,j+1=−aj,j−1=b has the eigenvalues λk=a+2ibcosM+1πk where i=−1. ]
(c) Consider the same advection equation for the Cauchy problem (x∈R,0⩽t⩽T). Now it is discretized by the two-step leapfrog scheme
umn+1=μ(um+1n−um−1n)+umn−1.
Applying the Fourier technique, find the range of μ>0 for which the method is stable.