- #1
BrownianMan
- 134
- 0
A is a sparse matrix. B is a vector. I have the following code:
This part of the code is inside a function which gets called about 160000 times. I ran the Profiler and this part is the bottleneck. How can I make it more efficient?
Code:
for j=1:N
B=A*B;
end;
This part of the code is inside a function which gets called about 160000 times. I ran the Profiler and this part is the bottleneck. How can I make it more efficient?