Comparison and Applications of Multiplying 2 by 2 Matrices Using Strassen Algorithm in Python IDLE, Jupyter Notebook, and Colab
Shanzhen Gao(Virginia State University), Weizheng Gao(Elizabeth City State University), Olumide Malomo(Virginia State University), Julian D. Allagan(Elizabeth City State University), Ephrem Eyob(Virginia State University), Jianning Su(Georgia State University)
Cited by 6
Abstract
Even though the task of multiplying matrices appears to be rather straightforward, it can be quite challenging in practice. Many researchers have focused on how to effectively multiply two 2 by 2 matrices by applying Strassen Algorithm in the past 50 years. They worked on the complexity from both the mathematical and algorithmic points of view. In our paper, we will discuss the comparison of processing time in Python IDLE, Jupyter Notebook, and Colab from a practical point of view. Several open problems are then presented to challenge our readers.
Related Papers
Algebraic Complexity Theory
Peter Bürgisser, Michael Clausen, Mohammad Amin Shokrollahi|Grundlehren der mathematischen Wissenschaften|1997|1.1k