Title :
O(n) matrix multiplication algorithm for hypercube machines
Author_Institution :
Dept. of Electr. Eng., Tufts Univ., Medford, MA, USA
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;
Journal_Title :
Electronics Letters
DOI :
10.1049/el:19911483
