Two bilinear \((3\times3)\)-matrix multiplication algorithms of complexity 25

DOI10.3103/S027864191801003XzbMath1397.65066OpenAlexW2790877368MaRDI QIDQ1789204

G. N. Shumkin, B. V. Chokaev

Publication date: 10 October 2018

Published in: Moscow University Computational Mathematics and Cybernetics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3103/s027864191801003x

zbMATH Keywords

matrix multiplicationbilinear complexityStrassen algorithm

Mathematics Subject Classification ID

Basic linear algebra (15A99) Numerical linear algebra (65F99)

Related Items (2)

Unnamed Item ⋮ Improved method for finding optimal formulas for bilinear maps in a finite field

Cites Work

• Unnamed Item
• On the exact and approximate bilinear complexities of multiplication of \(4\times 2\) and \(2\times 2\) matrices
• On varieties of optimal algorithms for the computation of bilinear mappings. I. The isotropy group of a bilinear mapping
• On the complexity of the multiplication of matrices of small formats
• Gaussian elimination is not optimal
• Powers of tensors and fast matrix multiplication
• All pairs shortest paths using bridging sets and rectangular matrix multiplication
• On the complexity of some algorithms of matrix multiplication
• Noncommutative Bilinear Algorithms for $3 \times 3$ Matrix Multiplication
• A noncommutative algorithm for multiplying 3×3 matrices using 23 multiplications
• On Minimizing the Number of Multiplications Necessary for Matrix Multiplication

This page was built for publication: Two bilinear \((3\times3)\)-matrix multiplication algorithms of complexity 25