Strassen's algorithm is not optimal trilinear technique of aggregating, uniting and canceling for constructing fast algorithms for matrix operations

Authors:
V. Ya. Pan
Affiliations:
-
Venue:
SFCS '78 Proceedings of the 19th Annual Symposium on Foundations of Computer Science
Year:
1978

Citing 0
Cited 8

Security-Related Comments Regarding McEliece's Public-Key Cryptosystem

CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Application of Approximating Algorithms to Boolean Matrix Multiplication

IEEE Transactions on Computers
Massively Parallel Searching for Better Algorithms or How to Do a Cross Product with Five Multiplications

Scientific Programming
Adaptive Winograd's matrix multiplications

ACM Transactions on Mathematical Software (TOMS)
Fast hybrid matrix multiplication algorithms

Cybernetics and Systems Analysis
Exploiting parallelism in matrix-computation kernels for symmetric multiprocessor systems: Matrix-multiplication and matrix-addition algorithm optimizations by software pipelining and threads allocation

ACM Transactions on Mathematical Software (TOMS)
Multiplying matrices faster than coppersmith-winograd

STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Technical Note: A fast parallel Gauss Jordan algorithm for matrix inversion using CUDA

Computers and Structures

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new technique of trilinear operations of aggregating, uniting and canceling is introduced and applied to constructing fast linear non-commutative algorithms for matrix multiplication. The result is an asymptotic improvement of Strassen's famous algorithms for matrix operations.