ISSN:
1573-0484
Keywords:
Strassen's algorithm
;
fast matrix multiplication
;
linear systems
;
LAPACK
;
vector computers
;
AMS Subject Classification 65F05
;
65F30
;
68A20
;
CR Subject Classification F.2.1
;
G.1.3
;
G.4
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
Notes:
Abstract Strassen's algorithm for fast matrix-matrix multiplication has been implemented for matrices of arbitrary shapes on the CRAY-2 and CRAY Y-MP supercomputers. Several techniques have been used to reduce the scratch space requirement for this algorithm while simultaneously preserving a high level of performance. When the resulting Strassen-based matrix multiply routine is combined with some routines from the new LAPACK library, LU decomposition can be performed with rates significantly higher than those achieved by conventional means. We succeeded in factoring a 2048 × 2048 matrix on the CRAY Y-MP at a rate equivalent to 325 MFLOPS.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF00129836
Permalink
