Formulation and Computational Algorithms in Finite Element Analysis: U.S.-German Symposium.

摘要

The convergence of subspace iteration for the solution of eigenpairs is studied. The theoretical convergence rate is derived and is presented with emphasis on the theory in the light of practical implications. Various techniques to accelerate the convergence of the subspace iterations are proposed and are tested in a preliminary manner on some demonstrative sample problems. (Author)