A submatrix algorithm for the matrix-vector multiplication of very large matrices
1989 (English)In: Journal of Computational Chemistry, ISSN 0192-8651, E-ISSN 1096-987X, Vol. 10, no 3, 344-345 p.Article in journal (Refereed) Published
In self-consistent field (SCF) calculations the construction of the Fock matrix is most time-consuming step. The Fock matrix construction may formally be seen as a matrix-vector multiplication, where the matrix is the supermatrix,��ijkl, and the vector is the first-order density matrix, γij. This formalism should be optimal for vector machines. This is not, however, fully utilized in most programs running on computers with small core memory. The size of the �� matrix, typically in the order of 106–108 elements, has forced programmers to implement other nonvectorizable methods. We will present a submatrixbased algorithm which will partition the supermatrix so that vectorizable methods can be employed. The method will also reduce the input/output.
Place, publisher, year, edition, pages
1989. Vol. 10, no 3, 344-345 p.
IdentifiersURN: urn:nbn:se:uu:diva-143953DOI: 10.1002/jcc.540100307OAI: oai:DiVA.org:uu-143953DiVA: diva2:391823