So mcherm, I'm pretty sure you don't need any enlightenment on this, but I'll try to peer teach this to whom it may help.
So let's say we have a vector which is represented by the matrix A of any dimension (any # of columns, each column a vector). If we multiply this matrix A with an arbitrary unit vector (considering just the direction in the given dimensions) B, then we'll have a certain set of possible resulting vectors (A X B). The eigenvectors are whenever the same unit vector B lines up in direction with (A X B)--where both vectors are dependent on B, and the eigenvalues are the corresponding scalars which must multiply the unit eigenvector to match the resulting A X B vector. The eigenvector does not have to be a unit vector, but since any multiple of the eigenvector can still be a valid eigenvector, you probably just want the unit vector or at least the lowest whole number reduction. If you reduce the eigenvector, the eigenvalue must be changed too.
In equation form: Ax=Ωx
Where A is a matrix you are trying to transform, and x is the possible eigenvector, and Ω is the eigenvalue.
In graphical form (this was what really did the trick): http://ocw.mit.edu/OcwWeb/Mathematics/18-06Spring-2005/Tools... (Demo #1)
And the matrices are simply a different form of a set of equations while still preserving their relative properties. The matrix form allows you to easily manipulate the original set of data with matrix operations. I guess the matrix can also just represent a set of column vectors (which are just a direction in a space with a magnitude) too.
Let me know if I got anything wrong.