[Numpy-discussion] The NumPy Mandelbrot code 16x slower than Fortran

[Ondřej Čertík]

On Sun, Jan 22, 2012 at 3:13 AM, Sebastian Haase <seb.haase at gmail.com> wrote:
> How does the algorithm and timing compare to this one:
>
> http://code.google.com/p/priithon/source/browse/Priithon/mandel.py?spec=svna6117f5e81ec00abcfb037f0f9da2937bb2ea47f&r=a6117f5e81ec00abcfb037f0f9da2937bb2ea47f
>
> The author of original version is  Dan Goodman
> # FAST FRACTALS WITH PYTHON AND NUMPY

Thanks Sebastian. This one is much faster ---- 2.7s on my laptop with
the same dimensions/iterations.

It uses a better datastructures -- it only keeps track of points that
still need to be iterated --- very clever.
If I have time, I'll try to provide an equivalent Fortran version too,
for comparison.

Ondrej