Hi, On Tue, Feb 28, 2017 at 2:12 PM, Sebastian K <sebastiankas...@googlemail.com> wrote: > Thank you for your answer. > For example a very simple algorithm is a matrix multiplication. I can see > that the heap peak is much higher for the numpy version in comparison to a > pure python 3 implementation. > The heap is measured with the libmemusage from libc: > > heap peak > Maximum of all size arguments of malloc(3), all products > of nmemb*size of calloc(3), all size arguments of > realloc(3), length arguments of mmap(2), and new_size > arguments of mremap(2).

Could you post the exact code you're comparing? I think you'll find that a naive Python 3 matrix multiplication method is much, much slower than the same thing with Numpy, with arrays of any reasonable size. Cheers, Matthew _______________________________________________ NumPy-Discussion mailing list NumPy-Discussion@scipy.org https://mail.scipy.org/mailman/listinfo/numpy-discussion