Abstract
Matrices appearing in Hartree-Fock or density functional theory coming from discretization with help of atom-centered local basis sets become sparse when the separation between atoms exceeds some system-dependent threshold value. Efficient implementation of sparse matrix algebra is therefore essential in large-scale quantum calculations. We describe a unique combination of algorithms and data representation that provides high performance and strict error control in blocked sparse matrix algebra. This has applications to matrix-matrix multiplication, the Trace-Correcting Purification algorithm and the entire self-consistent field calculation. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Rubensson, E. H., Rudberg, E., & Sałek, P. (2007). Sparse matrix algebra for quantum modeling of large systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4699 LNCS, pp. 90–99). Springer Verlag. https://doi.org/10.1007/978-3-540-75755-9_11
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
