...
首页> 外文期刊>Journal of chemical theory and computation: JCTC >Divide and Conquer Hartree-Fock Calculations on Proteins
【24h】

Divide and Conquer Hartree-Fock Calculations on Proteins

机译:蛋白质的分而治之Hartree-Fock计算

获取原文
获取原文并翻译 | 示例
           

摘要

The ability to perform ab initio electronic structure calculations that scale linearly with the system size is one of the central aims in theoretical chemistry. In this study, the implementation of the divide and conquer (DC) algorithm, an algorithm with the potential to aid the achievement of true linear scaling within Hartree-Fock (HF) theory, is revisited. Standard HF calculations solve the Roothaan-Hall equations for the whole system; in the DC-HF approach, the diagonalization of the Fock matrix is carried out on smaller subsystems. The DC algorithm for HF calculations was validated on polyglycines, polyalanines, and 11 real three-dimensional proteins of up to 608 atoms in this work. We also found that a fragment-based initial guess using the molecular fractionation with conjugated caps (MFCC) method significantly reduces the number of SCF cycles and even is capable of achieving convergence for some globular proteins where the simple superposition of atomic densities (SAD) initial guess fails.
机译:进行从头开始的电子结构计算(与系统大小成线性比例)的能力是理论化学的主要目标之一。在这项研究中,重新审视了分而治之(DC)算法的实现,该算法具有帮助在Hartree-Fock(HF)理论中实现真正的线性缩放的潜力。标准的HF计算可求解整个系统的Roothaan-Hall方程。在DC-HF方法中,Fock矩阵的对角线化是在较小的子系统上进行的。这项用于HF计算的DC算法已在聚甘氨酸,聚丙氨酸和11种真实的三维蛋白质(最多608个原子)上得到验证。我们还发现,使用基于共轭帽的分子分级分离(MFCC)方法进行基于片段的初始猜测,可以显着减少SCF循环的数量,甚至可以实现某些球蛋白的融合,其中原子密度(SAD)可以简单地叠加猜测失败。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号