On 11/15/06, YONGWAN CHUN <[EMAIL PROTECTED]> wrote:
> I work on large matrices and found something interesting. For multiplication
> of matrices, the order has a huge influence on computing time when one of
> them is a sparse matrix. In the below example, M is a full matrix and A is a
> sparse
On Wed, Nov 15, 2006 at 01:22:19PM -0500, YONGWAN CHUN wrote:
> I work on large matrices and found something interesting. For multiplication
> of matrices, the order has a huge influence on computing time when one of
> them is a sparse matrix. In the below example, M is a full matrix and A is a
Hello,
I work on large matrices and found something interesting. For multiplication of
matrices, the order has a huge influence on computing time when one of them is
a sparse matrix. In the below example, M is a full matrix and A is a sparse
matrix in a regular matrix class. A %*% M takes muc
