I am sure there is an easier way than the one I am trying.
Prove that the matrix has one negative and onepositive eigenvalue:
1 a 1
a 1 a
1 a 1
where a=1.0001
Hello,
Try to transform this matrix by combining rows with each other. I think it's called "similar matrix", am not sure...
If you manage to find a diagonal matrix (which is the representation of the matrix in a certain basis), then the numbers in the diagonal will be the eigenvalues.
Let e1 be the first row, e2 the second and e3 the third.
e2 -> e2-a*e3
Matrix is now (...)
e3 -> e3-e1
Matrix is now (...)
Conclude
I will partially guide you on your way to finding the eigenvalues of your matrix.
Note: I know you do not need to find the actual eigenvalues here, but you should know this without a doubt.
First give your matrix a name: A =
Your first real step: determine the characteristic polynomial of A.
To do this, subtract lambda from each term along the main diagonal in A.
Like this: .
Compute the determinant of this modified matrix. You should get a polynomial in terms of lambda. This is the characteristic polynomial of A. Factor this and then set your factored result equal to zero and you have your characteristic equation. Solve for lambda. Have fun.
-Andy