✦ LIBER ✦

Fast Multiplication and Sparse Structures

✍ Scribed by G. I. Malaschonok; E. S. Satina

Book ID: 111603178
Publisher: SP MAIK Nauka/Interperiodica
Year: 2004
Tongue: English
Weight: 36 KB
Volume: 30
Category: Article
ISSN: 0361-7688
DOI: 10.1023/b:pacs.0000021269.20049.0f

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Fast algorithm for sparse matrix multipl

Fast algorithm for sparse matrix multiplication

✍ Amir Schoor 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 369 KB

A note on a fast algorithm for sparse ma

A note on a fast algorithm for sparse matrix multiplication

✍ Jacques Cohen 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 94 KB

Fast Matrix-Vector Multiplication in the

Fast Matrix-Vector Multiplication in the Sparse-Grid Galerkin Method

✍ Andreas Zeiser 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 726 KB

Fast matrix multiplication

✍ Carlos F. Bunge; Gerardo Cisneros 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 358 KB

Several implementations of matrix multiplication (MMUL) in Fortran and VAX assembly language are discussed. On a VAX-11/780 computer, the most efficient MMUL is achieved through vector-scalarmultiply-and-add (VSMA) operations, rather than by means of dot products. We also discuss optimal MMUL algori

Cache-Oblivious Sparse Matrix–Vector Mul

Cache-Oblivious Sparse Matrix–Vector Multiplication by Using Sparse Matrix Partitioning Methods

✍ Yzelman, A. N.; Bisseling, Rob H. 📂 Article 📅 2009 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 767 KB