Matrix multiplication is an efficient algorithm that can optimize some one-dimensional recursion to log(n), and can also find path solutions, so it is an algorithm with strong applicability. Matrix is ​​one of the basic concepts in linear algebra. An m×n matrix is ​​an array of m×n numbers arranged in m rows and n columns. Because it compactly concentrates a lot of data together, it can sometimes easily represent some complex models. Matrix multiplication looks strange, but it is actually very useful and widely used.