Fast matrix multiplication (FMM) algorithms to multiply two n /spl times/ n matrices reduce the asymptotic operation count from O(n/sup 3/) of the traditional algorithm to O(n/sup 2.38/), thus onâ€¦ (More)

Strassenâ€™s algorithm to multiply two n Ã— n matrices reduces the asymptotic operation count from O(n3) of the traditional algorithm to O(n2.38), thus on distributed memory computers, the associationâ€¦ (More)