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.