Suppr超能文献

多种粒子表象在选定 CI 中的比较 I:基于树的方法。

Comparison of many-particle representations for selected-CI I: A tree based approach.

机构信息

Max-Planck-Institut für Kohlenforschung, Mülheim an der Ruhr, Germany.

出版信息

J Comput Chem. 2021 May 30;42(14):982-1005. doi: 10.1002/jcc.26518. Epub 2021 Mar 25.

Abstract

The full configuration interaction (FCI) method is only applicable to small molecules with few electrons in moderate size basis sets. One of the main alternatives to obtain approximate FCI energies for bigger molecules and larger basis sets is selected CI. However, due to: (a) the lack of a well-defined structure in a selected CI Hamiltonian, (b) the potentially large number of electrons together with c) potentially large orbital spaces, a computationally and memory efficient algorithm is difficult to construct. In the present series of papers, we describe our attempts to address these issues by exploring tree-based approaches. At the same time, we devote special attention to the issue of obtaining eigenfunctions of the total spin squared operator since this is of particular importance in tackling magnetic properties of complex open shell systems. Dedicated algorithms are designed to tackle the CI problem in terms of determinant, configuration (CFG) and configuration state function many-particle bases by effective use of the tree representation. In this paper we describe the underlying logic of our algorithm design and discuss the advantages and disadvantages of the different many particle bases. We demonstrate by the use of small examples how the use of the tree simplifies many key algorithms required for the design of an efficient selected CI program. Our selected CI algorithm, called the iterative configuration expansion, is presented in the penultimate part. Finally, we discuss the limitations and scaling characteristics of the present approach.

摘要

全组态相互作用(FCI)方法仅适用于在中等大小基组中具有少数电子的小分子。对于更大的分子和更大的基组,获得近似 FCI 能量的主要替代方法之一是选择 CI。然而,由于:(a)选择 CI 哈密顿量中缺乏明确定义的结构,(b)潜在的大量电子以及 c)潜在的大轨道空间,因此难以构建计算和存储效率高的算法。在本系列论文中,我们通过探索基于树的方法来尝试解决这些问题。同时,我们特别关注获得总自旋平方算符本征函数的问题,因为这对于解决复杂的开壳体系的磁性性质特别重要。专用算法旨在通过有效利用树表示来解决行列式、组态(CFG)和组态态函数多粒子基中的 CI 问题。本文描述了我们算法设计的基本逻辑,并讨论了不同多粒子基的优缺点。我们通过使用小例子演示了树的使用如何简化设计高效选择 CI 程序所需的许多关键算法。我们称为迭代组态扩展的选择 CI 算法在倒数第二段中介绍。最后,我们讨论了当前方法的局限性和扩展特性。

文献AI研究员

20分钟写一篇综述,助力文献阅读效率提升50倍。

立即体验

用中文搜PubMed

大模型驱动的PubMed中文搜索引擎

马上搜索

文档翻译

学术文献翻译模型,支持多种主流文档格式。

立即体验