✦ LIBER ✦

Rectangular Matrix Multiplication Revisited

✍ Scribed by Don Coppersmith

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 161 KB
Volume: 13
Category: Article
ISSN: 0885-064X
DOI: 10.1006/jcom.1997.0438

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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

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

Approximating Matrix Multiplication for

Approximating Matrix Multiplication for Pattern Recognition Tasks

✍ Edith Cohen; David D Lewis 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 241 KB

Many pattern recognition tasks, including estimation, classification, and the finding of similar objects, make use of linear models. The fundamental operation in such tasks is the computation of the dot product between a query vector and a large database of instance vectors. Often we are interested

Multiple primary melanoma revisited

✍ M. Anne Blackwood; Robin Holmes; Marie Synnestvedt; Megan Young; Cicily George; 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 113 KB

The Combinatorics of Cache Misses during

The Combinatorics of Cache Misses during Matrix Multiplication

✍ Philip J. Hanlon; Dean Chung; Siddhartha Chatterjee; Daniela Genius; Alvin R. Le 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 333 KB

In this paper we construct an analytic model of cache misses during matrix multiplication. The analysis in this paper applies to square matrices of size 2 m where the array layout function is given in terms of a function 3 that interleaves the bits in the binary expansions of the row and column indi