.png){kind=icon}
.png){kind=icon}
Return
Recursive inverse factorization
.png){kind=icon}
PRE
AI
DOI：10.1063/1.2884921.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
DENSITY-MATRIX SEARCH
3-DIMENSIONAL STRUCTURE
COMMUNITY STRUCTURE
EXPANSION METHODS
PURIFICATION
DIAGONALIZATION
SIZE
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.1
Papers:
7.2W
Citations:
23.2W
Organization
View more organizations