Community Profile

Contact

Thank you for your comprehensive information. However it seems 1) the iterative methods doesn't work for my situation 2) after ...

3279 views

Responded 2 years ago

Running time of full matrix multiplication would be order O(n^3) If it is sparse, it would be much less. I guess it would be aro...

Thank you for your information. Seems it will take me some time to study it. BTW, do you know other free toolbox for parallel c...

I just made anther attempt, function [ R ] = blkinv2( A, m ) B = mat2cell(full(reshape(nonzeros(A), m, [])), m, ones(rows(A)/m,...

You mean adding or replacing? This works for me: delta = [1;2;3] [NaN;NaN;NaN;NaN;NaN;delta(1:end)]

accepted

0

Answered 2 years ago

I am trying to speed up the calculation of inverse of square block diagonal matrix. Currently I am taking inverse of the block ...

Posted 2 years ago

Here is a code for creating sparse block diagonal matrix: n = 100; C = cell(n); C(:) = {1}; tic;blkdiag(sparse(0,0),C{:});toc; ...

623 views

This function may help: http://www.mathworks.com/help/matlab/ref/urlread.html