tags:

views:

1038

answers:

9

Hi, I often do vector addition of Python lists.

Example: I have two lists like these:

a = [0.0, 1.0, 2.0]
b = [3.0, 4.0, 5.0]

I now want to add b to a to get the result a = [3.0, 5.0, 7.0].

Usually I end up doing like this:

a[0] += b[0]
a[1] += b[1]
a[2] += b[2]

Is there some efficient, standard way to do this with less typing?

UPDATE: It can be assumed that the lists are of length 3 and contain floats.

+1  A: 

You could create a function that gets the size of the array, loops through it and creating a return array which it returns.

Ólafur Waage
Thanks, but that doesn't seem very efficient.
kotlinski
@kotlinski. What? Size of the array is len(array) which is not a "computation" but an attribute of the list. Looping is certainly less typing than a[0]+=b[0]... a[999]+=b[999]. Also less error-prone. Also more obvious. I'll give up a little efficiency to prevent errors from mistyping.
S.Lott
I think my main gripe would be creating and returning a list, which would not be necessary in this case. Otherwise, yes, it's not worse than the other idea.
kotlinski
I only said return an array/list is because i thought you wanted that.
Ólafur Waage
"to get the result a = [3.0, 5.0, 7.0]."
Ólafur Waage
+7  A: 

How about this:

a = [x+y for x,y in zip(a,b)]
RichieHindle
+1 but this will only work when the lists are of the same size. izip_longest with a zip value of 0 if they are not always of the same size
Nadia Alramli
Nice, but it doesn't save a lot of typing, and the original code is over three times faster.
kotlinski
@kotlinski- hmm, you are right
Nadia Alramli
what size of input lists do you use to check performance?
SilentGhost
As in question, 3.
kotlinski
who cares about 3? how do you type it for 100 items?
SilentGhost
Well, three is common for representing vertexes in three dimensions :)
kotlinski
well if you want to know how sum two lists of length three pair-wise then you should have explicitly stated that. your method might be the fastest one, but your question is too localized then.
SilentGhost
Sorry, I updated the problem description now.
kotlinski
+1  A: 

[a[x] + b[x] for x in range(0,len(a))]

cartman
that's exactly what OP is already doing.
SilentGhost
This is the less typing version, please be constructive in your critism. Your blind critism is not helping anyone.
cartman
this is neither standard nor efficient. is that constructive enough for you?
SilentGhost
cartman
Chill. Please do something like measure the performance and compare or cite references.
S.Lott
about 30 % slower comparing to Nadia's version on my machine.
SilentGhost
+14  A: 

If you need efficient vector arithmetic, try Numpy.

>>> import numpy
>>> a=numpy.array([0,1,2])
>>> b=numpy.array([3,4,5])
>>> a+b
array([3, 5, 7])
>>>

Or (thanks, Andrew Jaffe),

>>> a += b
>>> a
array([3, 5, 7])
>>>
gimel
nb. OP wants a+=b, really -- see my answer, below! ;-)
Andrew Jaffe
Looks like a good way to save typing, but I don't like that it adds a dependency and is three times slower than the original code.
kotlinski
+3  A: 

Or, if you're willing to use an external library (and fixed-length arrays), use numpy, which has "+=" and related operations for in-place operations.

import numpy as np
a = np.array([0, 1, 2])
b = np.array([3, 4, 5])
a += b
Andrew Jaffe
+14  A: 

While Numeric is excellent, and list-comprehension solutions OK if you actually wanted to create a new list, I'm surprised nobody suggested the "one obvious way to do it" -- a simple for loop! Best:

for i, bi in enumerate(b): a[i] += bi

Also OK, kinda sorta:

for i in xrange(len(a)): a[i] += b[i]
Alex Martelli
+1, this is the obvious solution to me.
Kiv
Faster than the other solutions, but still only half as fast.
kotlinski
A: 

An improvement (less memory consumption) of the comprehension list

import itertools a = [x+y for x,y in itertools.izip(a,b)]

Actually if you are not sure that a will be consume then I would even go with generator expression:

(x+y for x,y in itertools.izip(a,b))

odwl
+5  A: 

If you think Numpy is overkill, this should be really fast, because this code runs in pure C (map() and __add__() are both directly implemented in C):

a = [1.0,2.0,3.0]
b = [4.0,5.0,6.0]

c = map(float.__add__, a, b)

Or alternatively, if you don't know the type in the list:

c = map(lambda x,y: x+y, a, b)

or

def add(x,y):
    return x+y

c = map(add, a, b)
Georg
This is a really cool answer, but unfortunately three times slower than the original code.
kotlinski
This really suprises me. At least the first version should be faster. Maybe it's only faster if you have larger lists.
Georg
+3  A: 

I don't think you will find a faster solution than the 3 sums proposed in the question. The advantages of numpy are visible with larger vectors, and also if you need other operators. numpy is specially useful with matrixes, witch are trick to do with python lists.

Still, yet another way to do it :D

In [1]: a = [1,2,3]

In [2]: b = [2,3,4]

In [3]: map(sum, zip(a,b))
Out[3]: [3, 5, 7]

Edit: you can also use the izip from itertools, a generator version of zip

In [5]: from itertools import izip

In [6]: map(sum, izip(a,b))
Out[6]: [3, 5, 7]
Renato Besen