Sorry, I did not properly explain my problem.
Anyhow, by using:
1000 (6!:2) '(?256$0)+/ . *?256 312$0'
0.0052153
which is about 5.2 seconds to do 1000 iterations of the
matrix times vector multiply.
BIG reduction in time obtained by using ordinary numbers and
NOT using extended precision numbers.
Also, not writing a program is cool.
The j version runs about a factor of 10 slower than the
matlab version, but at least my earlier timing dropped from
2.5 minutes to about 5 seconds.
thanks a lot for the ideas.
----------------------------------------------------------------------
For information about J forums see http://www.jsoftware.com/forums.htm
