Optimization techniques for small matrix multiplication
From MaRDI portal
Publication:533859
DOI10.1016/J.TCS.2010.12.012zbMATH Open1211.68216OpenAlexW1989290453MaRDI QIDQ533859FDOQ533859
Authors: Charles-Éric Drevet, M. Nazrul Islam, É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
Recommendations
Cites Work
- The Magma algebra system. I: The user language
- Automated empirical optimizations of software and the ATLAS project
- FFT-like multiplication of linear differential operators
- Gaussian elimination is not optimal
- Partial and Total Matrix Multiplication
- Title not available (Why is that?)
- Products of ordinary differential operators by evaluation and interpolation
- How to multiply matrices faster
- Matrix multiplication via arithmetic progressions
- On multiplication of 2 \(\times\) 2 matrices
- Fast solution of toeplitz systems of equations and computation of Padé approximants
- A noncommutative algorithm for multiplying 3×3 matrices using 23 multiplications
- A New Algorithm for Inner Product
- Beyond the Alder-Strassen bound.
- New Fast Algorithms for Matrix Operations
- The aggregation and cancellation techniques as a practical tool for faster matrix multiplication
- Complexity results for triangular sets
- A Uniform Approach for the Fast Computation of Matrix-Type Padé Approximants
- On the complexity of the multiplication of matrices of small formats
- On Winograd's Algorithm for Inner Products
- On Minimizing the Number of Multiplications Necessary for Matrix Multiplication
- Degeneration and complexity of bilinear maps: Some asymptotic spectra.
- 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
- Error analysis of algorithms for matrix multiplication and triangular decomposition using Winograd's identity
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- An algorithm for multiplying 3×3 matrices
- Periodic GMP matrices
Cited In (6)
- Fast matrix multiplication and its algebraic neighbourhood
- New ways to multiply \(3 \times 3\)-matrices
- Improved method for finding optimal formulas for bilinear maps in a finite field
- Fast commutative matrix algorithms
- The tensor Rank of \(5 \times 5\) matrices multiplication is bounded by 98 andits border Rank by 89
- Numerical CP decomposition of some difficult tensors
Uses Software
This page was built for publication: Optimization techniques for small matrix multiplication
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q533859)
