A new splitting to solve a large Hermitian eigenproblem (Q1822204)

Large symmetric eigenvalue problems where a principal minor can be found whose smallest eigenvalues are good approximations to the smallest eigenvalues of the large problem are considered. Some experiments are performed with an iteration process where this principal minor is a preconditioner, and they indicate that this type of iterations may be faster than either inverse iteration or Lanczos.