Iterative methods for solving the first k eigenvectors

For any given symmetric matrix and a random vector v, the k-order linear transformation of v by A is an estimation of the eigenvector corresponding to the largest eigenvalue of A. i.e.

u = A^k v with k grows, then Au = \lambda_1 u.