On-the-Fly Computation of Frontal Orbitals in Density Matrix Expansions.

We propose a method for computation of frontal (homo and lumo) orbitals in recursive polynomial expansion algorithms for the density matrix. Such algorithms give a computational cost that increases only linearly with system size for sufficiently sparse systems, but a drawback compared to the traditional diagonalization approach is that molecular orbitals are not readily available. Our method is based on the idea to use the polynomial of the density matrix expansion as an eigenvalue filter giving large separation between eigenvalues around homo and lumo [ Rubensson et al. J. Chem. Phys. 2008 , 128 , 176101 ]. This filter is combined with a shift-and-square (folded spectrum) method to move the desired eigenvalue to the end of the spectrum. In this work we propose a transparent way to select recursive expansion iteration and shift for the eigenvector computation that results in a sharp eigenvalue filter. The filter is obtained as a byproduct of the density matrix expansion, and there is no significant additional cost associated either with its construction or with its application. This gives a clear-cut and efficient eigenvalue solver that can be used to compute homo and lumo orbitals with sufficient accuracy in a small fraction of the total recursive expansion time. Our algorithms make use of recent homo and lumo eigenvalue estimates that can be obtained at negligible cost [ Rubensson et al. SIAM J. Sci. Comput . 2014 , 36 , B147 ]. We illustrate our method by performing self-consistent field calculations for large scale systems.