𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Simple sparse matrix multiplication algorithm

✍ Scribed by Daniel Král; Pavel Neogrády; Vladimir Kellö

Book ID
103048801
Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
217 KB
Volume
85
Category
Article
ISSN
0010-4655

No coin nor oath required. For personal study only.

✦ Synopsis

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.

📜 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

SUMMA: scalable universal matrix multipl
SUMMA: scalable universal matrix multiplication algorithm
✍ Van De Geijn, R. A.; Watts, J. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 341 KB

In the paper we give a straightforward, highly efficient, scalable implementation of common matrix multiplication operations. The algorithms are much simpler than previously published methods, yield better performance, and require less work space. MPI implementations are given, as are performance re

Load-Balanced Sparse Matrix–Vector Multi
Load-Balanced Sparse Matrix–Vector Multiplication on Parallel Computers
✍ Sorin G. Nastea; Ophir Frieder; Tarek El-Ghazawi 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 560 KB

We considered the load-balanced multiplication of a large sparse matrix with a large sequence of vectors on parallel computers. We propose a method that combines fast load-balancing with efficient message-passing techniques to alleviate computational and inter-node communications challenges. The per

A practical algorithm for faster matrix
A practical algorithm for faster matrix multiplication
✍ Igor Kaporin 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 69 KB

The purpose of this paper is to present an algorithm for matrix multiplication based on a formula discovered by Pan [7]. For matrices of order up to 10 000, the nearly optimum tuning of the algorithm results in a rather clear non-recursive one-or two-level structure with the operation count comparab