arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1012.2059cond-mat.str-elphysics.comp-ph
收藏

二体密度矩阵变分确定的原-对偶半定规划算法

A primal-dual semidefinite programming algorithm tailored to the variational determination of the two-body density matrix

B. Verstichel, H. van Aggelen, D. Van Neck, P. Bultinck, S. De Baerdemacker

摘要:

量子多体问题可以被重新表述为两体约化密度矩阵的变分确定,服从一组N-可表示性约束。这个数学问题具有半定规划的形式。我们适应一个标准的原始-对偶内点算法,以利用物理问题的具体结构。特别地,可以非常有效地计算矩阵-向量乘积。我们已经将所提出的算法的配对型哈密顿量和研究的计算方面的方法。标准的N-可表示性条件对这个问题表现得很好。

英文摘要:

The quantum many-body problem can be rephrased as a variational determination of the two-body reduced density matrix, subject to a set of N-representability constraints. The mathematical problem has the form of a semidefinite program. We adapt a standard primal-dual interior point algorithm in order to exploit the specific structure of the physical problem. In particular the matrix-vector product can be calculated very efficiently. We have applied the proposed algorithm to a pairing-type Hamiltonian and studied the computational aspects of the method. The standard N-representability conditions perform very well for this problem.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑