Noncommutative Bilinear Algorithms for $3 \times 3$ Matrix Multiplication
From MaRDI portal
Publication:3759936
DOI10.1137/0215043zbMath0622.68037MaRDI 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
computational complexity; Strassen's algorithm; 3\(\times 3\) matrix multiplication; infinite family of noncommutative bilinear algorithms
68Q25: Analysis of algorithms and problem complexity
68W30: Symbolic computation and algebraic computation
15A99: Basic linear algebra
68W99: Algorithms in computer science
Related Items
Fast matrix multiplication and its algebraic neighbourhood, 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, Optimization techniques for small matrix multiplication, On the complexity of the multiplication of matrices of small formats, The geometry of rank decompositions of matrix multiplication. II: \(3 \times 3\) matrices, Two bilinear \((3\times3)\)-matrix multiplication algorithms of complexity 25, Equivalent polyadic decompositions of matrix multiplication tensors, New ways to multiply \(3 \times 3\)-matrices, On the inequivalence of bilinear algorithms for \(3\times 3\) matrix multiplication, Improving the Numerical Stability of Fast Matrix Multiplication, The bilinear complexity and practical algorithms for matrix multiplication
