Timeline for Effecient method for iterating over sparse dataset
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 14, 2020 at 20:09 | comment | added | Charlie S | Even with 2-dimensional sparse matrices, you can typically iterate efficiently in one loop order (i.e. Row Major i->j), otherwise you're searching. If that's not acceptable, then maybe you're better off storing 4! = 24 copies of the tensor! | |
| Aug 14, 2020 at 2:42 | answer | added | Wolfgang Bangerth | timeline score: 2 | |
| Aug 13, 2020 at 19:31 | review | First posts | |||
| Aug 14, 2020 at 5:04 | |||||
| Aug 13, 2020 at 19:25 | history | asked | Sledge | CC BY-SA 4.0 |