Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
oh_my_goodness
on May 18, 2022
|
parent
|
context
|
favorite
| on:
The big six matrix factorizations
Could you link a practical algorithm with an exponent lower than 3? (I think of these things
https://en.wikipedia.org/wiki/Computational_complexity_of_ma...
as not being practical, but I'd love to be wrong. )
gnufx
on May 18, 2022
|
next
[–]
For something Strassen-ish you could look at
https://jianyuhuang.com/papers/sc16.pdf
and the GPU implementation
https://apps.cs.utexas.edu/apps/sites/default/files/tech_rep...
FabHK
on May 18, 2022
|
parent
|
next
[–]
That's matrix-matrix multiplication. Nobody disputes that Strassen etc. have sub-cubic complexity. What about one of the six decompositions mentioned, as GP claimed?
gnufx
on May 19, 2022
|
root
|
parent
|
next
[–]
I responded to a post about the practicality of MM multiplication methods, though GEMM is quite fundamental.
daniel-cussen
on May 18, 2022
|
prev
[–]
https://www.fgemm.com
, coming soon.
Consider applying for YC's Winter 2026 batch! Applications are open till Nov 10
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
