An accelerated subspace iteration for large eigenproblems is proposed.
A higher convergence rate is obtained. It omits some of the Rayleigh-
Ritz procedure from certain iteration steps and the convergence criter
ion is carefully chosen. This paper presents a comparison between the
subspace iteration methods and the accelerated method. Numerical resul
ts show that the proposed acceleration is very efficient and numerical
stable.