Comparison and Applications of Multiplying Two 3 by 3 Matrices
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 5
Abstract
Multiplying matrices can be very challenging although it seems straightforward. Many researchers have studied the multiplication of two 3 by 3 matrices by using Strassen Algorithm in the past 50 years. They focused on the complexity from the mathematical and algorithmic points of view. We will discuss the processing time comparison from a practical point of view in Python IDLE, Jupyter Notebook, and Colab. Several open problems are posted to challenge our readers.
Related Papers
Algebraic Complexity Theory
Peter Bürgisser, Michael Clausen, Mohammad Amin Shokrollahi|Grundlehren der mathematischen Wissenschaften|1997|1.1k