Lecture 4: Transforms (34)

We can further optimize matrix multiplications by multiplying them in a specific order. We can find this order using Dynamic Programming, as described in CS170. More information: https://en.wikipedia.org/wiki/Matrix_chain_multiplication


Could this be optimized through the use of Fast Fourier Transform? Seems like this would help improve performance for matrix multiplications.

You must be enrolled in the course to comment