为什么python这么慢_为什么是Python的纽比·波利瓦尔（）这么慢？

这本身不是答案，但是我编写了一个函数polyval_factory来生成一个mypolyval函数，给定一个类似pol的系数数组。它以字符串形式生成诸如C*C + 1.0 * C *C*C + 2.0之类的快速表达式，然后将它们封装在lambda函数中。基本上它使用字符串来代替完整的符号代数库，比如sympy。在下面的示例中定义并测试了此函数，其工作速度几乎与C*C一样快：import numpy as np

import cmath

import time

from itertools import product

def polyval_factory(pol):

"""

Generate a lambda function for evaluating a given polynomial

pol : a list of coefficients with highest degree first

Note: this function basically uses strings in lieu of a

fully symbolic algebra package like sympy

"""

poly_string_list = []

for i, coeff in enumerate(pol[::-1]):

if np.abs(coeff) > 1e-10:

if i > 1:

poly_string_list.append( repr(coeff) + '*' + '*'.join(['x']*i))

elif i == 1:

poly_string_list.append(repr(coeff)+'*x')

elif i ==0:

poly_string_list.append(repr(coeff))

lambda_str = 'lambda x :' + '+'.join(poly_string_list)

print "The prepared lambda function is: \""+lambda_str + "\""

return eval(lambda_str)

C = 0.37 + 0.45j

pol = [1,0,0]

numiter = 30000

start_time = time.time()

for i in xrange(numiter):

C = np.polyval(pol, C)

print "Polyval: {}".format( time.time() - start_time )

print C

C = 0.37 + 0.45j # forgot to reassign the initial value of C

print ""

print "Generating lambda function..."

mypolyval = polyval_factory(pol) # generate the lambda function

print ""

start_time = time.time()

for i in xrange(numiter):

C = mypolyval(C)

print "Polyval_factory: {}".format( time.time() - start_time )

print C

C = 0.37 + 0.45j # forgot to reassign the initial value of C

print ""

start_time = time.time()

for i in xrange(numiter):

C = C**2

print "Standard: {}".format( time.time() - start_time )

print C

输出为：

^{pr2}$

编辑：polyval_factory：现在运行mypolyval = polyval_factory([2.0,3.0,1.0])执行适当的操作并打印：The prepared lambda function is: "lambda x :1.0+3.0*x+2.0*x*x"