Matrix Multiplication with Less Arithmetic Complexity and IO Complexity

03/30/2022
by   Pu Wu, et al.
0

After Strassen presented the first sub-cubic matrix multiplication algorithm, many Strassen-like algorithms are presented. Most of them with low asymptotic cost have large hidden leading coefficient which are thus impractical. To reduce the leading coefficient, Cenk and Hasan give a general approach reducing the leading coefficient of <2,2,2;7>-algorithm to 5 but increasing IO complexity. In 2017, Karstadt and Schwartz also reduce the leading coefficient of <2,2,2;7>-algorithm to 5 by the Alternative Basis Matrix Multiplication method. Meanwhile, their method reduces the IO complexity and low-order monomials in arithmetic complexity. In 2019, Beniamini and Schwartz generalize Alternative Basis Matrix Multiplication method reducing leading coefficient in arithmetic complexity but increasing IO complexity. In this paper, we propose a new matrix multiplication algorithm which reduces leading coefficient both in arithmetic complexity and IO complexity. We apply our method to Strassen-like algorithms improving arithmetic complexity and IO complexity (the comparison with previous results are shown in Tables 1 and 2). Surprisingly, our IO complexity of <3,3,3;23>-algorithm is 14n^log_323M^-1/2 + o(n^log_323) which breaks Ballard's IO complexity low bound (Ω(n^log_323M^1-log_323/2)) for recursive Strassen-like algorithms.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/09/2020

Sparsifying the Operators of Fast Matrix Multiplication Algorithms

Fast matrix multiplication algorithms may be useful, provided that their...
research
06/01/2023

Some New Non-Commutative Matrix Multiplication Algorithms of Size (n,m,6)

For various 2≤ n,m ≤ 6, we propose some new algorithms for multiplying a...
research
12/11/2017

StrassenNets: Deep learning with a multiplication budget

A large fraction of the arithmetic operations required to evaluate deep ...
research
10/10/2022

Fault-Tolerant Strassen-Like Matrix Multiplication

In this study, we propose a simple method for fault-tolerant Strassen-li...
research
06/06/2023

Generalized Pseudospectral Shattering and Inverse-Free Matrix Pencil Diagonalization

We present a randomized, inverse-free algorithm for producing an approxi...
research
11/23/2017

Markov chain Hebbian learning algorithm with ternary synaptic units

In spite of remarkable progress in machine learning techniques, the stat...

Please sign up or login with your details

Forgot password? Click here to reset