I'd like to know the fastest way to deal with a 3D array in a page-wise way. Suppose I have the following data:
data = randi([1, 10], 10, 10, 1000);
and I want to know the inverse matrix of each page of this data. I compared three approaches to compute this:
data_inv1 = zeros(10,10,1000);
data_inv1(:,:,ii) = inv(data(:,:,ii));
data_inv2 = arrayfun(@(ii)inv(data(:,:,ii)), 1:size(data,3), 'UniformOutput', false);
data_gpu = gpuArray(data);
data_inv3 = pagefun(@inv, data_gpu);
fprintf('FOR-loop: %.8f sec\n', time1);
fprintf('Arrayfun: %.8f sec\n', time2);
fprintf('Pagefun: %.8f sec\n', time3);
The results on my computer are shown below:
FOR-loop: 0.01121580 sec
Arrayfun: 0.01491200 sec
Pagefun: 0.01317000 sec
Surprisingly, the use of the for-loop was the fastest. I expected that pagefun will give me the fastest computation but that was not the case.
Has anyone tried different approaches to speedup the page-wise computation? Is there anyway to make a good use of pagefun?
