Answers are grounded in this paper and cite their sources.
Bathe's algorithm of subspace iteration for the solution of the eigenvalue problem with symmetric matrices is improved by incorporating an acceleration technique using Chebyshev polynomials. This method of acceleration is particularly effective for this kind of iteration. The rate of convergence of the iteration scheme presented is considerably improved when compared with the original one, and satisfactory rates of convergence can be obtained for a wider range of eigenvalues.
No takes yet. Share an insight, caveat, or question.
Yamamoto et al. (1976) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: