Towards Practical Fast Matrix Multiplication based on Trilinear Aggregation
From MaRDI portal
Publication:6081940
DOI10.1145/3597066.3597099OpenAlexW4383221959MaRDI QIDQ6081940
Publication date: 3 November 2023
Published in: Proceedings of the 2023 International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3597066.3597099
bilinear algorithmsmatrix multiplicationfast basis transformationfast recursive transformationtrilinear aggregation
Related Items
Cites Work
- Matrix sparsification and the sparse null space problem
- On the arithmetic complexity of Strassen-like matrix multiplications
- On the additive complexity of 2 \(\times 2\) matrix multiplication
- Matrix multiplication via arithmetic progressions
- Relations between exact and approximate bilinear algorithms. Applications
- Trilinear aggregating with implicit canceling for a new acceleration of matrix multiplication
- On practical algorithms for accelerated matrix multiplication
- \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication
- Gaussian elimination is not optimal
- The bilinear complexity and practical algorithms for matrix multiplication
- A Strassen-like matrix multiplication suited for squaring and higher power computation
- Powers of tensors and fast matrix multiplication
- Noncommutative Bilinear Algorithms for $3 \times 3$ Matrix Multiplication
- New Fast Algorithms for Matrix Operations
- 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
- On the Additive Complexity of Matrix Multiplication
- Strassen’s Algorithm Reloaded on GPUs
- Matrix Multiplication, a Little Faster
- Probabilistic Tensors and Opportunistic Boolean Matrix Multiplication
- Multiplying matrices faster than coppersmith-winograd
- On Minimizing the Number of Multiplications Necessary for Matrix Multiplication
- Pebbling Game and Alternative Basis for High Performance Matrix Multiplication
