Noncommutative Bilinear Algorithms for 3 \times 3 Matrix Multiplication

DOI10.1137/0215043zbMATH Open0622.68037OpenAlexW1992111571MaRDI QIDQ3759936FDOQ3759936

Authors: 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

Recommendations

• On the inequivalence of bilinear algorithms for \(3\times 3\) matrix multiplication
• Two bilinear \((3\times3)\)-matrix multiplication algorithms of complexity 25
• The bilinear complexity and practical algorithms for matrix multiplication
• New ways to multiply \(3 \times 3\)-matrices
• On practical algorithms for accelerated matrix multiplication

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)

Cited In (16)

• Equivalent polyadic decompositions of matrix multiplication tensors
• The geometry of rank decompositions of matrix multiplication. II: \(3 \times 3\) matrices
• Fast matrix multiplication and its algebraic neighbourhood
• New ways to multiply \(3 \times 3\)-matrices
• The bilinear complexity and practical algorithms for matrix multiplication
• Towards Practical Fast Matrix Multiplication based on Trilinear Aggregation
• Pebbling Game and Alternative Basis for High Performance Matrix Multiplication
• On transformations of algorithms to multiply 2\(\times 2\) matrices
• Title not available (Why is that?)
• A noncommutative algorithm for multiplying 5\(\times 5\) matrices using 102 multiplications
• On the complexity of the multiplication of matrices of small formats
• Improving the numerical stability of fast matrix multiplication
• Optimization techniques for small matrix multiplication
• On the inequivalence of bilinear algorithms for \(3\times 3\) matrix multiplication
• A normal form for matrix multiplication schemes
• Two bilinear \((3\times3)\)-matrix multiplication algorithms of complexity 25

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3759936)