[Numpy-discussion] computing some running sums
Tue Jun 1 08:56:19 CDT 2010
On Tue, Jun 1, 2010 at 6:47 AM, Neal Becker <email@example.com> wrote:
> Not sure what to call this.
> Any suggestion on computing the vector:
> sum(u[i*M:i*M+N]) for i in range (len(u)/M)
How about a cumsum and then a loop to take the differences of the
desired indices of the cumsum? Might be faster to convert the cumsum
to a list (looks like you are interested in 1d?) for use in the loop.
Converting the loop to cython would be the next step.
More information about the NumPy-Discussion