anonymous
  • anonymous
What is the best way to find the eigenvalues of an nxn matrix.
Linear Algebra
  • Stacey Warren - Expert brainly.com
Hey! We 've verified this expert answer for you, click below to unlock the details :)
SOLVED
At vero eos et accusamus et iusto odio dignissimos ducimus qui blanditiis praesentium voluptatum deleniti atque corrupti quos dolores et quas molestias excepturi sint occaecati cupiditate non provident, similique sunt in culpa qui officia deserunt mollitia animi, id est laborum et dolorum fuga. Et harum quidem rerum facilis est et expedita distinctio. Nam libero tempore, cum soluta nobis est eligendi optio cumque nihil impedit quo minus id quod maxime placeat facere possimus, omnis voluptas assumenda est, omnis dolor repellendus. Itaque earum rerum hic tenetur a sapiente delectus, ut aut reiciendis voluptatibus maiores alias consequatur aut perferendis doloribus asperiores repellat.
jamiebookeater
  • jamiebookeater
I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!
beginnersmind
  • beginnersmind
Let's call our matrix A. Take the matrix \[A - \lambda I\] I.e, the matrix A with lambda subtracted from the diagonal entries. Solve the equation \[det (A - \lambda I) = 0\] This should be a polinomial equation on lambda. The roots of the equation are the eigenvalues of A.
anonymous
  • anonymous
Yeah the characteristic equation I saw that on my book but in order to set this up you need to have the matrix set up as up triangle matrix but I also read on my book that the values on the main diagonal for a triangle matrix are the eigenvalues so why bother finding the determinant if we can simply row reduce to get a triangle matrix.
beginnersmind
  • beginnersmind
"Yeah the characteristic equation I saw that on my book but in order to set this up you need to have the matrix set up as up triangle matrix" I don't think you do, it works with any matrix. Now if n is big you might not want to calculate the determinant and you might want to use a specialized algorithm. You'll need to ask someone else about those :) But this is fine for n=2 or n=3.

Looking for something else?

Not the answer you are looking for? Search for more explanations.

More answers

anonymous
  • anonymous
You've both hinted at the underlying concept. It's called Eigenvalue Decomposition. Wikipedia does a decent job explaining it: http://en.wikipedia.org/wiki/Eigendecomposition_of_a_matrix However, this isn't very easy to put into practice. Once n gets sufficiently large (doesn't take long), you'll need to implement computational methods that will give you an approximate answer (or converges to the true eigenvalues) to solve anything in an efficient manner.

Looking for something else?

Not the answer you are looking for? Search for more explanations.