.png){kind=icon}
返回
Recursive inverse factorization
.png){kind=icon}
PRE
AI
DOI：10.1063/1.2884921.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A recursive algorithm for the inverse factorization S-1=ZZ(*) of Hermitian positive definite matrices S is proposed. The inverse factorization is based on iterative refinement [A.M.N. Niklasson, Phys. Rev. B 70, 193102 (2004)] combined with a recursive decomposition of S. As the computational kernel is matrix-matrix multiplication, the algorithm can be parallelized and the computational effort increases linearly with system size for systems with sufficiently sparse matrices. Recent advances in network theory are used to find appropriate recursive decompositions. We show that optimization of the so-called network modularity results in an improved partitioning compared to other approaches. In particular, when the recursive inverse factorization is applied to overlap matrices of irregularly structured three-dimensional molecules. (c) 2008 American Institute of Physics.
Keyword:
DENSITY-MATRIX SEARCH
3-DIMENSIONAL STRUCTURE
COMMUNITY STRUCTURE
EXPANSION METHODS
PURIFICATION
DIAGONALIZATION
SIZE
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.1
论文数:
7.2W
被引数:
23.2W
机构
引用论文
分享收藏Nonlocal exchange interaction removes half-metallicity in graphene nanoribbons.png)
NANO LETTERS
NANO LETTERSIF9.1
PREAI
分享收藏分享收藏
查看更多内容