Trilinear aggregating with implicit canceling for a new acceleration of matrix multiplication
From MaRDI portal
Publication:1158927
DOI10.1016/0898-1221(82)90037-2zbMath0474.65024OpenAlexW2133908755MaRDI QIDQ1158927
Publication date: 1982
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0898-1221(82)90037-2
Related Items
On Matrices With Displacement Structure: Generalized Operators and Faster Algorithms, Fast Cauchy sum algorithms for polynomial zeros and matrix eigenvalues, Towards Practical Fast Matrix Multiplication based on Trilinear Aggregation, Pebbling Game and Alternative Basis for High Performance Matrix Multiplication, Fast matrix multiplication and its algebraic neighbourhood, Fast matrix multiplication without APA-algorithms, Optimization techniques for small matrix multiplication, Combinatorial analysis (nonnegative matrices, algorithmic problems), The techniques of trilinear aggregating and the recent progress in the asymptotic acceleration of matrix operations
Cites Work
- On varieties of optimal algorithms for the computation of bilinear mappings. I. The isotropy group of a bilinear mapping
- Relations between exact and approximate bilinear algorithms. Applications
- New combinations of methods for the acceleration of matrix multiplication
- \(0(n^{2.7799})\) complexity for \(n\times n\) approximate matrix multiplication
- Gaussian elimination is not optimal
- On the algebraic complexity of inner product
- 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
- Algebras Having Linear Multiplicative Complexities
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
