USING STRASSEN ALGORITHM TO ACCELERATE THE SOLUTION OF LINEAR-SYSTEMS

被引：15

作者：

BAILEY, DH ^{[1
]}

LEE, K ^{[1
]}

SIMON, HD ^{[1
]}

机构：

[1] CALIF STATE UNIV,DEPT COMP SCI,BAKERSFIELD,CA 93309

来源：

JOURNAL OF SUPERCOMPUTING | 1991年 / 4卷 / 04期

关键词：

65F30; 68A20; AMS Subject Classification 65F05; CR Subject Classification F.2.1; fast matrix multiplication; G.1.3; G.4; LAPACK; linear systems; Strassen's algorithm; vector computers;

D O I：

10.1007/BF00129836

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

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 x 2048 matrix on the CRAY Y-MP at a rate equivalent to 325 MFLOPS.

引用

页码：357 / 371

页数：15