Related Experiment Video
Updated: Jul 3, 2025

Determination of Aggregate Surface Morphology at the Interfacial Transition Zone ITZ
Published on: December 16, 2019
Machine Learning K-Means Clustering of Interpolative Separable Density Fitting Algorithm for Accurate and Efficient
Zhenlin Zhang1, Xilin Yin1, Wei Hu1
1Key Laboratory of Precision and Intelligent Chemistry, Department of Chemical Physics, and Anhui Center for Applied Mathematics, University of Science and Technology of China, Hefei, Anhui 230026, China.
Abstract:
The exact-exchange plus random-phase approximation (EXX+RPA) method has emerged as a crucial tool for precisely characterizing electronic structures in molecular and solid systems. We present an accurate and efficient implementation of EXX+RPA calculations that scale cubically and are conducted within plane waves. Our approach incorporates the interpolative separable density fitting (ISDF) algorithm, effectively mitigating the computational challenges associated with the plane wave basis set. To overcome the constraints of the conventional ISDF algorithm, characterized by the exceptionally high prefactor in QR factorization for interpolation point selection, we introduce an enhanced machine learning K-means method. This method incorporates a novel empirical weight function called "SSM+" for more precise interpolation point selection, capturing physical information more accurately across diverse systems. Our machine learning approach offers a quasiquadratic scaling alternative, effectively replacing the computationally demanding cubic-scaling QRCP algorithm in plane-wave-based EXX+RPA calculations. Furthermore, we enhance the method's capabilities by optimizing GPU acceleration using MATLAB's integrated GPU toolkit. In particular, our approach reduces the computational scaling of χ0 from 3.80 to 2.13 and the overall computational scaling of EXX from 2.74 to 2.10. We achieve a remarkable GPU acceleration speedup of up to 35×. Regarding CPU computation time, the standard quartic-scaling method requires 22 h to compute Si128, while QRCP completes the calculation in only around 1 h, achieving a speedup up to 20×. However, the utilization of the K-means algorithm reduces the time to 800 s, a substantial improvement of 100× compared to the standard algorithm. By employing the K-means algorithm, the computational time for interpolative point calculation using QRCP decreases from 1 h to 1 min, resulting in a 55× speed increase. With this improved algorithm, we successfully computed the dissociation curve of H2 and the equilibrium polyynic geometry of C18 molecules.
Related Concept Videos
One-Compartment Open Model: Wagner-Nelson and Loo Riegelman Method for ka Estimation
On...
Extraction: Partition and Distribution Coefficients
For extracting a solute from an aqueous phase into an...
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Cluster Sampling Method
To choose a cluster sample, divide the population into clusters (groups) and then randomly select some of the clusters. All the members from these clusters are in the cluster sample. For example, if you randomly sample four departments from your...
Model Approaches for Pharmacokinetic Data: Distributed Parameter Models
The distributed parameter models are specifically designed to account for variations and differences in some drug classes. This model is particularly useful for assessing regional concentrations of anticancer or...
Reduced Mass Coordinates: Isolated Two-body Problem

