Recursive inverse factorization
A recursive algorithm for the inverse factorization S − 1 = Z Z * 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 computati...
Gespeichert in:
Veröffentlicht in: | The Journal of chemical physics 2008-03, Vol.128 (10), p.104105-104105-10 |
---|---|
Hauptverfasser: | , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | A recursive algorithm for the inverse factorization
S
−
1
=
Z
Z
*
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. |
---|---|
ISSN: | 0021-9606 1089-7690 1089-7690 |
DOI: | 10.1063/1.2884921 |