I didn't know the cutoff point, but there's a pretty big
overhead for sparsity and we haven't really spent much time
optimizing the sparse matrix code (or the dense code, for
that matter --- memory locality optimization may be able to
eke out another factor of 2 or more).
Is it faster above 90% sparsity? We should probably indicate
this in the manual:
https://github.com/stan-dev/stan/issues/1709#issuecomment-200870788
- Bob
> --
> You received this message because you are subscribed to the Google Groups "Stan users mailing list" group.
> To unsubscribe from this group and stop receiving emails from it, send an email to
stan-users+...@googlegroups.com.
> To post to this group, send email to
stan-...@googlegroups.com.
> For more options, visit
https://groups.google.com/d/optout.
> <slow_sparse_matrix_mult.zip>