Skip to search formSkip to main contentSkip to account menu

Matrix multiplication algorithm

Known as: Algorithm for matrix multiplication, Algorithms for matrix multiplication, Cache-oblivious matrix multiplication 
Because matrix multiplication is such a central operation in many numerical algorithms, much work has been invested in making matrix multiplication… 
Wikipedia (opens in a new tab)

Related topics

Related topics

30 relations
Analysis of algorithmsBLASCPU cacheCYK algorithm

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Writing a performance-portable matrix multiplication
2012
2012
Fast Parallel Algorithms for Blocked Dense Matrix Multiplication on Shared Memory Architectures
The current trend of multicore and Symmetric Multi-Processor (SMP), architectures underscores the need for parallelism in most… 
2009
2009
A fast error correction technique for matrix multiplication algorithms
Temporal redundancy techniques will no longer be able to cope with radiation induced soft errors in technologies beyond the 45 nm… 
2008
2008
The importance of using the linear transformation matrix in determining the number of processing elements in 2-dimensional systolic array for the algorithm of matrix-matrix multiplication
Matrix multiplication plays very important role in many scientific disciplines because of fact that it is considered as the main… 
2008
2008
NEW PRACTICAL STRASSEN-LIKE APPROXIMATE MATRIX-MULTIPLICATION ALGORITHMS FOUND VIA SOLVING A SYSTEM OF CUBIC EQUATIONS
We have encapsulated the concept of matrix multiplication into a system of cubic equations. We discuss the properties of this… 
2007
2007
Mixed task and data parallel executions in general linear methods
On many parallel target platforms it can be advantageous to implement parallel applications as a collection of multiprocessor… 
1999
1999
Parallel algorithms for matrix multiplication
During the last two decades tremendous success has been achieved in the PC based computing. Most of the PCs are now as powerful… 
1995
1995
Fast algorithms for matrix multiplication using pseudo-number-theoretic transforms
We provide a novel approach to the design of fast algorithms for matrix multiplication. The operation of matrix multiplication is… 
Highly Cited
1989
Highly Cited
1989
A Family of New Efficient Arrays for Matrix Multiplication
The authors present a regular iterative algorithm for matrix multiplication and show that several well-known matrix… 
1970
1970
Error analysis of algorithms for matrix multiplication and triangular decomposition using Winograd's identity
SummaryThe number of multiplications required for matrix multiplication, for the triangular decomposition of a matrix with… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)