System-Specific Separable Basis Based on Tucker Decomposition: Application to Density Functional Calculations

Gaussian-Approximated Poisson Preconditioner for Iterative Diagonalization in Real-Space Density Functional Theory

Various real-space methods optimized on massive parallel computers have been developed for efficient large-scale density functional theory (DFT) calculations of materials and biomolecules. The iterative diagonalization of the Hamiltonian matrix is a computational bottleneck in real-space DFT calculations. Despite the development of various iterative eigensolvers, the absence of efficient real-space preconditioners has hindered their overall efficiency. An efficient preconditioner must satisfy two conditions: appropriate acceleration of the convergence of the iterative process and inexpensive computation. This study proposed a Gaussian-approximated Poisson preconditioner (GAPP) that satisfied both conditions and was suitable for real-space methods. A low computational cost was realized through the Gaussian approximation of a Poisson Green's function. Fast convergence was achieved through the proper determination of Gaussian coefficients to fit the Coulomb energies. The performance of GAPP was evaluated for several molecular and extended systems, and it showed the highest efficiency among the existing preconditioners adopted in real-space codes.

Dynamic Precision Approach for Accelerating Large-Scale Eigenvalue Solvers in Electronic Structure Calculations on Graphics Processing Units

Single precision (SP) arithmetic can be greatly accelerated as compared to double precision (DP) arithmetic on graphics processing units (GPUs). However, the use of SP in the whole process of electronic structure calculations is inappropriate for the required accuracy. We propose a 3-fold dynamic precision approach for accelerated calculations but still with the accuracy of DP. Here, SP, DP, and mixed precision are dynamically switched during an iterative diagonalization process. We applied this approach to the locally optimal block preconditioned conjugate gradient method to accelerate a large-scale eigenvalue solver for the Kohn-Sham equation. We determined a proper threshold for switching each precision scheme by examining the convergence pattern on the eigenvalue solver only with the kinetic energy operator of the Kohn-Sham Hamiltonian. As a result, we achieved up to 8.53× and 6.60× speedups for band structure and self-consistent field calculations, respectively, for test systems under various boundary conditions on NVIDIA GPUs.

Neural network-based pseudopotential: development of a transferable local pseudopotential

Transferable local pseudopotentials (LPPs) are essential for fast quantum simulations of materials. However, various types of LPPs suffer from low transferability, especially since they do not consider the norm-conserving condition. Here we propose a novel approach based on a deep neural network to produce transferable LPPs. We introduced a generalized Kerker method expressed with the deep neural network to represent the norm-conserving pseudo-wavefunctions. Its unique feature is that all necessary conditions of pseudopotentials can be explicitly considered in terms of a loss function. Then, it can be minimized using the back-propagation technique just with single point all-electron atom data. To assess the transferability and accuracy of the neural network-based LPPs (NNLPs), we carried out density functional theory calculations for the s- and p-block elements of the second to the fourth periods. The NNLPs outperformed other types of LPPs in both atomic and bulk calculations for most elements. In particular, they showed good transferability by predicting various properties of bulk systems including binary alloys with higher accuracy than LPPs tailored to bulk data.