Comparison and Applications of Multiplying Two 3 by 3 Matrices
- Resource Type
- Conference
- Authors
- Gao, Shanzhen; Gao, Weizheng; Malomo, Olumide; Allagan, Julian D.; Eyob, Ephrem; Su, Jianning
- Source
- 2023 Congress in Computer Science, Computer Engineering, & Applied Computing (CSCE) CSCE Computer Science, Computer Engineering, & Applied Computing (CSCE), 2023 Congress in. :735-740 Jul, 2023
- Subject
- Computing and Processing
Complexity theory
matrix multiplication
Strassen algorithm
Fibonacci Numbers
Python IDLE
Jupyter Notebook
Colab
- Language
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.