An engineering problem can be reduced to a form [A]{x} = {y} and then to

aneigenvalue problem [A]{V} = {V}, whose solution i.e. det(A - *I) = 0 gives
youeigenvalues () and eigenvectors {V}. What
do eigenvalues and eigenvectorsphysically mean ????
In mathematical sense the system matrix [A] can be thought of as
a transformation matrix whose effect varies with directions and is maximum in
certain direction. These maxima are called eigenvalues and the
corresponding directions are known as eigenvectors. Let us explain it with a
couple of examples:
1. A cantilever beam is given an initial deflection and then released. Its
vibration is an eigenvalue problem and the eigenvalues are the natural
frequencies of vibration and the eigenvectors are the mode shapes of the
vibration.
2. Google search is an eigenvalue problem. When you search a 'keyword'. Your
search engine goes to millions of websites and an eigenvalue problem is
formulated in which the system matrix, P is called Markov Transition Matrix.
The eigenvalue problem is given as [P]{W} = 1 {W}. Since each P is probability
value, the eigenvalue = 1. The P is the conditional probability that we are on ij

the i-th webpage, given that we gave search at the j-th webpage. P for each ij

webpage i in the web is calculated based on the incoming link from neighboring
webpage j, L and number of outgoing links from the neighboring webpage, j, N .
ij j

So equation for weight at webpage ibecomes:

W = L W / N = P W Where P = L / N and weight of j-th webpage, W .
i ij j j ij j ij ij j j

Suppose our world wide web has only 3 webpages, Then our equations will be:
W =P W +P W +P W
1 11 1 12 2 13 3

W =P W +P W +P W
2 21 1 22 2 23 3

W =P W +P W +P W
3 31 1 32 2 33 3

Which becomes {W} = [P] {W} => [P] {W} = {W} (1)
3x1 3x3 3x1 3x3 3x1 3x1

For this problem = 1 and let us say our solution for the eigenvalue problem (1)
is{W} = {0.65, 0.5, 0.95} , then since third value is the largest, means your web
3x1
T

search will display the websites in following order: Third, First, Second.