| Tue, 21 May 2013 12:11:40 +0100 |
Chris Cannam |
Proper sparse*sparse multiply, more efficient makeSparse. Still loads of room for improvement, but the timings are more predictable now at least.
|
| Mon, 20 May 2013 22:17:35 +0100 |
Chris Cannam |
Merge from sparse branch
|
| Mon, 20 May 2013 22:17:19 +0100 |
Chris Cannam |
A reasonable sparse multiply, and a bit quicker dense one
sparse
|
| Mon, 20 May 2013 18:11:44 +0100 |
Chris Cannam |
Add speed tests
sparse
|
| Mon, 20 May 2013 18:11:36 +0100 |
Chris Cannam |
Sparsity is actually density
sparse
|
| Mon, 20 May 2013 18:11:20 +0100 |
Chris Cannam |
Sparsity is actually density
sparse
|
| Mon, 20 May 2013 16:48:44 +0100 |
Chris Cannam |
Add newSparseMatrix to api (needs test)
sparse
|
| Mon, 20 May 2013 16:46:38 +0100 |
Chris Cannam |
ColMajor -> ColumnMajor
sparse
|
| Mon, 20 May 2013 16:45:34 +0100 |
Chris Cannam |
Separate out thresholding from toSparse. Not entirely sure this is a good thing
sparse
|
| Mon, 20 May 2013 16:22:17 +0100 |
Chris Cannam |
Add and test sparsity
sparse
|
| Mon, 20 May 2013 16:01:43 +0100 |
Chris Cannam |
Fix comparator for sparse matrices; sprinkle some zeros in test data to exercise sparsity
sparse
|
| Mon, 20 May 2013 15:08:14 +0100 |
Chris Cannam |
Fix sparse matrix enumerate
sparse
|
| Mon, 20 May 2013 14:40:52 +0100 |
Chris Cannam |
Sparse fixes
sparse
|
| Mon, 20 May 2013 14:18:14 +0100 |
Chris Cannam |
Implement sparse matrix construction, add tests for sparse matrices (currently failing)
sparse
|
