Live briefing
Everything about Matrix chain multiplication
Mathematics optimization problem
Matrix chain multiplication is an optimization problem concerning the most efficient way to multiply a given sequence of matrices. The problem is not actually to perform the multiplications, but merely to decide the sequence of the matrix multiplications involved. The problem may be solved using dynamic programming. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Matrix chain multiplicationA 5-minute orientation
- Skim a recent paper: Hybrid optimization technique for matrix chain multiplication using Strassen’s algorithmInfluential work since 2022
- Pick up a classic book: [Papers presented at the 20th Annual Conference of the Ontario Educational Research Council, Toronto, Ontario, December 1-2, 1978]The most-reprinted book on the subject
- Read the landmark paper: A Novel Parallel Algorithm for Sparse Tensor Matrix Chain Multiplication via TCU-AccelerationCited 18 times
- Go sideways: Dynamic programmingA closely related topic
- Go sideways: Matrix multiplication algorithmA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
A Novel Parallel Algorithm for Sparse Tensor Matrix Chain Multiplication via TCU-Acceleration
Error Complexity Analysis of Algorithms for Matrix Multiplication and Matrix Chain Product
On Efficient Large Sparse Matrix Chain Multiplication
Faster quantum subroutine for matrix chain multiplication via Chebyshev approximation
Matrix-Chain Multiplication Based on Combinatorial Allosteric DNA Strand Displacement
Exploiting inter-operation parallelism for matrix chain multiplication using MapReduce
Enhanced Matrix Chain Multiplication
Matrix-Chain Multiplication Using Greedy and Divide-Conquer approach
🆕 Influential since 2022
đź“š Books worth reading
- 📕[Papers presented at the 20th Annual Conference of the Ontario Educational Research Council, Toronto, Ontario, December 1-2, 1978]Ontario Educational Research Council. Conference · 1966
Operations ManagementRoberta S. Russell, Bernard Taylor · 1998
Mathematical Methods in the Physical SciencesMary L. Boas, Mary Layne Boas · 1966
Data structures and algorithm analysis in CMark Allen Weiss · 1993
Digital planetGeorge Beekman, Ben Beekman · 2011
Data structures & algorithm analysis in JavaMark Allen Weiss · 1999
Engineering Modelling and AnalysisDavid Walker, Michael Leonard · 2009
The Jackknife and BootstrapJun Shao, Dongsheng Tu · 1995
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- Dynamic programming Dynamic programming (DP) is both a mathematical optimization method and an algorithmic paradigm. The method was developed by Richard Bellman in the 1950s…
- Matrix multiplication algorithm Because matrix multiplication is such a central operation in many numerical algorithms, much work has been invested in making matrix multiplication algorithms…
- Matrix multiplication In mathematics, specifically in linear algebra, matrix multiplication is a binary operation that produces a matrix from two matrices. For matrix multiplication…
- 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? Reported as unsolved in a source published in August 2026…
- Invertible matrix In linear algebra, an invertible matrix (non-singular, non-degenerate or regular) is a square matrix that has an inverse. In other words, if a matrix is…
- Exponentiation by squaring In mathematics and computer programming, exponentiating by squaring is a general method for fast computation of large positive integer powers of a number…
- List of numerical analysis topics This is a list of numerical analysis topics. Validated numerics Iterative method Rate of convergence — the speed at which a convergent sequence approaches…