𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Fast Algorithms with Preprocessing for Matrix-Vector Multiplication Problems

✍ Scribed by I. Gohberg; V. Olshevsky

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
587 KB
Volume
10
Category
Article
ISSN
0885-064X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Degree of scalability: scalable reconfig
Degree of scalability: scalable reconfigurable mesh algorithms for multiple addition and matrix–vector multiplication
✍ Ramachandran Vaidyanathan; Jerry L Trahan; Chun-ming Lu πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 176 KB

The usual concern when scaling an algorithm on a parallel model of computation is preserving efficiency while increasing or decreasing the number of processors. Many algorithms for reconfigurable models, however, attain constant time at the expense of an inefficient algorithm. For these algorithms,

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