ConceptSystems & CS
Divide and conquer matrix multiplication
A recursive algorithm for multiplying matrices by subdividing them into blocks and arranging their layouts consecutively in memory.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Lecturers
4Each in their own terms, from the easiest level.
Charles Leiserson
A recursive approach to matrix multiplication that uses a base case threshold below which standard matrix multiplication is used, and divide and conquer above it.Julian Shun
A recursive algorithm for multiplying matrices that splits them into quadrants and performs eight recursive multiplications followed by additions.Charles Leiserson & Julian Shun
A recursive algorithm that multiplies two matrices by splitting them into four submatrices and recursively computing sub-products in parallel.
Connections
8The lectures that define it or assume it, and the concepts next to it.