Abstract
We present a weighted-graph-theoretic approach to adaptively compute contributions from many-body approximations for smooth and accurate post-Hartree-Fock (pHF) ab initio molecular dynamics (AIMD) of highly fluxional chemical systems. This approach is ONIOM-like, where the full system is treated at a computationally feasible quality of treatment (density functional theory (DFT) for the size of systems considered in this publication), which is then improved through a perturbative correction that captures local many-body interactions up to a certain order within a higher level of theory (post-Hartree-Fock in this publication) described through graph-theoretic techniques. Due to the fluxional and dynamical nature of the systems studied here, these graphical representations evolve during dynamics. As a result, energetic "hops" appear as the graphical representation deforms with the evolution of the chemical and physical properties of the system. In this paper, we introduce dynamically weighted, linear combinations of graphs, where the transition between graphical representations is smoothly achieved by considering a range of neighboring graphical representations at a given instant during dynamics. We compare these trajectories with those obtained from a set of trajectories where the range of local many-body interactions considered is increased, sometimes to the maximum available limit, which yields conservative trajectories as the order of interactions is increased. The weighted-graph approach presents improved dynamics trajectories while only using lower-order many-body interaction terms. The methods are compared by computing dynamical properties through time-correlation functions and structural distribution functions. In all cases, the weighted-graph approach provides accurate results at a lower cost.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.