Iterative methods for symmetric eigenvalue problems are finally becoming a numerical standard for extremely large problems. In this talk we present a survey of some theoretical convergence rate estimates for such methods, derived by soviet scientists. We consider preconditioned analogs of the power method, the steepest descent/ascent method, Chebyshev's methods, and Lanczos-type methods, as well as their block variants.