We will discuss new Krylov methods for computing eigenvalues and eigenvectors. These include a multigrid method that improves by doing much of the computation on coarse grids. Also, a polynomial preconditioned Arnoldi can significantly speed up difficult eigenvalue problems. And for very difficult problems, a new method needs two iterations, but can compute eigenvectors without either restarting or saving a large subspace.