Jump to content

Science:Math Exam Resources/Courses/MATH307/December 2010/Question 05 (b)/Solution 1

From UBC Wiki

First, we notice that the recursion relation Xn+1 = AXn implies that

Xn+1=AXn=A(AXn1)=A(A(AX2))==An+1X0

Since A is a 3×3 matrix with three distinct eigenvalues λ1 = 1.83929, λ2 = -0.41964 + 0.60629i, λ3 = -0.41964 + 0.60629i there is a basis of corresponding eigenvectors v1, v2, v3. Let us rewrite X0 with respect to this basis:

X0=αv1+βv2+γv3

Then

Xn+1=An+1X0=An+1(αv1+βv2+γv3)=αAn+1v1+βAn+1v2+γAn+1v3=αλ1n+1v1+βλ2n+1v2+γλ3n+1v3

Now we see that the last two terms will vanish as n goes to infinity, because |λ2|<1 and |λ3|<1. However, since |λ1|>1 the norm of the first vector will blow up as n approaches infinity, unless α = 0.

This is the key to this question: As long as the vector with the initial conditions, X0=[cba] lies in the plane that is spanned by v2 and v3 but has no component in direction of v1, then the sequence will converge to zero: xn → 0 as n → ∞. Eigenvectors v2 and v3 can be obtained in MATLAB/Octave with

   [V,D] = eig(A);  % V is a matrix with eigenvectors in its columns
   v_2 = V[:,2];
   v_3 = V[:,3];

Then the initial values that imply xn → 0 as n → ∞ are

{[cba] such that [cba]=sv2+tv3 for some s,t}