A noncommutative algorithm for multiplying 3×3 matrices using 23 multiplications

Julian D. Laderman

Bulletin of the American Mathematical Society · 1976 · 139 citations · 6 references

DOIFull text

Open access

Concepts

Abstract

A noncommutative algorithm, as opposed to a commutative algorithm, performs matrix multiplication without requiring the matrix elements to be commutative under the operation of multiplication. Such an algorithm is most desirable since it can be employed to multiply two matrices whose elements are themselves matrices.

References

6