Strassen's Algorithm
A matrix multiplication algorithm which replaces one recursive matrix multiplication with 18 matrix additions (compared to Winograd's 18), yielding O(n2.81) asymptotic performance at the cost of some numeric stability.
Check out my first novel, midnight's simulacra!
A matrix multiplication algorithm which replaces one recursive matrix multiplication with 18 matrix additions (compared to Winograd's 18), yielding O(n2.81) asymptotic performance at the cost of some numeric stability.