A Tensor Product Formulation of Strassen's Matrix Multiplication Algorithm with Memory Reduction
In this article, we present a program generation strategy of Strassen's matrix multiplication algorithm using a programming methodology based on tensor product formulas. In this methodology, block recursive programs such as the fast Fourier Transforms and Strassen's matrix multiplication a...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi Limited
1995-01-01
|
| Series: | Scientific Programming |
| Online Access: | http://dx.doi.org/10.1155/1995/636457 |