Winograd's Algorithm

From dankwiki

A matrix multiplication algorithm which replaces one recursive matrix multiplication with 15 matrix additions (compared to Strassen's 18), yielding O(n2.81) asymptotic performance. It's used by D'Alberto and Nicolau in their hybrid-daptive matrix multiplication library, and Craig Douglas in his GIMMW.

See Also