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

2017/07/18 by Alexandre Sedoglavic, Sedoglavic, Alexandre
Computer Science · Engineering · #Coding theory and cryptography #graph theory and CDMA systems #Cellular Automata and Applications

paper · pdf · doi:10.48550/arxiv.1707.06860

Abstract

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.

Related

• The tensor rank of 5x5 matrices multiplication is bounded by 98 and its\n border rank by 89
• A non-commutative algorithm for multiplying (7 \× 7) matrices\n using 250 multiplications
• The FBHHRBNRSSSHK-Algorithm for Multiplication in ℤ₂^5×5 is still not the end of the story
• A more accurate rational non-commutative algorithm for multiplying 4x4 matrices using 48 multiplications
• A non-commutative algorithm for multiplying 4x4 matrices using 48 non-complex multiplications