A tensor product formulation of Strassen´s matrix multiplication algorithm with memory reduction

A programming methodology based on tensor products has been used for designing and implementing block recursive algorithms for parallel and vector multiprocessors. A previous tensor product formulation of Strassen´s matrix multiplication algorithm requires working arrays of size O(7ⁿ) for multiplying 2ⁿ×2ⁿ matrices. The authors present a modified tensor product formulation of Strassen´s algorithm in which the size of working arrays can be reduced to O(4ⁿ). The modified formulation exhibits sufficient parallel and vector operations for efficient implementation. Performance results on the Cray Y-MP are presented