Sparse Matrix - More Efficient Assignment Operation

18 次查看（过去 30 天）
Mark Whirdy
Mark Whirdy 2013-4-2
I have a large sparse matrix for which I am attempting to assign certain segments (simplified example as per below snippet) to some identity matrices. The assignment method below is extremely inefficient, taking up a large amount of memory and too much time (10sec for example below on my server, but my real dataset is much bigger). Looking at the screenshot from taskmanager, we can see clearly a large spike in memory usage while the operation is being carried out.
For somebody used to dealing with large sparse matrices, there should be a more efficient way of carrying out such an assignment operation. Probably a pretty simple solution but I have little experience with sparse-matrix syntax.
A = sparse(20000,60000);
A(10001:end,20001:50000) = ([speye(10000,10000),-speye(10000,10000),speye(10000,10000)]);

请先登录，再回答此问题。

采纳的回答

the cyclist
the cyclist 2013-4-2
编辑：the cyclist 2013-4-2
That operation took less than 3 milliseconds on my machine.
The resulting array is 960,008 bytes.
  4 个评论
显示 2更早的评论
Mark Whirdy
Mark Whirdy 2013-4-2
We ran on linux server & got 15sec on a 2009 matlab. Maybe there have been some improvements in sparse handling between versions at some point - any mathworks developers reading this have any insights?
Sean de Wolski
Sean de Wolski 2013-4-3
Hi Mark,
I can run the timings for you on any and all releases when I return to Natick on Friday.

请先登录，再进行评论。

更多回答（2 个）

Cedric
Cedric 2013-4-2
编辑：Cedric 2013-4-2
The structure of sparse matrices in memory makes this kind of indexing operations slower than building the sparse matrix directly using vectors of row/col IDs and values.
I = [10001:20000, 10001:20000, 10001:20000] ;
J = [20001:50000] ;
V = [ones(1, 1e4), -ones(1, 1e4), ones(1, 1e4)] ;
S = sparse(I, J, V, 2e4, 6e4) ;
spy(S) ; % Check structure.
You can easily make it more flexible/concise. I can't test it now though.
  6 个评论
显示 4更早的评论
James Tursa
James Tursa 2013-4-2
编辑：James Tursa 2013-4-2
Slight change to Cedric's method to get the size as desired (added a 0 element at the end):
I = [10001:20000, 10001:20000, 10001:20000 20000] ;
J = [20001:50000 60000] ;
V = [ones(1, 1e4), -ones(1, 1e4), ones(1, 1e4) 0] ;
Also, there IS a version specific issue here. The original code OP posted generates an out-of-memory on my Win32 XP machine through R2010b, but is fine for R2011a onwards. Which leads me to believe that there is something in the indexing or concatenating that changed between these versions with regards to sparse matrices and how they use temporary memory in the background. The final result isn't that large.
Regarding OP's comment that he needs to insert different values (other than 1's and -1's I presume), we would need to see some specifics in order to offer any suggestions.
Cedric
Cedric 2013-4-3
编辑：Cedric 2013-4-3
It would be interesting to test with a smaller size matrix that would fit in memory as a dense matrix. There might be some conversion to dense in particular cases of indexing that could be spotted this way. I've been using quite intensely sparse matrices in MATLAB since ~2006 I guess, and I already had troubles with unsuspected conversions to dense a few times (but not while CAT-ing sparse matrices, as it is not an operation that I am doing frequently).

请先登录，再进行评论。

Teja Muppirala
Teja Muppirala 2013-4-3
The performance of sparse matrix indexing was enhanced in R2011a.
http://www.mathworks.com/help/matlab/release-notes.html
If you can't upgrade, as somewhat of a workaround, you should be able to get away with something like this:
A = sparse(20000,60000);
A = spreplace(A,10001:20000,20001:50000,[speye(10000,10000),-speye(10000,10000),speye(10000,10000)]);
Where SPREPLACE is the following general purpose function:
function A = spreplace(A,I,J,B)
% Equivalent to
% >> A(I,J) = B
% But does not support "end" indexing in I and J
I = I(:);
J = J(:);
[iA,jA,sA] = find(A);
[iB,jB,sB] = find(B);
trimA = ~(ismember(iA,I) & ismember(jA,J));
A = sparse([iA(trimA); I(iB)],...
[jA(trimA); J(jB)],...
[sA(trimA); sB],...
size(A,1),size(A,2));
When I try this in R2007a, Your original code takes 15 seconds, The workaround above gets it done in about 5 milliseconds.

类别

在 Help Center 和 File Exchange 中查找有关 Sparse Matrices 的更多信息

标签

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by