Timeline for Fastest way to solve a system of linear equations
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 3 at 19:13 | comment | added | gnasher729 | With 1 million x 1 million you will be unhappy. Strassen increases the computation time by a factor 7 instead of 8 when you double the problem size. If they start with 16x16 and 4096 multiplications and double the problem size 16 times, then instead of 1.15 billion billion products the number is divided by 8.5. | |
| Apr 10, 2019 at 13:23 | history | edited | Oleg Kovalov | CC BY-SA 4.0 |
grammar
|
| Jun 14, 2017 at 18:38 | comment | added | Oleg Kovalov | @gnasher729 I've some doubts, Alex Stapanov in one of his lectures it is mentioned that Boing was using Strassen's algorithm for really big matrices(1Mx1M afair) and they were unhappy with performance. But I think this info is kinda outdated for modern hardware. | |
| Jun 14, 2017 at 18:16 | comment | added | gnasher729 | The matrix size is 10,000 by 10,000 so I assume Strassen would be able to save something. Just not very much. | |
| Jun 14, 2017 at 17:29 | review | First posts | |||
| Jun 14, 2017 at 17:49 | |||||
| Jun 14, 2017 at 17:25 | history | answered | Oleg Kovalov | CC BY-SA 3.0 |