AbstractThe subspace iteration method is widely used for the computation of a few smallest eigenvalues and the corresponding eigenvectors of large eigenproblems. Under certain conditions, this method exhibits slow convergence. For improving the convergence of the method, a few acceleration techniques are already available in the literature. In this paper, yet another method is presented. The method has been applied for the computation of a few smallest eigenpairs of some typical eigenprobiems. The results indicate that the acceleration method is efficient for large eigenproblems. Simplicity, ease of computer implementation, absence of parameters whose values are to be chosen based on experience and effectiveness for large problems are the attractive features of the proposed method.