Computational Observations

Eigenvectors B1, B2, ..., BN are linearly independent and form a basis for RN. Thus, any vector V can be writen as a linear combination:

V = b1 B1 + b2 B2 + ... + bN BN

Then

AV = A(b1 B1 + b2 B2 + ... + bN BN)
= b1 A B1 + b2 A B2 + ... + bNA BN
= b1 λ1 B1 + b2 λ2 B2 + ... + bN λN BN

Similarly,
Ak V= b1 λ1k B1 + b2 λ2k B2 + ... + bN λNk BN

Dividing by λ1k gives:
(1/λ1k) Ak V= b1 B1 + b22k1k) B2 + ... + bNNk1k )BN

Since λ1 is the largest eigenvalue, the expressions jk1k) converge to 0 as k increases.

Thus, if we start with any vector V that is not in the subspace spanned by the eigenvectors B2 through BN, then (1/λ1k)Ak V converges to an eigenvector B1.

Without [just a little] more analysis, we do not know λ1. Instead, we scale the result of each successive power Ak V, to make it a unit vector. With just modest assumptions on the nature of the eigenvalues, such a process of taking powers should converge to a principal eigenvector for the dominent eigenvalue λ1

created: 10 February 2007
last revised: 15 February 2007
previous  next Valid HTML 4.01!