On the inequivalence of bilinear algorithms for \(3\times 3\) matrix multiplication
From MaRDI portal
Publication:2444860
DOI10.1016/j.ipl.2013.05.011zbMath1285.65023OpenAlexW2034366957MaRDI QIDQ2444860
Publication date: 11 April 2014
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2013.05.011
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (4)
A normal form for matrix multiplication schemes ⋮ Fast matrix multiplication and its algebraic neighbourhood ⋮ New ways to multiply \(3 \times 3\)-matrices ⋮ Equivalent polyadic decompositions of matrix multiplication tensors
Cites Work
- On varieties of optimal algorithms for the computation of bilinear mappings. I. The isotropy group of a bilinear mapping
- On varieties of optimal algorithms for the computation of bilinear mappings. II. Optimal algorithms for \(2\times 2\)-matrix multiplication
- On the complexity of the multiplication of matrices of small formats
- Gaussian elimination is not optimal
- Error analysis of algorithms for matrix multiplication and triangular decomposition using Winograd's identity
- On multiplication of 2 \(\times\) 2 matrices
- 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 the Number of Multiplications Required for Matrix Multiplication
- Multiplying matrices faster than coppersmith-winograd
- On Minimizing the Number of Multiplications Necessary for Matrix Multiplication
This page was built for publication: On the inequivalence of bilinear algorithms for \(3\times 3\) matrix multiplication
