On 12/12/10, Raymond Toy <toy.raymond at gmail.com> wrote:
> Also, your results don't make sense to me. dgemm does not make use of
> any kind of sparseness, so the sparseness of the matrix shouldn't affect
> the runtime in any way.
I seem to recall that some processors handle operations
involving 0 or 1 specially. It seems plausible that a greater
number of 0's means a greater number of simpler special cases.
best
Robert Dodier