The accurate electronic structure calculation for strongly correlated chemical systems requires an adequate description for both static and dynamic electron correlation, and is a persistent challenge for quantum chemistry. In order to account for static and dynamic electron correlations accurately and efficiently, in this work we propose a new method by integrating the density matrix renormalization group (DMRG) method and multi-reference second-order Epstein–Nesbet perturbation theory (ENPT2) with a selected configuration interaction (SCI) approximation. Compared with previous DMRG-based dynamic correlation methods, the DMRG-ENPT2 method extends the range of applicability, allowing us to efficiently calculate systems with very large active space beyond 30 orbitals. We demonstrate this by performing calculations on H 2 S with an active space of (16e, 15o), hexacene with an active space of (26e, 26o) and 2D H 64 square lattice with an active space of (42e, 42o).
In this article, several optimization methods of two-electron repulsion integral calculations on a graphic processing unit (GPU) are presented. These methods are based on the investigations of the method presented by McMurchie and Davidson (MD). A new Boys function evaluation method for the GPU calculation is introduced. The series summation, the error function, and the finite sum formula method are combined; thus, good performance on the GPU can be achieved. By taking some theoretical study of the McMurchie–Davidson recurrence relations, three major optimization approaches are derived from the deduction of the general term formula for the Hermite expansion coefficient. The three approaches contain a new form of the Hermite expansion coefficients with corresponding recurrence relations, which is more efficient for one-electron integrals and [ss|∗∗] or [∗∗|ss] type two-electron integrals. In addition, a simple yet efficient new recurrence formula for the coefficient evaluation is derived, which is more efficient both in float operations and memory operations than its original one. In average, the new recurrence relation can save 26% float operations and 37% memory operations. Finally, a common sub-expression elimination (CSE) method is implemented. This CSE method is directly generated from some equalities we discovered from the general term formula other than by computer algebra system software. This optimized method achieved up to 3.09 speedups compared to the original MD method on the GPU and up to 92.75 speedups compared to the GAMESS calculation on the central processing unit.
With the view of achieving a better performance in task assignment and load-balancing, a top-level designed forecasting system for predicting computational times of density-functional theory (DFT)/time-dependent DFT (TDDFT) calculations is presented. The computational time is assumed as the intrinsic property for the molecule. Based on this assumption, the forecasting system is established using the “reinforced concrete”, which combines the cheminformatics, several machine-learning (ML) models, and the framework of many-world interpretation (MWI) in multiverse ansatz. Herein, the cheminformatics is used to recognize the topological structure of molecules, the ML models are used to build the relationships between topology and computational cost, and the MWI framework is used to hold various combinations of DFT functionals and basis sets in DFT/TDDFT calculations. Calculated results of molecules from the DrugBank dataset show that (1) it can give quantitative predictions of computational costs, typical mean relative errors can be less than 0.2 for DFT/TDDFT calculations with derivations of ±25% using the exactly pretrained ML models and (2) it can also be employed to various combinations of DFT functional and basis set cases without exactly pretrained ML models, while only slightly enlarge predicting errors.
16 July 2020 in Journal of Chemical Theory and Computation