Eigenvalues & eigenvectors of N x N matrix?

Click For Summary
To find eigenvalues and eigenvectors of an N x N matrix, it's essential to consult a Linear Algebra textbook that typically outlines the necessary algorithms. A common method involves computing the determinant of (A - cI) and setting it to zero to find eigenvalues. For large matrices, such as a 12 x 70,000 matrix, specialized programming techniques or software packages like LAPACK may be required for efficient computation. The discussion also highlights the Rayleigh quotient method for approximating the dominant eigenvalue through iterative calculations. Utilizing these resources and methods can significantly aid in solving eigenvalue problems in practical applications like face recognition algorithms.
sapling_pk
Messages
3
Reaction score
0
How to get eigenvalues & eigenvectors of N x N matrix?
Please can anyone help me out i have searched a lot but not able to find the solution.

Regards
 
Physics news on Phys.org
Your textbook should present a complete algorithm for computing them; have you looked there? If you've already looked at it, then in what way are you having trouble using it?
 
My goodness! This is one of the major problems of Linear Algebra and, indeed, of mathematics in general! Surely, as Hurkyl suggests, any textbook on Linear Algebra will devote one or more chapters to this!

This is much too general a question for a forum like this. Can you post specific problems?
 
c is an eigenvalue of A iff A-c fails to be invertible iff det(A-c) = 0. so compute det(A-c) considering c as a variable and set this polynomial equal to zero. if c is a root of it, then compute a basis for the kernel of A-c by gaussian elimination.

doing this for all roots c of det(A-c) gives a maximal independent set of eigenvectors, hence basis of them if one exists.
 
well actually i want find eigenvalues of huge matrix i.e 12 x 70000 so hope you have understood my problem.
thanks to all for replying.
Regards

HallsofIvy said:
My goodness! This is one of the major problems of Linear Algebra and, indeed, of mathematics in general! Surely, as Hurkyl suggests, any textbook on Linear Algebra will devote one or more chapters to this!

This is much too general a question for a forum like this. Can you post specific problems?
 
And not only eigenvalues but also the eigenvectors.Because i am implementing a face recognition algorithm if someone give me any idea with respect to programming that will be appreciated.Thanks
 
apparently you knlow more than i do, but here is what my old linear aklgebra book says:assuming your matrix A is diagonalizable, and the largest eigenvalue is unique and much larger than the other eigenvalues, then for any vector u which has a non zero coefficient with respect to the corresponding "largest" eigenvector, Au has a large component of that eigenvector.

then (Au.u)/(u.u) is an approximation to the dominant eigenvalue.

iterating A makes the dominance more pronounced, so (Au.u)/u.u) will hopefully converge to the dominant eigenvalue if we repeat the calculation with Au in place of u, and continue many times.

these are called rayleigh quotients.
 
Have you thought about using a standard eigensolver package, like LAPACK?
 

Similar threads

  • · Replies 33 ·
2
Replies
33
Views
2K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 13 ·
Replies
13
Views
3K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 24 ·
Replies
24
Views
4K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 4 ·
Replies
4
Views
3K
  • · Replies 10 ·
Replies
10
Views
3K
  • · Replies 2 ·
Replies
2
Views
9K