DocumentCode
745017
Title
O(n) matrix multiplication algorithm for hypercube machines
Author
Chang, C. Hwa
Author_Institution
Dept. of Electr. Eng., Tufts Univ., Medford, MA, USA
Volume
27
Issue
25
fYear
1991
Firstpage
2398
Lastpage
2399
Abstract
An efficient algorithm for the multiplication of two n*n matrices on a hypercube machine is presented and proved to have computational complexity of O(n).
Keywords
computational complexity; matrix algebra; parallel algorithms; O(n) complexity; computational complexity; hypercube machines; matrix multiplication algorithm;
fLanguage
English
Journal_Title
Electronics Letters
Publisher
iet
ISSN
0013-5194
Type
jour
DOI
10.1049/el:19911483
Filename
121380
Link To Document