Check out my first novel, midnight's simulacra!

Strassen's Algorithm

From dankwiki
Revision as of 00:47, 30 September 2009 by Dank (talk | contribs)

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.

Retrieved from "https://nick-black.com/dankwiki/index.php?title=Strassen%27s_Algorithm&oldid=1078"