A hierarchic sparse matrix data structure for large-scale Hartree-Fock/Kohn-Sham calculations
✍ Scribed by Emanuel H. Rubensson; Elias Rudberg; Paweł Sałek
- Publisher
- John Wiley and Sons
- Year
- 2007
- Tongue
- English
- Weight
- 597 KB
- Volume
- 28
- Category
- Article
- ISSN
- 0192-8651
No coin nor oath required. For personal study only.
✦ Synopsis
Abstract
A hierarchic sparse matrix data structure for Hartree‐Fock/Kohn‐Sham calculations is presented. The data structure makes the implementation of matrix manipulations needed for large systems faster, easier, and more maintainable without loss of performance. Algorithms for symmetric matrix square and inverse Cholesky decomposition within the hierarchic framework are also described. The presented data structure is general; in addition to its use in Hartree‐Fock/Kohn‐Sham calculations, it may also be used in other research areas where matrices with similar properties are encountered. The applicability of the data structure to ab initio calculations is shown with help of benchmarks on water droplets and graphene nanoribbons. © 2007 Wiley Periodicals, Inc. J Comput Chem, 2007