Timeline for Fast C++ implementation of sparse binary matrices
Current License: CC BY-SA 3.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 21, 2016 at 9:49 | vote | accept | Yauhen Yakimenka | ||
| Oct 11, 2016 at 7:38 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Sep 11, 2016 at 6:58 | comment | added | BrunoLevy | @Spencer Bryngelson, the last point is very specific (Galois field), and to my knowledge general sparse matrices packages do not have it. | |
| Sep 11, 2016 at 6:57 | answer | added | BrunoLevy | timeline score: 2 | |
| Sep 6, 2016 at 21:47 | comment | added | user20857 | You are correct that it does not have a direct handling for binary matrices. Your problem is not especially large, are you sure that this deficiency is prohibitive? | |
| Sep 6, 2016 at 20:45 | comment | added | Yauhen Yakimenka | I briefly looked at PETSC manual. Are you sure it can work with binary matrices. My feeling is that it is only for real matrices... | |
| Sep 6, 2016 at 15:14 | comment | added | user20857 | PETSc is fast, scalable, has C wrappers and can perform these tasks. | |
| Sep 6, 2016 at 13:15 | review | First posts | |||
| Sep 6, 2016 at 13:46 | |||||
| Sep 6, 2016 at 13:12 | history | asked | Yauhen Yakimenka | CC BY-SA 3.0 |