Everything about Matrix multiplication algorithm
Algorithm to multiply matrices
Because matrix multiplication is such a central operation in many numerical algorithms, much work has been invested in making matrix multiplication algorithms efficient. Applications of matrix multiplication in computational problems are found in many fields including scientific computing and pattern recognition and in seemingly unrelated problems such as counting the paths through a graph. Many different algorithms have been designed for multiplying matrices on different types of hardware, including parallel and distributed systems, where the computational work is spread over multiple processors. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Matrix multiplication algorithmA 5-minute orientation
- Skim a recent paper: Discovering faster matrix multiplication algorithms with reinforcement learningInfluential work since 2022
- Pick up a classic book: Neural Information ProcessingThe most-reprinted book on the subject
- Read the landmark paper: The Mailman algorithm: A note on matrix–vector multiplicationCited 59 times
- Go sideways: Strassen algorithmA closely related topic
- Go sideways: Computational complexity of matrix multiplicationA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
The Mailman algorithm: A note on matrix–vector multiplication
AN EFFICIENT PARALLEL ALGORITHM FOR MATRIX-VECTOR MULTIPLICATION
SUMMA: scalable universal matrix multiplication algorithm
A new parallel matrix multiplication algorithm on distributed-memory concurrent computers
An improved combinatorial algorithm for Boolean matrix multiplication
A practical algorithm for faster matrix multiplication
Quantum hyperparallel algorithm for matrix multiplication
A tensor product formulation of Strassen's matrix multiplication algorithm
🆕 Influential since 2022
Discovering faster matrix multiplication algorithms with reinforcement learning
A Novel Parallel Algorithm for Sparse Tensor Matrix Chain Multiplication via TCU-Acceleration
FSpGEMM: A Framework for Accelerating Sparse General Matrix–Matrix Multiplication Using Gustavson’s Algorithm on FPGAs
Algorithm 1039: Automatic Generators for a Family of Matrix Multiplication Routines with Apache TVM
A practical streaming approximate matrix multiplication algorithm
📚 Books worth reading
Neural Information ProcessingTingwen Huang · 2012
Mathematical structures for computer scienceJudith L. Gersting · 1982
Data structures and algorithm analysis in CMark Allen Weiss · 1993
The Elements of Statistical LearningTrevor Hastie, Robert Tibshirani · 2001
Data structures & algorithm analysis in JavaMark Allen Weiss · 1999
Introduction to Multiple Time Series AnalysisHelmut Lütkepohl, Helmut Lutkepohl · 1991
Parallel Programming in C with MPI and OpenMPMichael J. Quinn · 2003
Computer algorithmsEllis Horowitz · 1997
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Strassen algorithm In linear algebra, the Strassen algorithm, named after Volker Strassen, is an algorithm for matrix multiplication. It is faster than the standard matrix…
- Computational complexity of matrix multiplication Unsolved problem in computer science What is the fastest algorithm for matrix multiplication? More unsolved problems in computer science In theoretical…
- Matrix multiplication In mathematics, specifically in linear algebra, matrix multiplication is a binary operation that produces a matrix from two matrices. For matrix multiplication…
- Matrix chain multiplication Matrix chain multiplication (or the matrix chain ordering problem) is an optimization problem concerning the most efficient way to multiply a given sequence…
- Cache-oblivious algorithm In computing, a cache-oblivious algorithm (or cache-transcendent algorithm) is an algorithm designed to take advantage of a processor cache without having…
- Communication-avoiding algorithm Communication-avoiding algorithms minimize movement of data within a memory hierarchy for improving its running-time and energy consumption. These minimize…
- Multidimensional DSP with GPU acceleration Multidimensional digital signal processing (MDSP) refers to the extension of digital signal processing (DSP) techniques to signals that vary in more than…
- Polynomial evaluation In mathematics and computer science, polynomial evaluation refers to computation of the value of a polynomial when its indeterminates are substituted for…