I have three vectors x, a, b. I need a new vector Y which has as its k^{th} element the following sum: Y^{}_k = \sum_{i=1}^N x_i \ \mathbb{1}(a_i=a_k, b_i=b_k) i.e., the sum of x from all rows with the same values of a, b as the current row. Is there a more efficient way to implement this than the…

[image] gdalle: julia> N, V = 1000, 3; julia> a, b = rand(1:V, N), rand(1:V, N); If you only have a small number V of possible values of a and b, then you can do much better by first summing into a matrix indexed by values of V, because then the time complexity is \Theta(N) (with space compl…

How to compute a conditional sum of a vector efficiently

General Usage

stevengj Split this topic August 13, 2022, 6:56pm 4

2 posts were split to a new topic: Speeding up a sum involving 3 matrices

Topic		Replies	Views
Conditional SUM when the indices of one vector match the indices of another New to Julia	11	2159	March 1, 2021
Efficient maximum of a large matrix General Usage	3	419	July 29, 2021
Sum operations between arrays Performance	21	5547	April 7, 2020
For loop optimization Performance performance , memory-allocation , loops	3	1642	October 31, 2021
Fast way to Implement a Loop New to Julia loops	4	1699	December 17, 2018

How to compute a conditional sum of a vector efficiently

Related topics