𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A submatrix algorithm for the matrix-vector multiplication of very large matrices

✍ Scribed by Roland Lindh; Per-Årke Malmquist

Publisher
John Wiley and Sons
Year
1989
Tongue
English
Weight
179 KB
Volume
10
Category
Article
ISSN
0192-8651

No coin nor oath required. For personal study only.

✦ Synopsis

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, Tikl, and the vector is the first-order density matrix, yi. 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 8 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.

📜 SIMILAR VOLUMES

Fast algorithm for matrix–vector multipl
Fast algorithm for matrix–vector multiply of asymmetric multilevel block-Toeplitz matrices in 3-D scattering
✍ Benjamin E. Barrowes; Fernando L. Teixeira; Jin A. Kong 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 185 KB

## Abstract A new __O__(__N__ log __N__) FFT‐based method to expedite matrix–vector multiplies involving multilevel block‐Toeplitz (MBT) matrices is presented. The method is also a minimal memory method with __O__(__N__) memory requirements because only nonredundant entries of the MBT matrix are st

A multiple time step algorithm compatibl
A multiple time step algorithm compatible with a large number of distance classes and an arbitrary distance dependence of the time step size for the fast evaluation of nonbonded interactions in molecular simulations
✍ Vincent Kräutler; Philippe H. Hünenberger 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 224 KB

## Abstract A new algorithm is introduced to perform the multiple time step integration of the equations of motion for a molecular system, based on the splitting of the nonbonded interactions into a series of distance classes. The interactions between particle pairs in successive classes are update