𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A study of implementation schemes for vectorized sparse EBE matrix-vector multiplication

✍ Scribed by Alvaro L.G.A. Coutinho; JoséL.D. Alves; Nelson F.F. Ebecken

Publisher
Elsevier Science
Year
1991
Weight
498 KB
Volume
13
Category
Article
ISSN
0961-3552

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Linear combination of Lanczos vectors: A
Linear combination of Lanczos vectors: A storage-efficient algorithm for sparse matrix eigenvector computations
✍ T. Koslowski; W. Von Niessen 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 634 KB

We present a storage-efficient and robust algorithm for the computation of eigenvectors of large sparse symmetrical matrices using a Lanczos scheme. The algorithm is based upon a linear combination of Lanczos vectors (LCLV) with a variable iteration depth. A simple method is given to determine the i

A submatrix algorithm for the matrix-vec
A submatrix algorithm for the matrix-vector multiplication of very large matrices
✍ Roland Lindh; Per-Årke Malmquist 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 179 KB

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 form