In Search of a Practical Strassen-like Matrix Multiplication
MetadataShow full item record
In this thesis we discuss the search for a Strassen-like algorithm for matrix multiplication. First, different ways of multiplying matrices are analyzed. After that, our method of searching for a Strassen-like algorithm is described. This search algorithm is a heuristic approach and is only interested in finding one solution. With some heuristic assumptions the search space is greatly reduced, which will lower the total running time. After giving an illustration of our search algorithm, some alternative methods of searching for fast matrix multiplication are reviewed, based on Smirnov’s paper .