首页> 美国卫生研究院文献>The Journal of Chemical Physics >Generalized and efficient algorithm for computing multipole energies and gradients based on Cartesian tensors
【2h】

Generalized and efficient algorithm for computing multipole energies and gradients based on Cartesian tensors

机译:基于笛卡尔张量的通用高效计算多极能量和梯度的算法

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

Accurate representation of intermolecular forces has been the central task of classical atomic simulations, known as molecular mechanics. Recent advancements in molecular mechanics models have put forward the explicit representation of permanent and/or induced electric multipole (EMP) moments. The formulas developed so far to calculate EMP interactions tend to have complicated expressions, especially in Cartesian coordinates, which can only be applied to a specific kernel potential function. For example, one needs to develop a new formula each time a new kernel function is encountered. The complication of these formalisms arises from an intriguing and yet obscured mathematical relation between the kernel functions and the gradient operators. Here, I uncover this relation via rigorous derivation and find that the formula to calculate EMP interactions is basically invariant to the potential kernel functions as long as they are of the form f(r), i.e., any Green’s function that depends on inter-particle distance. I provide an algorithm for efficient evaluation of EMP interaction energies, forces, and torques for any kernel f(r) up to any arbitrary rank of EMP moments in Cartesian coordinates. The working equations of this algorithm are essentially the same for any kernel f(r). Recently, a few recursive algorithms were proposed to calculate EMP interactions. Depending on the kernel functions, the algorithm here is about 4–16 times faster than these algorithms in terms of the required number of floating point operations and is much more memory efficient. I show that it is even faster than a theoretically ideal recursion scheme, i.e., one that requires 1 floating point multiplication and 1 addition per recursion step. This algorithm has a compact vector-based expression that is optimal for computer programming. The Cartesian nature of this algorithm makes it fit easily into modern molecular simulation packages as compared with spherical coordinate-based algorithms. A software library based on this algorithm has been implemented in C++11 and has been released.
机译:分子间力的精确表示一直是经典原子模拟(称为分子力学)的核心任务。分子力学模型的最新进展提出了永久和/或感应电多极矩(EMP)矩的明确表示。迄今为止开发的用于计算EMP相互作用的公式往往具有复杂的表达式,尤其是在笛卡尔坐标中,该表达式只能应用于特定的核势函数。例如,每遇到一个新的内核函数,就需要开发一个新的公式。这些形式主义的复杂性源于核函数与梯度算子之间有趣而又模糊的数学关系。在这里,我通过严格的推导发现了这种关系,发现计算EMP相互作用的公式对于潜在的核函数基本上是不变的,只要它们的形式为f(r),即任何依赖于粒子间的格林函数距离。我提供了一种算法,可有效评估笛卡尔坐标系中任意EMP矩任意等级的任何内核f(r)的EMP相互作用能,力和扭矩。对于任何核f(r),该算法的工作方程基本相同。最近,提出了一些递归算法来计算EMP交互。根据内核功能的不同,此处的算法在所需的浮点运算数量方面比这些算法快4-16倍,并且内存效率更高。我证明了它比理论上理想的递归方案还要快,即每个递归步骤需要1个浮点乘法和1个加法。该算法具有一个紧凑的基于向量的表达式,该表达式对于计算机编程而言是最佳的。与基于球形坐标的算法相比,该算法的笛卡尔性质使其很容易适合现代分子模拟程序包。基于此算法的软件库已在C ++ 11中实现,并已发布。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号