Strassen's algorithm is considered efficient because it reduces the number of multiplications required for matrix multiplication. While additions and subtractions may have similar computational speeds to multiplications, they still require computational resources, and reducing their frequency can save time. Strassen's algorithm divides the matrices into smaller submatrices and recursively computes their products using fewer multiplications than the standard algorithm. This results in a lower computational complexity and faster execution time. However, for very small matrices, the overhead of dividing them into smaller submatrices and computing their products may outweigh the benefits of using Strassen's algorithm.
Please start posting anonymously - your entry will be published after you log in or create a new account. This space is reserved only for answers. If you would like to engage in a discussion, please instead post a comment under the question or an answer that you would like to discuss
Asked: 2023-06-05 10:16:57 +0000
Seen: 9 times
Last updated: Jun 05 '23