A very efficient scheme for the calculation of the lowest eigenvalues, might be obtained by increasing the basis set mentioned in the previous section in each iteration step, i.e.: At the step N solve the eigenvalue problem

with the basis set

The lowest eigenvector of the eigenvalue problem is used to calculate a new (possibly preconditioned) search vector .

Mon Mar 29 10:38:29 MEST 1999