I have constructed a large matrix A that has very few non-zero entries, and I would like to make use of sparse matrix multiplication so that my code runs faster. However, I noticed that when I run
>> y = sparse(A)*x;
the execution is very slow. How can I improve the performance of my code?
Best Answer