How do I index a different column for each row of a matrix without using a loop?

Question

SeanC 2017-1-30

1
链接

此问题的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/322604-how-do-i-index-a-different-column-for-each-row-of-a-matrix-without-using-a-loop

评论： Star Strider 2017-1-31

I have a 446,000 x 7 matrix. I have a vector 446,000 specifying the column of interest for each row in the matrix. I.e. from Row 1 I want the second column, from Row 2 I want the 3rd column etc.

How do I extract these values from the matrix without using a loop?

Thanks

0 个评论
显示 -2更早的评论隐藏 -2更早的评论

请先登录，再进行评论。

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

Answer 1

Star Strider 2017-1-30

3
链接

此回答的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/322604-how-do-i-index-a-different-column-for-each-row-of-a-matrix-without-using-a-loop#answer_252666

编辑：Star Strider 2017-1-30

在 MATLAB Online 中打开

One approach:

A = randi(99, 10, 7);                           % Created Small Matrix
V = randi(7, 10, 1);                            % Create Similar Vector
idx = bsxfun(@eq, cumsum(ones(size(A)), 2), V);
Result = sum(A.*idx, 2);

4 个评论
显示 2更早的评论隐藏 2更早的评论

Star Strider 2017-1-30

@SeanC — My pleasure.

@John Chilleri — Thank you!

Star Strider 2017-1-31

@John Chilleri — I appreciate your interest!

I would have left the original, except that I re-read the original post and reconsidered it, since SeanC’s matrix is (446,000x7). My original idea would first create a 198916000000 element square matrix (the reason diag works with it) requiring 1.5913E+012 bytes. At best that’s computationally inefficient, and at most could cause memory problems.

My revised idea transiently duplicates the size of original matrix (in the bit-wise multiplication with the logical matrix), of 24976000 bytes, before ‘collapsing’ it into a vector with the sum call. While I haven’t compared the computation times with the simulated large matrix, I believe it’s more computationally efficient, and certainly more ‘friendly’ with respect to memory usage.

请先登录，再进行评论。