Laderman matrix multiplication algorithm can be constructed using Strassen algorithm and related tensor's isotropies

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

paper · pdf · doi:10.48550/arxiv.1703.08298

openalex publication_date 2017/03/24 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In 1969, V. Strassen improves the classical~2x2 matrix multiplication algorithm. The current upper bound for 3x3 matrix multiplication was reached by J.B. Laderman in 1976. This note presents a geometric relationship between Strassen and Laderman algorithms. By doing so, we retrieve a geometric formulation of results very similar to those presented by O. Sykora in 1977.

Citations

• Matrix multiplication algorithms from group orbits
• The geometry of rank decompositions of matrix multiplication I: 2x2\n matrices

Cited by

• A non-commutative algorithm for multiplying 4x4 matrices using 48 non-complex multiplications
• New ways to multiply 3 x 3-matrices

Related

• Symmetries of matrix multiplication algorithms. I
• Strassen 2×2 Matrix Multiplication from a 3-dimensional Volume Form
• Matrix Multiplication with Less Arithmetic Complexity and IO Complexity
• Designing Strassen's algorithm
• Limits on the Universal Method for Matrix Multiplication