[SciPy-dev] genetic algorithm, number theory, filterdesign,zerofinding

Chuck Harris Chuck.Harris at sdl.usu.edu
Fri Apr 12 07:22:53 CDT 2002

Hi, here are some benchmarks comparing python and c versions of some of the zero finders. There is a notable improvement in the times. I'll do up a version of the Brent routine, it's really the gold standard, clean them all up a bit and submit.

times in seconds

f(x) = 1 - x**2
a,b  = .5,2
repeat = 10000

py.bisect   : 3.616
cc.bisect   : 1.201
py.ridder   : 2.414
cc.ridder   : 0.521


More information about the Scipy-dev mailing list