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 algorithm a...
Saved in:
| Published in: | Scientific programming Vol. 4; no. 4; pp. 275 - 289 |
|---|---|
| Main Authors: | , , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Egypt
Hindawi Publishing Corporation
17.04.1995
|
| ISSN: | 1058-9244, 1875-919X |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!