Smart and fast way to compute triple summation?

Kshitij Singh answered . 2024-12-21 00:25:33

PART 4: Swapped loops:

tic
n   = 50; 
l_s = numel(segments.batNetID);   % # of segments
L   = sum(segments.NewLength);    % total legnth of Segments
expSlength = zeros(l_s, 1);

meanPass = median( barriers.prePass );
qs1 = segments.NewLength ./ L;
qs2 = segments.segDis2Mth ./ L;
qs3 = (L - segments.NewLength - segments.segDis2Mth) ./ L;

meanPass_pow  = cumprod([1, repmat(meanPass, 1, n)]);
meanPass_powC = cumsum(meanPass_pow);

gammaln2 = gammaln(1:n+1);
logPROB  = log([qs1, qs2, qs3]).';

for k = 0:n
   X = zeros(n - k + 1, 3);
   for t = 0:n-k
      X(t+1, :) = [k, t, n-k-t];
   end
   c = gammaln2(n + 1) - sum(gammaln2(X + 1), 2);

     % VERSION 1: full inner loop
     % for s = 1:l_s
     %   B = meanPass_powC(k + 1) * segments.NewLength(s) / (k + 1);      
     %   p_stk = exp(c + X * logPROB(:, s));
     %   
     %   innersum = 0;
     %   for t = 0 : n-k
     %      innersum = innersum + p_stk(t+1) * meanPass_pow(t+1);
     %   end
     %   expSlength(s) = expSlength(s) + innersum * B;
     % end

     % VERSION 2: Partially vectorized
     % p_stk = exp(c + X * logPROB);
     % B = segments.NewLength * (meanPass_powC(k + 1) / (k + 1));
     % for s = 1:l_s
     %    innersum = 0;
     %    for t = 0 : n-k
     %       innersum = innersum + p_stk(t+1, s) * meanPass_pow(t+1);
     %    end
     %    expSlength(s) = expSlength(s) + innersum * B(s);
     % end

     % VERSION 3: fully vectorized
     p_stk      = exp(c + X * logPROB);
     B          = segments.NewLength * (meanPass_powC(k + 1) / (k + 1));
     expSlength = expSlength + (meanPass_pow(1:n-k+1) * p_stk).' .* B;  
  end
  toc

 n = 50;
 ARRAYFUN:   8.2 sec
 VERSION 1: 19.5 sec
 VERSION 2:  6.2 sec
 VERSION 3:  5.0 sec

Not satisfied with the answer ?? ASK NOW