## Abstract

First-principles density functional theory (DFT) calculations for the electronic structure problem require a solution of the Kohn-Sham equation, which requires one to solve a nonlinear eigenvalue problem. Solving the eigenvalue problem is usually the most expensive part in DFT calculations. Sparse iterative diagonalization methods that compute explicit eigenvectors can quickly become prohibitive for large scale problems. The Chebyshev-filtered subspace iteration (CheFSI) method avoids most of the explicit computation of eigenvectors and results in a significant speedup over iterative diagonalization methods for the DFT self-consistent field (SCF) calculations. However, the original formulation of the CheFSI method utilizes a sparse iterative diagonalization at the first SCF step to provide initial vectors for subspace filtering at latter SCF steps. This diagonalization is expensive for large scale problems. We develop a new initial filtering step to avoid completely this diagonalization, thus making the CheFSI method free of sparse iterative diagonalizations at all SCF steps. Our new approach saves memory usage and can be two to three times faster than the original CheFSI method.

Original language | English (US) |
---|---|

Pages (from-to) | 770-782 |

Number of pages | 13 |

Journal | Journal of Computational Physics |

Volume | 274 |

DOIs | |

State | Published - Oct 1 2014 |

## Keywords

- Chebyshev filters
- Density functional theory
- Diagonalization
- Electronic structure problem
- Hamiltonian
- Nonlinear eigenvalue problem
- Real space pseudopotentials
- Self-consistency
- Subspace filtering