in reply to Sparse Matrix Multiplication Problem
(Usually sparse matrices are stored a bit different: for every row and every column there's a linked list of non-zero items together with their indexes, so that walking all non-zero elements is fast, ie following the links).
|
|---|
| Replies are listed 'Best First'. | |
|---|---|
|
Re^2: Sparse Matrix Multiplication Problem
by rg0now (Chaplain) on Jan 27, 2009 at 16:43 UTC | |
by tsee (Curate) on Jan 27, 2009 at 17:53 UTC | |
by rg0now (Chaplain) on Feb 01, 2009 at 09:43 UTC | |
by syphilis (Archbishop) on Feb 01, 2009 at 10:37 UTC | |
|
Re^2: Sparse Matrix Multiplication Problem
by etj (Priest) on Jun 03, 2022 at 22:39 UTC |