The well known algorithm of Volker Strassen for matrix multiplication can only be used for $(m2^k \times m2^k)$ matrices. For arbitrary $(n \times n)$ matrices one has to add zero rows and columns to the given matrices to use Strassen's algorithm. Strassen gave a strategy of how to set $m$ and $k$ for arbitrary $n$ to ensure $n\leq m2^k$. In this paper we study the number $d$ of additional zero rows and columns and the influence on the number of flops used by the algorithm in the worst case ($d=n/16$), best case ($d=1$) and in the average case ($d\approx n/48$). The aim of this work is to give a detailed analysis of the number of additional zero rows and columns and the additional work caused by Strassen's bad parameters. Strassen used the parameters $m$ and $k$ to show that his matrix multiplication algorithm needs less than $4.7n^{\log_2 7}$ flops. We can show in this paper, that these parameters cause an additional work of approx. 20 % in the worst case in comparison to the optimal strategy for the worst case. This is the main reason for the search for better parameters.
Strong Scaling of Matrix Multiplication Algorithms and Memory-Independent Communication Lower Bounds
如果并行算法在P个处理机上的运行时间是1/P线性的,包括所有的通信开销,则该并行算法具有完美的强标度性。具有完美强标度的矩阵乘法的分布式内存并行算法最近才被发现。一种是基于经典矩阵乘法(Solomonik and Demmel,2011),另一种是基于Strassen的快速矩阵乘法(Ballard,Demmel,Holtz,Lipshitz,and Schwartz,2012)。这两种算法都可以完美地扩展,但只能扩展到处理器间通信不再扩展的处理器数量。我们得到了一个内存独立的通信成本的经典和基于Strassen的分布式存储矩阵乘法算法的下界。这些界限意味着,没有经典的或基于Strassen的并行矩阵乘法算法可以强大的规模完全超出上述两个并行算法已经达到的范围。记忆无关的边界和强缩放边界推广到其他算法。
Hierarchical Matrices with Tucker Blocks: Construction and Forward Evaluation
School of Mathematical Sciences, Fudan University(复旦大学数学科学学院);Shanghai Key Laboratory for Contemporary Applied Mathematics, Fudan University(复旦大学当代应用数学上海市重点实验室)
Iterative Refinement for a Subset of Eigenvectors of Symmetric Matrices via Matrix Multiplications
Research Institute for Science and Engineering, Waseda University(早稻田大学理工学研究科);Department of Mathematical Sciences, Shibaura Institute of Technology(埼玉工业大学数学科学系);RIKEN Center for Computational Science(理化学研究所计算科学中心);Department of Applied Mathematics, Faculty of Science and Engineering, Waseda University(早稻田大学理工学部应用数学系)
Fast Matrix Multiplication in fp8: Certified Coefficient Optimization and Measured Error
Beijing Tongming Lake Information Technology Application Innovation Center (TLAIC)(北京通明湖信息技术应用创新中心);Fudan University Institute of Systems for Advanced Computing(复旦大学先进计算系统研究院);Harbin Institute of Technology(哈尔滨工业大学);Key Lab of HCST (PKU), MOE(北京大学高可信软件技术教育部重点实验室;北京大学计算机学院);SCS, Peking University(上海开放计算系统研究院);Shanghai Institute of Systems for Open Computing
A theoretical contribution to the fast implementation of null linear discriminant analysis method using random matrix multiplication with scatter matrices
Jiangsu Normal University(江苏师范大学);China University of Mining and Technology(中国矿业大学)