Optimization techniques for small matrix multiplication
From MaRDI portal
Publication:533859
DOI10.1016/j.tcs.2010.12.012zbMath1211.68216OpenAlexW1989290453MaRDI QIDQ533859
Md. Nazrul Islam, Charles-Éric Drevet, Éric Schost
Publication date: 10 May 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.12.012
Related Items
Fast commutative matrix algorithms ⋮ Fast matrix multiplication and its algebraic neighbourhood ⋮ New ways to multiply \(3 \times 3\)-matrices ⋮ Numerical CP decomposition of some difficult tensors ⋮ Improved method for finding optimal formulas for bilinear maps in a finite field
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The aggregation and cancellation techniques as a practical tool for faster matrix multiplication
- Periodic GMP matrices
- How to multiply matrices faster
- Matrix multiplication via arithmetic progressions
- Trilinear aggregating with implicit canceling for a new acceleration of matrix multiplication
- On practical algorithms for accelerated matrix multiplication
- A noncommutative algorithm for multiplying 5 X 5 matrices using 103 multiplications
- The Magma algebra system. I: The user language
- On the complexity of the multiplication of matrices of small formats
- FFT-like multiplication of linear differential operators
- Beyond the Alder-Strassen bound.
- Complexity results for triangular sets
- 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
- How Can We Speed Up Matrix Multiplication?
- Noncommutative Bilinear Algorithms for $3 \times 3$ Matrix Multiplication
- The asymptotic spectrum of tensors.
- A non-commutative algorithm for multiplying 5 × 5 matrices using one hundred multiplications
- New Fast Algorithms for Matrix Operations
- Partial and Total Matrix Multiplication
- Fast solution of toeplitz systems of equations and computation of Padé approximants
- A noncommutative algorithm for multiplying 3×3 matrices using 23 multiplications
- A Uniform Approach for the Fast Computation of Matrix-Type Padé Approximants
- Degeneration and complexity of bilinear maps: Some asymptotic spectra.
- An algorithm for multiplying 3×3 matrices
- Products of ordinary differential operators by evaluation and interpolation
- A New Algorithm for Inner Product
- On Winograd's Algorithm for Inner Products
- On Minimizing the Number of Multiplications Necessary for Matrix Multiplication
- Automated empirical optimizations of software and the ATLAS project
