4 ms·
OP here. So one algo I have is fast matrix multiplication algorithm, especially for sparse matrices. Faster asymptotically and in real-time than what's out th
by daniel-cussen 11y ago
OP here. So one algo I have is fast matrix multiplication algorithm, especially for sparse matrices. Faster asymptotically and in real-time than what's out there, and with better accuracy.
- pmiller2 11y agoIf you really have a matrix mulitplication algorithm that multiplies nxn matrices in less than O(n^2.3729), you have made a mathematical breakthrough and should publish.
- gesman 11y agoI second "publish". If you've invented something worth noting, you'll get infinitely better residual value, visibility, respect and goodness coming your way for years to come vs. one time deal of selling your work to a private buyer for a one time fee in a sell-and-forget type of deal.
- malisper 11y agoWhat do you mean by "with better accuracy"? How can one matrix multiplication algorithm be more accurate than another?
- relkor 11y agoReal computers are finite precision. There are very real issues with numerical stability where you are running along fine for many many cases, and then there is a catastrophic cancellation that wipes out all of your accuracy. There is a huge difference between writing a paper on bounds of matrix multiplication, and delivering performance in a finite precision world.
- daniel-cussen 11y agoStrassen makes your rounding errors bigger the more levels of recursion you do. We're talking ~7 bits of error due to rounding (in a paper I read).