Because matrix multiplication is such a central operation in many numerical algorithms, much work has been invested in making matrix multiplication algorithms efficient.

In theoretical computer science, the computational complexity of matrix multiplication dictates how quickly the operation of matrix multiplication can be performed.

(or the matrix chain ordering problem) an optimization problem concerning the most efficient way to multiply a given sequence of matrices.