Running Time Comparison and Applications of Multiplying $\mathbf{2} \times \mathbf{2}$ Matrices Using the Strassen Algorithm
- Resource Type
- Conference
- Authors
- Gao, Shanzhen; Malomo, Olumide; Eyob, Ephrem; Gao, Weizheng
- Source
- 2022 International Conference on Computational Science and Computational Intelligence (CSCI) CSCI Computational Science and Computational Intelligence (CSCI), 2022 International Conference on. :556-560 Dec, 2022
- Subject
- Computing and Processing
Scientific computing
Complexity theory
Computational intelligence
matrix multiplication
Python programming
running time
comparison
Strassen Algorithm
Pell numbers
Fibonacci Numbers
Lucas Numbers
- Language
- ISSN
- 2769-5654
Multiplying matrices can be very challenging although it seems straightforward. Many researchers have studied the multiplication of two $2 \times 2$ matrices by using the Strassen Algorithm in the past 50 years. They focused on the complexity from the mathematical and algorithmic points of view. We will discuss the running time comparison of two algorithms from a practical point of view. Several open problems are then posted to challenge our readers.