Optimization techniques for small matrix multiplication
From MaRDI portal
(Redirected from Publication:533859)
Recommendations
Cites work
- scientific article; zbMATH DE number 4073166 (Why is no real title available?)
- scientific article; zbMATH DE number 3738912 (Why is no real title available?)
- scientific article; zbMATH DE number 3480094 (Why is no real title available?)
- scientific article; zbMATH DE number 3551895 (Why is no real title available?)
- scientific article; zbMATH DE number 976329 (Why is no real title available?)
- A New Algorithm for Inner Product
- A Uniform Approach for the Fast Computation of Matrix-Type Padé Approximants
- A non-commutative algorithm for multiplying 5 × 5 matrices using one hundred multiplications
- A noncommutative algorithm for multiplying 3×3 matrices using 23 multiplications
- A noncommutative algorithm for multiplying 5 X 5 matrices using 103 multiplications
- An algorithm for multiplying 3×3 matrices
- Automated empirical optimizations of software and the ATLAS project
- Beyond the Alder-Strassen bound.
- Complexity results for triangular sets
- Degeneration and complexity of bilinear maps: Some asymptotic spectra.
- Error analysis of algorithms for matrix multiplication and triangular decomposition using Winograd's identity
- FFT-like multiplication of linear differential operators
- Fast solution of toeplitz systems of equations and computation of Padé approximants
- Gaussian elimination is not optimal
- How Can We Speed Up Matrix Multiplication?
- How to multiply matrices faster
- Matrix multiplication via arithmetic progressions
- 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 Winograd's Algorithm for Inner Products
- On multiplication of 2 2 matrices
- On practical algorithms for accelerated matrix multiplication
- On the complexity of the multiplication of matrices of small formats
- Partial and Total Matrix Multiplication
- Periodic GMP matrices
- Products of ordinary differential operators by evaluation and interpolation
- The Magma algebra system. I: The user language
- The aggregation and cancellation techniques as a practical tool for faster matrix multiplication
- The asymptotic spectrum of tensors.
- Trilinear aggregating with implicit canceling for a new acceleration of matrix multiplication
Cited in
(7)- New ways to multiply \(3 \times 3\)-matrices
- Fast matrix multiplication and its algebraic neighbourhood
- Improved method for finding optimal formulas for bilinear maps in a finite field
- Fast commutative matrix algorithms
- Optimization techniques for small matrix multiplication
- Numerical CP decomposition of some difficult tensors
- The tensor Rank of \(5 \times 5\) matrices multiplication is bounded by 98 andits border Rank by 89
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)
