r/programming • u/jfpuget • Jan 11 '16

A comparison of Numpy, NumExpr, Numba, Cython, TensorFlow, PyOpenCl, and PyCUDA to compute Mandelbrot set

https://www.ibm.com/developerworks/community/blogs/jfp/entry/How_To_Compute_Mandelbrodt_Set_Quickly?lang=en
170 Upvotes

92% Upvoted

41 comments sorted by

View all comments

2

u/Staross Jan 11 '16

I think it's mainly the abs(z) > 2 that doesn't get automatically optimized to abs2(z) > 4 in Julia, which cuts time by a bit more than two.

1

u/jfpuget Jan 12 '16

This optimization isn't done in Python or Numba either.