Check out my first novel, midnight's simulacra!

Winograd's Algorithm

From dankwiki
The printable version is no longer supported and may have rendering errors. Please update your browser bookmarks and please use the default browser print function instead.

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