New ways to multiply 3 x 3-matrices

05/24/2019
by   Marijn J. H. Heule, et al.
0

It is known since the 1970s that no more than 23 multiplications are required for computing the product of two 3 x 3-matrices. It is not known whether this can also be done with fewer multiplications. However, there are several mutually inequivalent ways of doing the job with 23 multiplications. In this article, we extend this list considerably by providing more than 13 000 new and mutually inequivalent schemes for multiplying 3 x 3-matrices using 23 multiplications. Moreover, we show that the set of all these schemes is a manifold of dimension at least 17.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/08/2022

The FBHHRBNRSSSHK-Algorithm for Multiplication in ℤ_2^5×5 is still not the end of the story

In response to a recent Nature article which announced an algorithm for ...
research
07/01/2020

Density of diagonalizable matrices in sets of structured matrices defined from indefinite scalar products

For an (indefinite) scalar product [x,y]_B = x^HBy for B= ± B^H ∈ Gl_n(ℂ...
research
03/27/2019

Local Search for Fast Matrix Multiplication

Laderman discovered a scheme for computing the product of two 3x3 matric...
research
06/15/2023

Digital signature schemes using non-square matrices or scrap automorphisms

We offer two very transparent digital signature schemes: one using non-s...
research
01/01/2018

Computation of Maximal Determinants of Binary Circulant Matrices

We describe algorithms for computing maximal determinants of binary circ...
research
02/03/2016

Computing with quasiseparable matrices

The class of quasiseparable matrices is defined by a pair of bounds, cal...
research
10/06/2021

A logical approach for temporal and multiplex networks analysis

Many systems generate data as a set of triplets (a, b, c): they may repr...

Please sign up or login with your details

Forgot password? Click here to reset