[Numpy-discussion] The NumPy Mandelbrot code 16x slower than Fortran
Sun Jan 22 22:35:03 CST 2012
I was reading this while learning about Pytables in more details and the
origin of its efficiency. This sounds like a problem where out of core
computation using pytables would shine since the dataset doesn't fit into
CPU cache: http://www.pytables.org/moin/ComputingKernel. Of course
C/Cythonizing the problem would be another good way...
2012/1/22 Ondřej Čertík <firstname.lastname@example.org>
> On Sun, Jan 22, 2012 at 3:13 AM, Sebastian Haase <email@example.com>
> > How does the algorithm and timing compare to this one:
> > 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.
> NumPy-Discussion mailing list
Jonathan Rocher, PhD
Scientific software developer
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the NumPy-Discussion