擅长:python、mysql、java
<p><code>g(x)</code>几乎可以肯定是您的瓶颈。一个非常快速和肮脏的解决方案是将其矢量化以对整数数组进行运算,然后使用<a href="http://docs.scipy.org/doc/numpy/reference/generated/numpy.trapz.html" rel="nofollow">^{<cd2>}</a>使用梯形规则来估计积分:</p>
<pre><code>import numpy as np
# appropriate range and step size depends on how accurate you need to be and how
# quickly the sum converges
xmin = -1000000
xmax = 1000000
dx = 1
x = np.arange(xmin, xmax + dx, dx)
gx = (2 / np.sqrt(3)) * np.pi**(-0.25)*(1 - x**2) * np.exp(-x**2 / 2)
sum_gx = np.trapz(gx, x, dx)
</code></pre>
<p>除此之外,您还可以使用Cython或numba重写<code>g(x)</code>,以加快速度。在</p>