𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Fast algorithm for sparse matrix multiplication

✍ Scribed by Amir Schoor

Book ID
113162487
Publisher
Elsevier Science
Year
1982
Tongue
English
Weight
369 KB
Volume
15
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Fast sparse matrix multiplication
Fast sparse matrix multiplication
✍ S.C. Park; J.P. Draayer; S.-Q. Zheng πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 834 KB

A new space-efficient representation for sparse matrices is introduced and a fast sparse matrix multiplication algorithm based on the new representation is presented. The scheme is very efficient when the nonzero elements of a sparse matrix are partially or fully adjacent to one another as in band o

Simple sparse matrix multiplication algo
Simple sparse matrix multiplication algorithm
✍ Daniel KrΓ‘l; Pavel NeogrΓ‘dy; Vladimir KellΓΆ πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 217 KB

A simple algorithm for multiplication of sparse matrices is proposed. This algorithm can be easily incorporate into existing matrix multiplication routines. Behavior of the given algorithm on scalar and vector processors is discussed.

Fast Multiplication and Sparse Structure
Fast Multiplication and Sparse Structures
✍ G. I. Malaschonok; E. S. Satina πŸ“‚ Article πŸ“… 2004 πŸ› SP MAIK Nauka/Interperiodica 🌐 English βš– 36 KB