Massively parallel searching for better algorithms

Technical Report · Tue Dec 01 00:00:00 EST 1992

OSTI ID:10136552

Gustafson, J L; Aluru, S

A number of `tricks` are known that trade multiplications for additions. The term `tricks` reflects the way these methods seem not to proceed from any general theory, but instead jump into existence as recipes that work. The Strassen method for 2 {times} 2 matrix product with seven multiplications is a well-known example, as is the method for finding a complex number product in three multiplications. We have created a practical computer program for finding such tricks automatically, where massive parallelism makes the combinatorially explosive search tolerable for small problems. One result of this program is a method for cross products of 3-vectors that requires only five multiplications.

• Research Organization: Ames Lab., IA (United States)
• Sponsoring Organization: USDOE, Washington, DC (United States)
• DOE Contract Number: W-7405-ENG-82
• OSTI ID: 10136552
• Report Number(s): IS-5088; ON: DE93009501
• Resource Relation: Other Information: PBD: Dec 1992
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE
PARALLEL PROCESSING
ALGORITHMS
ARRAY PROCESSORS
MATRICES
OPTIMIZATION
MATHEMATICAL OPERATORS
990200
MATHEMATICS AND COMPUTERS