My favorite illustration of the usefulness of eigenvalues comes from probability. Suppose you represented the "state" of a ping-pong game by a vector, where the x-coordinate was the probability that I was serving and the y-coordinate was the probability that you were serving. It's possible to model the outcome of a serve by multiplying this vector by a matrix. (Not all real life situations can be modeled accurately this way, of course.)
It turns out that one of the eigenvalues of the matrix will be exactly one, and the other will be less than one. (The proof that this must be so is not obvious, but it stems from the fact that probabilities always sum to one.) Think about what that means. It means that if we keep playing, we keep multiplying the state of the game by the matrix over and over again. The eigenvector corresponding to the smaller eigenvalue keeps getting multiplied by a smaller and smaller value, shrinking to insignificance. The other eigenvector keeps getting multiplied by one, unchanging. You can use this knowledge of the eigenvalues to predict what the long term behavior in the game will be... how frequently each of us will be serving.
If [itex]e_1[/itex] and [itex]e_2[/itex] are the eigenvectors and [itex]\lambda_1[/itex] and [itex]\lambda_2[/itex] represent the eigenvalues, then consider what happens when we multiply any linear combination of them by the matrix over and over again.
[tex]v = \lambda_1^n e_1 + \lambda_2^n e_2 = e_1[/tex] as n explodes
The neat thing is that the initial condition, whether you or I started the first serve, will fade to insignificance. All because one eigenvalue is one and the other is smaller than one.