Efficient discovery of multiple minimum action pathways using Gaussian process

Author:

Shim JaeHwanORCID,Lee Juyong,Yu JaejunORCID

Abstract

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.

Funder

Korea Institute of Science and Technology Information

National Research Foundation of Korea

Samsung Electronics

Publisher

IOP Publishing

Subject

General Physics and Astronomy

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3