Sign inSign in
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.
as Erik Demaine defines itMITThe wording closest to all 4 definitions
Watch it explained

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

4

Each in their own terms, from the easiest level.

  • Charles Leiserson

    MIT · Undergraduate

    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.
    • 50:00Introduction and Matrix Multiplication
  • Julian Shun

    MIT · Undergraduate

    A recursive algorithm for multiplying matrices that splits them into quadrants and performs eight recursive multiplications followed by additions.
    • 30:08Parallel Storage Allocation
  • Charles Leiserson & Julian Shun

    MIT · Undergraduate

    A recursive algorithm that multiplies two matrices by splitting them into four submatrices and recursively computing sub-products in parallel.
    • 1:13:07Analysis of Multithreaded Algorithms

Connections

8

The lectures that define it or assume it, and the concepts next to it.

Concepts4

Lectures4

4 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.