Publications
Detailed Information
Efficient discovery of multiple minimum action pathways using Gaussian process : Finding multiple transition pathways with QM potentials by combining the least action principle and Gaussian process
Cited 0 time in
Web of Science
Cited 0 time in Scopus
- Authors
- Issue Date
- 2023-02
- Publisher
- IOP PUBLISHING LTD
- Citation
- Journal of Physics Communications, Vol.7 No.2, p. 025004
- Abstract
- We present a new efficient transition pathway search method based on the least action principle and the Gaussian process regression method. Most pathway search methods developed so far rely on string representations, which approximate a transition pathway by a series of slowly varying system replicas. Such string methods are computationally expensive in general because they require many replicas to obtain smooth pathways. Here, we present an approach employing the Gaussian process regression method, which infers the shape of a potential energy surface with a few observed data and Gaussian-shaped kernel functions. We demonstrate a drastic elevation of computing efficiency of the method about five orders of magnitude than existing methods. Further, to demonstrate its real-world capabilities, we apply our method to find multiple conformational transition pathways of alanine dipeptide using a quantum mechanical potential. Owing to the improved efficiency of our method, Gaussian process action optimization (GPAO), we obtain the multiple transition pathways of alanine dipeptide and calculate their transition probabilities successfully with density-functional theory (DFT) accuracy. In addition, GPAO successfully finds the isomerization pathways of small molecules and the rearrangement of atoms on a metallic surface.
- ISSN
- 2399-6528
- Files in This Item:
- There are no files associated with this item.
- Appears in Collections:
Related Researcher
- Graduate School of Convergence Science & Technology
- Dept. of Molecular and Biopharmaceutical Sciences
Item View & Download Count
Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.