Trilinear aggregating with implicit canceling for a new acceleration of matrix multiplication
From MaRDI portal
Publication:1158927
DOI10.1016/0898-1221(82)90037-2zbMath0474.65024MaRDI 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
trilinear aggregating; acceleration of matrix multiplication; implicit canceling; Strassens algorithm
Related Items
Optimization techniques for small matrix multiplication, The techniques of trilinear aggregating and the recent progress in the asymptotic acceleration of matrix operations, Combinatorial analysis (nonnegative matrices, algorithmic problems), Fast matrix multiplication without APA-algorithms
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
