arrow
返回

Expansion algorithm for the density matrix

delete2002-10-24
delete127
delete
OA
AI
A
Anders M. N. Niklasson *
DOI:10.1103/PhysRevB.66.155115delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
A purification algorithm for expanding the single-particle density matrix in terms of the Hamiltonian operator is proposed. The scheme works with a predefined occupation and requires less than half the number of matrix-matrix multiplications compared to existing methods at low (<10%) and high (>90%) occupancies. The expansion can be used with a fixed chemical potential, in which case it is an asymmetric generalization of and a substantial improvement over grand canonical McWeeny purification. It is shown that the computational complexity, measured as the number of matrix multiplications, essentially is independent of system size even for metallic materials with a vanishing band gap.
Keyword:
ELECTRONIC-STRUCTURE CALCULATIONS
LINEAR SCALING COMPUTATION
FUNCTIONAL-THEORY
FOCK MATRIX
DIAGONALIZATION
MINIMIZATION
PURIFICATION
TRANSFORMS
PRINCIPLES
ATOMS
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Physical Review B 封面图
Physical Review B
IF:
3.7
论文数:
15.4W
被引数:
41.0W

机构

暂无机构信息
引用论文

引用论文

Statistical Literacy of Obstetrics-Gynecology Residents
err2013-06-01
err0
errOAAI
errBritta L. Anderson; Sterling Williams; Jay Schulkin
err分享
err收藏
err分享
err收藏
err分享
err收藏
学者 查看更多内容