Hacker Newsnew | comments | ask | jobs | submitlogin
wging 442 days ago | link | parent

Nice, but I feel I should point out that there are faster ways to multiply matrices than the naive O(n^3). I think we're down to O(n^2.3something). http://en.wikipedia.org/wiki/Matrix_multiplication#Algorithm...


HalcyonicStorm 442 days ago | link

Agreed. I was talking about the naive method of multiplying matricies. I could make another huge blog post on matrix multiplication algorithms. I am a particular fan of solving Ax=B type problems...hmmm maybe that could be a future post.

-----




Lists | RSS | Bookmarklet | Guidelines | FAQ | DMCA | News News | Feature Requests | Bugs | Y Combinator | Apply | Library

Search: