Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Matrix multiplication

Known as: Fast matrix multiplication, Fast matrix multiplication algorithms, Matrix multiply 
In mathematics, matrix multiplication is a binary operation that takes a pair of matrices, and produces another matrix. Numbers such as the real or… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2014
Highly Cited
2014
This paper presents a method to analyze the powers of a given trilinear form (a special kind of algebraic construction also… Expand
  • table 1
  • figure 1
  • figure 2
  • table 2
  • table 3
Is this relevant?
Highly Cited
2009
Highly Cited
2009
  • N. Bell, M. Garland
  • Proceedings of the Conference on High Performance…
  • 2009
  • Corpus ID: 14531936
Sparse matrix-vector multiplication (SpMV) is of singular importance in sparse linear algebra. In contrast to the uniform… Expand
  • figure 1
  • figure 4
  • figure 3
  • figure 5
  • figure 7
Is this relevant?
Highly Cited
2009
Highly Cited
2009
We are witnessing a dramatic change in computer architecture due to the multicore paradigm shift, as every electronic device from… Expand
Is this relevant?
Highly Cited
2008
Highly Cited
2008
The massive parallelism of graphics processing units (GPUs) oers tremendous performance in many high-performance computing… Expand
  • figure 1
  • figure 3
  • figure 4
  • figure 6
  • figure 5
Is this relevant?
Highly Cited
2008
Highly Cited
2008
We present the basic principles that underlie the high-performance implementation of the matrix-matrix multiplication that is… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Utilizing graphics hardware for general purpose numerical computations has become a topic of considerable interest. The… Expand
  • figure 1
  • figure 2
  • table 1
  • table 2
Is this relevant?
Highly Cited
1999
Highly Cited
1999
In this work, we show that the standard graph-partitioning-based decomposition of sparse matrices does not reflect the actual… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1996
Highly Cited
1996
In the recent past, there has been considerable progress in devising algorithms for the all-pairs shortest paths (APSP) problem… Expand
Is this relevant?
Highly Cited
1990
Highly Cited
1990
We present a new method for accelerating matrix multiplication asymptotically. Thiswork builds on recent ideas of Volker Strassen… Expand
Is this relevant?
Highly Cited
1987
Highly Cited
1987
We present a new method for accelerating matrix multiplication asymptotically. This work builds on recent ideas of Volker… Expand
Is this relevant?