Numerical approximation of the eigenvalues and the eigenvector

junsugal
Messages
6
Reaction score
0

Homework Statement



This problem will guide you through the steps to obtain a numerical approximation of the eigenvalues, and eigenvectors of A using an example.

We will define two sequences of vectors{vk} and {uk}
(a) Choose any vector u \in R2 as u0
(b) Once uk has been determined, the vectors vk+1 and uk+1 are determined as follows:
i. Set vk+1 = Auk
ii. Find the entry of maximum absolute value of vk+1 let's say it is the j-th entry of vk+1
iii. Set uk+1 = vk+1/vjk+1
(c) The sequence {Uk} will converge to an eigenvector for A.

Let A =
2 1
1 2
Use the above method to approximate an eigenvector for A using only 4 iterations, that is finding v5.
Find the eigenvectors for A using the method learned in class and compare.

Homework Equations





The Attempt at a Solution



I assume u0 is (1,1)
From A, i found the eigenvalues which is 3 and 1.
And the corresponding eigenvectors is (1,1) and (-1,1)
Then i get uk as (3k-1, 3k+1)

Now, to the next step, I get my vk+1 as ( 2*(3k-1)+3k+1, 3k-1 + 2*(3k+1))
Plugging in k as 4 as I want to get v5
I get v5 as (242, 244)
And from this step the instruction said to find the entry of maximum absolute value of vk+1 and I don't know how. I am not even sure if what I've done is correct.

Please correct me if I am wrong and please explain on what to do next.
Thanks in advance!
 
Physics news on Phys.org
You chose u_0=(1,1), you would get u_k=(3^k,3^k). Even if you got v_5=(242,244) somehow, the max abs entry is obviously 244, because |244|>|242|. So u_5=(242/244,1).
Now find another less clever and more random u_0 and try again
 
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top