Quantcast

Got Homework?

Connect with other students for help. It's a free community.

  • across
    MIT Grad Student
    Online now
  • laura*
    Helped 1,000 students
    Online now
  • Hero
    College Math Guru
    Online now

Here's the question you clicked on:

55 members online
  • 0 replying
  • 0 viewing

RyanL. Group Title

What is the best way to find the eigenvalues of an nxn matrix.

  • one year ago
  • one year ago

  • This Question is Open
  1. beginnersmind Group Title
    Best Response
    You've already chosen the best response.
    Medals 1

    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.

    • one year ago
  2. RyanL. Group Title
    Best Response
    You've already chosen the best response.
    Medals 0

    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.

    • one year ago
  3. beginnersmind Group Title
    Best Response
    You've already chosen the best response.
    Medals 1

    "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.

    • one year ago
  4. DanielxAK Group Title
    Best Response
    You've already chosen the best response.
    Medals 0

    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.

    • one year ago
    • Attachments:

See more questions >>>

Your question is ready. Sign up for free to start getting answers.

spraguer (Moderator)
5 → View Detailed Profile

is replying to Can someone tell me what button the professor is hitting...

23

  • Teamwork 19 Teammate
  • Problem Solving 19 Hero
  • You have blocked this person.
  • ✔ You're a fan Checking fan status...

Thanks for being so helpful in mathematics. If you are getting quality help, make sure you spread the word about OpenStudy.

This is the testimonial you wrote.
You haven't written a testimonial for Owlfred.