Timeline for Increasing the speed of sparse array
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 21, 2018 at 19:01 | vote | accept | jsid | ||
| Sep 21, 2018 at 14:11 | answer | added | Henrik Schumacher | timeline score: 2 | |
| Sep 21, 2018 at 13:42 | comment | added | jsid | Let it be for example f[{a_, b_, c_, d_, i_, j_}] := a + b + c + d + i + j; then?. | |
| Sep 21, 2018 at 13:33 | comment | added | Henrik Schumacher | It is absolutely contraproductive to use symbolic code here. For example, the SparseArray cannot store the values in a packed array, if the values are not machine numbers. In the end, the values must be calculated anyways. So, please give me a concrete example for f. | |
| Sep 21, 2018 at 13:30 | comment | added | jsid | f is a function but in this code it is just a variable. I thought of computing this matrix first and then define what f is, because every single computation of f takes about 0.02 seconds. | |
| Sep 21, 2018 at 13:06 | comment | added | Henrik Schumacher | Whould you share with us what f is? | |
| Sep 21, 2018 at 12:00 | history | edited | jsid | CC BY-SA 4.0 | deleted 1 character in body |
| Sep 21, 2018 at 9:07 | history | asked | jsid | CC BY-SA 4.0 |