Comparison and Applications of Multiplying Two 3 by 3 Matrices

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 discu...

Full description

Saved in:
Bibliographic Details
Published in2023 Congress in Computer Science, Computer Engineering, & Applied Computing (CSCE) pp. 735 - 740
Main Authors Gao, Shanzhen, Gao, Weizheng, Malomo, Olumide, Allagan, Julian D., Eyob, Ephrem, Su, Jianning
Format Conference Proceeding
LanguageEnglish
Published IEEE 24.07.2023
Subjects
Colab
Complexity theory
Fibonacci Numbers
Jupyter Notebook
matrix multiplication
Python IDLE
Strassen algorithm
Online AccessGet full text
DOI10.1109/CSCE60160.2023.00125

Cover

More Information
Summary: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.
DOI:10.1109/CSCE60160.2023.00125