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

2017/07/13 by Alexandre Sedoglavic, Sedoglavic, Alexandre · 2 citations
Computer Science · Engineering · Mathematics · #Algorithms and Data Compression #Coding theory and cryptography #FOS: Computer and information sciences #Symbolic Computation (cs.SC) #Tensor decomposition and applications #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.1712.07935

openalex publication_date 2017/07/13 · openalex created_date 2017/07/31 · openalex updated_date 2026/07/28

Abstract

We present a non-commutative algorithm for multiplying (7x7) matrices using\n250 multiplications and a non-commutative algorithm for multiplying (9x9)\nmatrices using 520 multiplications. These algorithms are obtained using the\nsame divide-and-conquer technique.\n

Cited by

• Exploring the Meta Flip Graph for Matrix Multiplication
• Towards Faster Feasible Matrix Multiplication by Trilinear Aggregation

Related

• A non-commutative algorithm for multiplying 5x5 matrices using 99 multiplications
• Some New Non-Commutative Matrix Multiplication Algorithms of Size (n,m,6)
• A non-commutative algorithm for multiplying 4x4 matrices using 48 non-complex multiplications
• Fast Commutative Matrix Algorithm
• A more accurate rational non-commutative algorithm for multiplying 4x4 matrices using 48 multiplications