Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

Could you adapt this to finding fast inverses?


I looked at that, i concluded yes because the bottleneck of inverting a matrix is matrix multiplication. Spesh since fgemm targets 32-bit floating-point format, n has high accuracy (not saying how high but much better than Strassen, at least as good as naive matrix multiplication).




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: