A parallel,block; jacobi-davidson implementation for solving large eigenproblems on coarse grain environments

摘要

Iterative methods, often provide the only means of sovling large eigenvalue problems. Their block variants converge slowly but they are robust especially int he presence of multiplicities. Preconditioning is oftne used to improve convergence. Yet, for large matrices, the demands posed on the available computing resources are huge.