Related Experiment Video
Updated: May 9, 2026

Computation of Atmospheric Concentrations of Molecular Clusters from ab initio Thermochemistry
Published on: April 8, 2020
Accelerated conformational entropy calculations using graphic processing units
Qian Zhang1, Junmei Wang, Ginés D Guerrero
1Institute of Functional Nano & Soft Materials-FUNSOM and Jiangsu Key Laboratory for Carbon-Based Functional Materials & Devices, Soochow University, Suzhou, Jiangsu 215123, China.
Abstract:
Conformational entropy calculation, usually computed by normal-mode analysis (NMA) or quasi harmonic analysis (QHA), is extremely time-consuming. Here, instead of NMA or QHA, a solvent accessible surface area (SASA) based model was employed to compute the conformational entropy, and a new fast GPU-based method called MURCIA (Molecular Unburied Rapid Calculation of Individual Areas) was implemented to accelerate the calculation of SASA for each atom. MURCIA employs two different kernels to determine the neighbors of each atom. The first kernel (K1) uses brute force for the calculation of the neighbors of atoms, while the second one (K2) uses an advanced algorithm involving hardware interpolations via GPU texture memory unit for such purpose. These two kernels yield very similar results. Each kernel has its own advantages depending on the protein size. K1 performs better than K2 when the size is small and vice versa. The algorithm was extensively evaluated for four protein data sets and achieves good results for all of them. This GPU-accelerated version is ∼600 times faster than the former sequential algorithm when the number of the atoms in a protein is up to 10⁵.
Related Concept Videos
Entropy Change in Reversible Processes
The statement can be further generalized to prove that entropy is a state function. Take a cyclic process between any two points on a p-V diagram.
Entropy Changes Accompanying Specific Processes
Calculating Standard Free Energy Changes
Standard Entropy Change for a Reaction
Entropy and Solvation
Fast Fourier Transform
The computational efficiency of the FFT becomes...

