Does anyone know of a good site for explanation of the Strassen Matrix multiplication (code)? Most I searched on the web were just research paper on it.
Does anyone know of a good site for explanation of the Strassen Matrix multiplication (code)? Most I searched on the web were just research paper on it.
Hello,
Here are a list of links that may help you understand the Strassen Algorithm:
- Strassen's Algorithm [Overview]
- The Strassen Algorithm
- Explanation of Strassen Algorithm for multiplying matrixes
- Stack Overflow
Segmentation Fault: I am an error in which a running program attempts to access memory not allocated to it and core dumps with a segmentation violation error. This is often caused by improper usage of pointers, attempts to access a non-existent or read-only physical memory address, re-use of memory if freed within the same scope, de-referencing a null pointer, or (in C) inadvertently using a non-pointer variable as a pointer.
Thanks for the links. I'm writing a pseudo-code for it. I'm using a recursive method to write it (such that the operations cost is O(n^2.81) for n size matrix.
This is basically the algorithm below. Is it coded using one recursive function that breaks each matrix by n/2? Can it be coded using an iteration of 7 counts (probably won't be a good idea though)?
P1 = a . (g - h) r = P5 + P4 - P2 + P6
P2 = (a + b) . h s = P1 + P2
P3 = (c + d) . e t = P3 + P4
P4 = d . (f - e) u = P5 + P1 - P3 + P7
P5 = (a + d) . (e - h)
P6 = (b - d) . (f + h)
P7 = (a - c) . (e + g)
