Strassen矩阵乘法

• 矩阵相乘问题

  输入：A，B为n阶矩阵，n =$2^k$

  输出：C = AB

  通常矩阵乘法：

  C中有$n^2$个元素，每个元素需要做n次乘法，以元素相乘为基本运算，$W(n)=O(n^3)$

  • 简单的分治算法

    简单将矩阵分块，即

  $$\left(\begin{array}{cc}{A}_{11}& A_{12}\\ A_{21}& A_{22}\end{array}\right)\left(\begin{array}{cc}{B}_{11}& B_{12}\\ B_{21}& B_{22}\end{array}\right)=\left(\begin{array}{cc}{C}_{11}& C_{12}\\ C_{21}& C_{22}\end{array}\right)$$

  $$\begin{gathered} 其中C_{11}=A_{11}{B}_{11}+A_{12}{B}_{21} \\ {C}_{12}=A_{11}{B}_{12}+A_{12}{B}_{22} \\ {C}_{21}=A_{21}{B}_{11}+A_{22}{B}_{21} \\ {C}_{22}=A_{21}{B}_{12}+A_{22}{B}_{22} \\ 递推方程为W(n)=8W(\frac{n}{2})+O(n^2) \\ 解得W(n)=O(n^3) \end{gathered}$$

  • Strassen 矩阵乘法
    $$\begin{gathered} 设计M_1,\dots ,M_7,对应7个子问题 \\ {M}_1=A_{11}(B_{12}-B_{22}) \\ {M}_2=(A_{11}+A_{12})B_{22} \\ {M}_3=(A_{21}+A_{22})B_{11} \\ {M}_4=A_{22}(B_{21}-B_{11}) \\ {M}_5=(A_{11}+A_{22})(B_{11}+B_{22}) \\ {M}_6=(A_{12}-A_{22})(B_{21}+B_{22}) \\ {M}_7=(A_{11}-A_{21})(B_{11}+B_{22}) \end{gathered}$$
    利用中间矩阵，得到结果矩阵
    $$\begin{gathered} C_{11}=M_5+M_4-M_2+M_6 \\ {C}_{12}=M_1+M_2 \\ {C}_{21}=M_3+M_4 \\ {C}_{22}=M_5+M_1-M_3-M_7 \\ 时间复杂度为: \\ W(n)=7W(\frac{n}{2})+18(\frac{n}{2}{)}^2 \\ 其中一次矩阵加减法为(\frac{n}{2}{)}^2次加减法 \\ 解得W(n)=O(n^{\log 7}) \end{gathered}$$