On Mon, May 6, 2013 at 8:00 PM, elton wang <[email protected]> wrote: > note that in the random matrix multiply test, J lags behind all other peers. > The code I use is > > rand_nn =. 0 ?@$~ 2 # ] > mp =. +/ . * > randmatmul =. rand_nn mp rand_nn > 1000 * 6!:2 'randmatmul 1000' > > I suspect that other languages use some library like BLAS for matrix rather > than raw calculation. Is there a way to speed up code above?
You are including the time to generate the random matrices in your matrix multiply time. Changing that gives me a minor speed improvement. Hypothetically speaking, though, you could call BLAS from J. I'll hope Roger takes an interest in this one. He knows far more about J timing issues than anyone else. Thanks, -- Raul ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
