Algoritmos para Multiplica\c{c}\~ao Matricial
M. S. O. Poloi, T. O. Quinelato

TL;DR
This paper studies matrix multiplication algorithms, focusing on Strassen and Strassen-Winograd methods, proposing modifications to improve memory usage and execution time, implemented in Julia with benchmarking and visualization tools.
Contribution
The paper introduces modifications to existing Strassen and Strassen-Winograd algorithms to reduce memory and time complexity, with implementation and benchmarking in Julia.
Findings
Modified algorithms reduce memory allocation.
Execution time improved through proposed modifications.
Implementation in Julia demonstrates practical efficiency.
Abstract
The goal of this article is to study algorithms that compute the product between two matrixes, specifically using the ingenuous methods of Strassen and Strassen-Winograd, which will be presented in Section 2. At present, the cited methods are not the most optimal considering the arithmetic complexity of these algorithms (see Table 1). However, changes to the Strassen and Strassen-Winograd methods will be exposed which will result in a reduction in their memory allocation and/or execution time. The algorithms in this study were implemented using the Julia programming language, version 1.9.1, with the aid of the packages Pluto (notebooks), Plots (graphic visualization of the results) and BenchmarkTools (measurement of memory allocation and execution time of the algorithms). -- O objetivo deste artigo \'e estudar algoritmos que computam o produto entre duas matrizes, mais…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Mathematical Theories · graph theory and CDMA systems · Matrix Theory and Algorithms
