New Fast Algorithms for Matrix Operations
Victor Ya. Pan · SIAM Journal on Computing · 1980
A new technique of trilinear operations of aggregating, uniting and canceling is introduced and applied to constructing fast linear noncommutative algorithms for matrix multiplication. The result is an asymptotic improvement of Strassen’s famous algorithms for matrix operations.
Cited by 80 works. doi:10.1137/0209027
Authors
References
- The Design and Analysis of Computer Algorithms
- Gaussian elimination is not optimal
- A New Algorithm for Inner Product
- THE COMPUTATIONAL COMPLEXITY OF ALGEBRAIC AND NUMERIC PROBLEMS.
- On the number of multiplications necessary to compute certain functions
- Duality Applied to the Complexity of Matrix Multiplication and Other Bilinear Forms
- Strassen's algorithm is not optimal trilinear technique of aggregating, uniting and canceling for constructing fast algorithms for matrix operations
- On Minimizing the Number of Multiplications Necessary for Matrix Multiplication
- On multiplication of 2 × 2 matrices
- Evaluation of Rational Functions