Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Let $A$ and $B$ be $n \times n$ matrices. Strassen's algorithm for multiplication works on a partitioning of $A$ and $B$ into $2^2$ submatrices each. Is there any generalization of Strassen's algorithm where the partitioning is done into, say, $k^2$ submatrices?

Note: What I mean by a $3^2$ partitioning of $A$ is: $$A = \left(\begin{array}{ccc} A_{1,1} & A_{1,2} & A_{1,3} \\ A_{2,1} & A_{2,2} & A_{2,3} \\ A_{3,1} & A_{3,2} & A_{3,3} \end{array} \right) $$ where each of $A_{i,j}$ is an $\frac{n}{3} \times \frac{n}{3}$ matrix.

share|cite|improve this question
up vote 3 down vote accepted

Yes, in some cases. See e.g.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.