Towards Practical Fast Matrix Multiplication based on Trilinear Aggregation
From MaRDI portal
Cites work
- A Strassen-like matrix multiplication suited for squaring and higher power computation
- A noncommutative algorithm for multiplying 3×3 matrices using 23 multiplications
- Gaussian elimination is not optimal
- Matrix multiplication via arithmetic progressions
- Matrix multiplication, a little faster
- Multiplying matrices faster than coppersmith-winograd
- New Fast Algorithms for Matrix Operations
- Noncommutative Bilinear Algorithms for 3 \times 3 Matrix Multiplication
- On Minimizing the Number of Multiplications Necessary for Matrix Multiplication
- On practical algorithms for accelerated matrix multiplication
- On the Additive Complexity of Matrix Multiplication
- On the Asymptotic Complexity of Matrix Multiplication
- On the additive complexity of 2 \(\times 2\) matrix multiplication
- On the arithmetic complexity of Strassen-like matrix multiplications
- Partial and Total Matrix Multiplication
- Pebbling Game and Alternative Basis for High Performance Matrix Multiplication
- Powers of tensors and fast matrix multiplication
- Probabilistic tensors and opportunistic Boolean matrix multiplication
- Relations between exact and approximate bilinear algorithms. Applications
- Some Properties of Disjoint Sums of Tensors Related to Matrix Multiplication
- Strassen's algorithm reloaded on GPUs
- The bilinear complexity and practical algorithms for matrix multiplication
- Trilinear aggregating with implicit canceling for a new acceleration of matrix multiplication
- \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication
Cited in
(5)- Correction of ‘ J. Laderman, V. Pan, X.–H. Sha, On practical Algorithms for Accelerated Matrix Multiplication, Linear Algebra and its Applications. Vol. 162-164 (1992) pp. 557-588 ’
- scientific article; zbMATH DE number 6511365 (Why is no real title available?)
- Pebbling Game and Alternative Basis for High Performance Matrix Multiplication
- The aggregation and cancellation techniques as a practical tool for faster matrix multiplication
- A new fast root-finder for black box polynomials
This page was built for publication: Towards Practical Fast Matrix Multiplication based on Trilinear Aggregation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6081940)
