Fast commutative matrix algorithms
From MaRDI portal
Publication:2156374
DOI10.1016/J.JSC.2022.05.002OpenAlexW4281400593WikidataQ114154436 ScholiaQ114154436MaRDI QIDQ2156374
Publication date: 18 July 2022
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1904.07683
Related Items (2)
A normal form for matrix multiplication schemes ⋮ Generic polynomial algorithms for the knapsack problem in some matrix semigroups
Cites Work
- Unnamed Item
- Optimization techniques for small matrix multiplication
- Matrix multiplication via arithmetic progressions
- Relations between exact and approximate bilinear algorithms. Applications
- \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication
- On the complexity of the multiplication of matrices of small formats
- Fast computation of discrete invariants associated to a differential rational mapping
- Gaussian elimination is not optimal
- On multiplication of 2 \(\times\) 2 matrices
- Improved bound for complexity of matrix multiplication
- The bilinear complexity and practical algorithms for matrix multiplication
- Powers of tensors and fast matrix multiplication
- Partial and Total Matrix Multiplication
- Some Properties of Disjoint Sums of Tensors Related to Matrix Multiplication
- On the Asymptotic Complexity of Matrix Multiplication
- A noncommutative algorithm for multiplying 3×3 matrices using 23 multiplications
- An algorithm for multiplying 3×3 matrices
- On fast multiplication of a matrix by its transpose
- Multiplying matrices faster than coppersmith-winograd
- On Winograd's Algorithm for Inner Products
- On Minimizing the Number of Multiplications Necessary for Matrix Multiplication
This page was built for publication: Fast commutative matrix algorithms
