In Search of a Practical Strassen-like Matrix Multiplication

dc.rights.license	CC-BY-NC-ND
dc.contributor.advisor	Bisseling, R.H.
dc.contributor.author	Brouwer, N.B.
dc.date.accessioned	2021-09-06T18:00:15Z
dc.date.available	2021-09-06T18:00:15Z
dc.date.issued	2019
dc.identifier.uri	https://studenttheses.uu.nl/handle/20.500.12932/782
dc.description.abstract	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 [8].
dc.description.sponsorship	Utrecht University
dc.format.extent	376301
dc.format.mimetype	application/pdf
dc.language.iso	en
dc.title	In Search of a Practical Strassen-like Matrix Multiplication
dc.type.content	Bachelor Thesis
dc.rights.accessrights	Open Access
dc.subject.courseuu	Mathematical Sciences