In principle, it’s also best to wrap all of this in a function, although it
doesn’t seem to matter that much for this case (on my machine).
I get little over 0.6 seconds for the first, and about 0.55 s for the second
and third. That sounds consistent with my expectation. Note also that the
stat
I continue investigating matrix multiplication performance. Today I found
that multiplication by array of zeros(..) is several times faster than
multiplication by array of ones(..) or random numbers:
julia> A = rand(200, 100)
...
julia> @time for i=1:1000 A * rand(100, 200) end
elapsed time: