Abstract

Matrices are used widely across a number of areas in Computer Science and Physics. There are many details to be explored regarding the mechanics of matrix computations, and it is also interesting to understand the implications of such computations in the real world.

In the first part of the talk, I will give explanations of some very interesting algorithms related to matrix multiplication. This includes the Strassen algorithm which can be useful in practice, followed by the key ideas behind theoretically more efficient methods. Then, I will talk about the different types of decompositions of matrices and how each of them can be used, going into the details for some more relevant ones.

The talk should give you a clear idea of some of the most important matrix computation algorithms and a good understanding of their applications in general.