scientific article; zbMATH DE number 4018239
From MaRDI portal
Publication:3030129
Recommendations
- A non-commutative algorithm for multiplying 5 × 5 matrices using one hundred multiplications
- A noncommutative algorithm for multiplying 5\(\times 5\) matrices using 102 multiplications
- 10.1007/s11470-008-2002-6
- A non-commutative \(F_5\) algorithm with an application to the computation of Loewy layers.
- Noncommutative Bilinear Algorithms for 3 \times 3 Matrix Multiplication
- Strassen's matrix multiplication algorithm for matrices of arbitrary order
- On the complexity of some algorithms of matrix multiplication
- An effective algorithm for multiplication of a circulant matrix of large dimension by a column
- Nonlinear transformations of the matrix multiplication algorithm
Cited in
(5)- A noncommutative algorithm for multiplying 5\(\times 5\) matrices using 102 multiplications
- The bilinear complexity and practical algorithms for matrix multiplication
- Numerical CP decomposition of some difficult tensors
- On bilinear complexity of multiplication of \(m\times 2\) and \(2\times 2\) matrices
- The tensor Rank of \(5 \times 5\) matrices multiplication is bounded by 98 andits border Rank by 89
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3030129)
