首页> 外文期刊>The Journal of Chemical Physics >A noniterative asymmetric triple excitation correction for the density-fitted coupled-cluster singles and doubles method: Preliminary applications
【24h】

A noniterative asymmetric triple excitation correction for the density-fitted coupled-cluster singles and doubles method: Preliminary applications

机译:密度拟合耦合集群单打和双打方法的非迭代非对称三重激励校正:初步应用

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

摘要

An efficient implementation of the asymmetric triples correction for the coupled-cluster singles and doubles [Lambda CCSD(T)] method [S. A. Kucharski and R. J. Bartlett, J. Chem. Phys. 108, 5243 (1998); T. D. Crawford and J. F. Stanton, Int. J. Quantum Chem. 70, 601 (1998)] with the density-fitting [DF-Lambda CCSD(T)] approach is presented. The computational time for the DF-Lambda CCSD(T) method is compared with that of Lambda CCSD(T). Our results demonstrate that the DF-Lambda CCSD(T) method provide substantially lower computational costs than Lambda CCSD(T). Further application results show that the Lambda CCSD(T) and DF-Lambda CCSD(T) methods are very beneficial for the study of single bond breaking problems as well as noncovalent interactions and transition states. We conclude that Lambda CCSD(T) and DF-Lambda CCSD(T) are very promising for the study of challenging chemical systems, where the coupled-cluster singles and doubles with perturbative triples method fails. Published by AIP Publishing.
机译:一种有效的非对称三重校正的耦合簇单和双[Lambda CCSD(T)]方法[S. A. Kucharski和R. J. Bartlett,J. Chem。物理108,5243(1998); T. D. Crawford和J. F. Stanton,国际J.量子化学。 70,601(1998)]中介绍了密度拟合[DF-Lambda CCSD(T)]方法。将DF-Lambda CCSD(T)方法的计算时间与Lambda CCSD(T)的计算时间进行了比较。我们的结果表明,DF-Lambda CCSD(T)方法提供的计算成本大大低于Lambda CCSD(T)。进一步的应用结果表明,Lambda CCSD(T)和DF-Lambda CCSD(T)方法对于研究单键断裂问题以及非共价相互作用和过渡态非常有益。我们得出的结论是,Lambda CCSD(T)和DF-Lambda CCSD(T)对于具有挑战性的化学系统的研究非常有前途,在这些系统中,采用扰动三重方法的耦合簇单次和双次失败。由AIP Publishing发布。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号