The first command creates the full array zeros(10000) before turning it into a sparse array. The simplest way of creating the matrix you want is
This is not a problem where using a loop is a good idea! You can time the commands using tic and toc:
tic
a = sparse([]); for i =1:100,for j = 1:100, a(i,j) = 0; end,end
toc
tic
b = sparse(100,100);
toc
On my computer, the output is
Elapsed time is 0.010886 seconds.
Elapsed time is 0.000298 seconds.
In other words, for an array that is only 100 x 100, the loops are 35 times slower. If you increase the array size, the loops increase in time as the total number of elements, while the second command always takes about the same time. So with your array, the loops would to it 350,000 times slower! And that's assuming that you change the comma after a(i,j) = 0 to a semicolon so the output isn't displayed after each element is changed.
Best Answer
It is true that you have pre-allocated, but (a) you still aren't using that pre-allocated space for anything, and (b) you are still using concatenation to make TBILL1Y grow with every pass through the loop. Your code should look something like,
count=count+1; TBILL1Y(:,count)=DRAW(:,1);