你快到了。完整的和可以写成两个一维和的乘积,即(sum exp x^2) * (sum exp y^2):
>>> import numpy as np
>>>
>>> N_x = N_y = 100
>>>
# brute force
>>> result_1 = .0
>>> for x in xrange(N_x):
... for y in xrange(N_y):
... result_1 += np.exp( (float(x)/N_x)**2 + (float(y)/N_y)**2 )
...
>>> result_1
21144.232143358553
>>>
# single product method
>>> from __future__ import division
>>>
>>> x, y = np.arange(N_x) / N_x, np.arange(N_y) / N_y
>>> np.exp(x*x).sum() * np.exp(y*y).sum()
21144.232143358469
我的猜测是,您甚至可以使用 list comp 并击败蛮力 numpy 方法:
>> rx, ry = 1.0 / (N_x*N_x), 1.0 / (N_y*N_y)
>>> sum([np.exp(rx*x*x) for x in xrange(N_x)]) * sum([np.exp(ry*y*y) for y in xrange(N_y)])
21144.232143358469
确实,在 Python3 中完成了计时,因为我不知道如何在 Python2 中使用timeit:
>>> from timeit import repeat
>>>
>>> kwds = dict(globals=globals(), number=100)
>>>
# single product - list comp
>>> repeat('sum(np.exp(rx*x*x) for x in range(N_x)) * sum(np.exp(ry*y*y) for y in range(N_y))', **kwds)
[0.0166887859813869, 0.016465034103021026, 0.016357041895389557]
>>>
# numpy brute force
>>> repeat('np.exp(np.add.outer(x*x, y*y)).sum()', **kwds)
[0.07063774298876524, 0.0348161740694195, 0.02283189189620316]
显然,numpy 单品更快
>>> repeat('np.exp(x*x).sum() * np.exp(y*y).sum()', **kwds)
[0.0031406711786985397, 0.0031003099866211414, 0.0031157969497144222]