How can i make comparison faster

3 次查看（过去 30 天）
Mats
Mats 2017-10-26
评论： Andrei Bobrov 2017-10-26
My aim with the loop is to pick out all elements of C that are within range r of rd and range t of td (rd and td are range matrices). Then multiply the elements together and add them to a sum.
This loop is called about a million times and is relatively slow.
Does anyone have an idea of how I can increase the speed of the loop? (I have tried code generation which turned out slower, and parallelism)
for i = 1:indN
D = C(rd(ind(i),:)<r & td(ind(i),:)<t); % Check for <r and <t
if (isempty(D)) D=0; end
gSum = gSum + prod(D);
end
Profiling gives that D=C(.. line takes 84,7% of the entire run time (the other lines in the loop next to nothing)
  1 个评论
Jan
Jan 2017-10-26
Please provide some test data. Optimizing code depends on the inputs also. E.g. it matters, if there are repetitions in ind, or if C is a [1e7 x 1e2] or [1e2 x 1e7] matrix.

请先登录，再进行评论。

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

采纳的回答

Jan
Jan 2017-10-26
index = (rd(ind, :) >= r | td(ind, :) >= t);
D = C;
D(index) = 1;
gSum = sum(prod(D, 2));

更多回答（1 个）

Andrei Bobrov
Andrei Bobrov 2017-10-26
编辑：Andrei Bobrov 2017-10-26
[ii,jj] = find(rd(ind,:) < r & td(ind,:) < t);
gSum = sum(accumarray(ii,C(jj),[],@(x)prod(x)));

类别

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

标签

Community Treasure Hunt

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

Start Hunting!

Translated by