• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

大型非厄米矩阵部分对角化的广义戴维森算法三种变体的比较

A Comparison of Three Variants of the Generalized Davidson Algorithm for the Partial Diagonalization of Large Non-Hermitian Matrices.

作者信息

Caricato Marco, Trucks Gary W, Frisch Michael J

机构信息

Gaussian, Inc., 340 Quinnipiac Street, Bldg. 40, Wallingford, Connecticut 06492.

出版信息

J Chem Theory Comput. 2010 Jul 13;6(7):1966-70. doi: 10.1021/ct100111w. Epub 2010 Jun 10.

DOI:10.1021/ct100111w
PMID:26615925
Abstract

The solution of the equation of motion coupled cluster singles and doubles problem, that is finding the lowest lying electronic transition energies and properties, is fundamentally a large non-Hermitian matrix diagonalization problem. We implemented and compared three variants of the widely diffuse generalized Davidson algorithm, which iteratively finds the lowest eigenvalues and eigenvectors of such a matrix. Our numerical tests, based on different molecular systems, basis sets, state symmetries, and reference functions, demonstrate that the separate evaluation of the left- and right-hand eigenvectors is the most efficient strategy to solve this problem considering storage, numerical stability, and convergence rate.

摘要

运动方程耦合簇单双激发问题的求解,即寻找最低电子跃迁能量和性质,从根本上说是一个大型非厄米矩阵对角化问题。我们实现并比较了广泛使用的广义戴维森算法的三种变体,该算法迭代地找到此类矩阵的最低特征值和特征向量。我们基于不同分子体系、基组、态对称性和参考函数的数值测试表明,考虑到存储、数值稳定性和收敛速度,分别评估左右特征向量是解决该问题最有效的策略。

相似文献

1
A Comparison of Three Variants of the Generalized Davidson Algorithm for the Partial Diagonalization of Large Non-Hermitian Matrices.大型非厄米矩阵部分对角化的广义戴维森算法三种变体的比较
J Chem Theory Comput. 2010 Jul 13;6(7):1966-70. doi: 10.1021/ct100111w. Epub 2010 Jun 10.
2
A block variational procedure for the iterative diagonalization of non-Hermitian random-phase approximation matrices.非厄米随机相位近似矩阵的迭代对角化的块变分方法。
J Chem Phys. 2012 Jan 21;136(3):034111. doi: 10.1063/1.3677667.
3
New algorithms for iterative matrix-free eigensolvers in quantum chemistry.量子化学中用于迭代无矩阵特征求解器的新算法。
J Comput Chem. 2015 Feb 15;36(5):273-84. doi: 10.1002/jcc.23800. Epub 2014 Dec 2.
4
Neural network iterative diagonalization method to solve eigenvalue problems in quantum mechanics.用于解决量子力学中本征值问题的神经网络迭代对角化方法。
Phys Chem Chem Phys. 2015 Jun 7;17(21):14071-82. doi: 10.1039/c5cp01438g. Epub 2015 May 11.
5
Diagonalization of large matrices: a new parallel algorithm.大型矩阵的对角化:一种新的并行算法。
J Chem Theory Comput. 2015 Feb 10;11(2):472-83. doi: 10.1021/ct500689u.
6
Valence Excited States in Large Molecules via Local Multireference Singles and Doubles Configuration Interaction.通过局域多参考单双激发组态相互作用研究大分子中的价激发态
J Chem Theory Comput. 2011 Jan 11;7(1):103-11. doi: 10.1021/ct100486q. Epub 2010 Dec 3.
7
Dysonian dynamics of the Ginibre ensemble.
Phys Rev Lett. 2014 Sep 5;113(10):104102. doi: 10.1103/PhysRevLett.113.104102. Epub 2014 Sep 4.
8
On the iterative diagonalization of matrices in quantum chemistry: Reconciling preconditioner design with Brillouin-Wigner perturbation theory.在量子化学中的矩阵迭代对角化:协调预条件设计与布里渊-维格纳微扰理论。
J Chem Phys. 2023 Apr 7;158(13):134107. doi: 10.1063/5.0139295.
9
Multireference Fock-space coupled-cluster and equation-of-motion coupled-cluster theories: the detailed interconnections.多参考态福克空间耦合簇理论与运动方程耦合簇理论:详细的相互联系
J Chem Phys. 2008 Oct 7;129(13):134105. doi: 10.1063/1.2982788.
10
Projected Coupled Cluster Amplitudes from a Different Basis Set As Initial Guess.来自不同基组的投影耦合簇振幅作为初始猜测。
J Chem Theory Comput. 2011 Apr 12;7(4):909-14. doi: 10.1021/ct100636a. Epub 2011 Feb 28.

引用本文的文献

1
Approximate Exponential Integrators for Time-Dependent Equation-of-Motion Coupled Cluster Theory.含时运动方程耦合簇理论的近似指数积分器
J Chem Theory Comput. 2023 Dec 26;19(24):9177-9186. doi: 10.1021/acs.jctc.3c00911. Epub 2023 Dec 12.