Noncommutative Bilinear Algorithms for $3 \times 3$ Matrix Multiplication

DOI10.1137/0215043zbMath0622.68037OpenAlexW1992111571MaRDI QIDQ3759936

Rodney W. Johnson, Aileen M. McLoughlin

Publication date: 1986

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0215043

zbMATH Keywords

computational complexityStrassen's algorithm3\(\times 3\) matrix multiplicationinfinite family of noncommutative bilinear algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Basic linear algebra (15A99) Algorithms in computer science (68W99)

Related Items (13)

The bilinear complexity and practical algorithms for matrix multiplication ⋮ On the complexity of the multiplication of matrices of small formats ⋮ Towards Practical Fast Matrix Multiplication based on Trilinear Aggregation ⋮ Pebbling Game and Alternative Basis for High Performance Matrix Multiplication ⋮ A normal form for matrix multiplication schemes ⋮ Fast matrix multiplication and its algebraic neighbourhood ⋮ On the inequivalence of bilinear algorithms for \(3\times 3\) matrix multiplication ⋮ New ways to multiply \(3 \times 3\)-matrices ⋮ The geometry of rank decompositions of matrix multiplication. II: \(3 \times 3\) matrices ⋮ Optimization techniques for small matrix multiplication ⋮ Two bilinear \((3\times3)\)-matrix multiplication algorithms of complexity 25 ⋮ Improving the Numerical Stability of Fast Matrix Multiplication ⋮ Equivalent polyadic decompositions of matrix multiplication tensors

This page was built for publication: Noncommutative Bilinear Algorithms for $3 \times 3$ Matrix Multiplication