A non-commutative algorithm for multiplying 5x5 matrices using 99 multiplications

07/18/2017
by   Alexandre Sedoglavic, et al.
0

We present a non-commutative algorithm for multiplying 5x5 matrices using 99 multiplications. This algorithm is a minor modification of Makarov's algorithm which exhibit the previous best known bound with 100 multiplications.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/21/2017

A non-commutative algorithm for multiplying (7 × 7) matrices using 250 multiplications

We present a non-commutative algorithm for multiplying (7x7) matrices us...
research
02/06/2018

Computing Popov and Hermite forms of rectangular polynomial matrices

We consider the computation of two normal forms for matrices over the un...
research
03/17/2017

Roots multiplicity without companion matrices

We show a method for constructing a polynomial interpolating roots' mult...
research
10/06/2019

Clustering case statements for indirect branch predictors

We present an O(nlogn) algorithm to compile a switch statement into jump...
research
01/29/2021

The tensor rank of 5x5 matrices multiplication is bounded by 98 and its border rank by 89

We present a non-commutative algorithm for the product of 3x5 by 5x5 mat...
research
05/14/2020

A new WENO-2r algorithm with progressive order of accuracy close to discontinuities

In this article we present a modification of the algorithm for data disc...
research
08/04/2021

Explicit RIP matrices: an update

Leveraging recent advances in additive combinatorics, we exhibit explici...

Please sign up or login with your details

Forgot password? Click here to reset