Re: [Numpy-discussion] method to calculate the magnitude squared

2015-09-20 Thread R Schumacher
At 10:01 AM 9/20/2015, you wrote: Is that not the same as   np.abs(z)**2 ? It is, but since that involves taking sqrt, it is *much* slower. Even now, ``` In [32]: r = np.arange(1)*(1+1j) In [33]: %timeit np.abs(r)**2 1000 loops, best of 3: 213 µs per loop In [34]: %timeit r.real**2 +

[Numpy-discussion] Governance model request

2015-09-20 Thread Travis Oliphant
After long conversations at BIDS this weekend and after reading the entire governance document, I realized that the steering council is very large and I don't agree with the mechanism by which it is chosen. A one year time frame is pretty short on the context of a two decades old project and I

[Numpy-discussion] Update on the recent mailing list outage

2015-09-20 Thread Nathaniel Smith
Hi all, I'm sure you all noticed that numpy-discussion was down for 4-5 days this week. Apparently this was due to some unnoticed misconfigurations that were triggered when moving it from the ancient and unmaintainable server that it's been on for the last umpteen years. Some more details are

[Numpy-discussion] draft NEP for breaking ufunc ABI in a controlled way

2015-09-20 Thread Nathaniel Smith
Hi all, Here's a first draft NEP for comments. -- Synopsis Improving numpy's dtype system requires that ufunc loops start having access to details of the specific dtype instance they are acting on: e.g. an implementation of np.equal for strings needs access to the dtype object in

Re: [Numpy-discussion] method to calculate the magnitude squared

2015-09-20 Thread Antoine Pitrou
On Fri, 18 Sep 2015 21:16:42 -0700 Phillip Feldman wrote: > In communications and signal processing, it is frequently necessary to > calculate the power of a signal. This can be done with a function like the > following: > > def magsq(z): >""" >Return the

Re: [Numpy-discussion] method to calculate the magnitude squared

2015-09-20 Thread Marten van Kerkwijk
> > Is that not the same as > np.abs(z)**2 ? > It is, but since that involves taking sqrt, it is *much* slower. Even now, ``` In [32]: r = np.arange(1)*(1+1j) In [33]: %timeit np.abs(r)**2 1000 loops, best of 3: 213 µs per loop In [34]: %timeit r.real**2 + r.imag**2 1 loops, best of

[Numpy-discussion] Compiling NumPy for iOS PyQt app?

2015-09-20 Thread David Morris
I have a PyQt app running on iOS and would like to add NumPy to improve calculation speed. I see a few python interpreters in the app store which use NumPy so it must be possible, however I have not been able to find any information on the build process for the iOS cross compile. We are building

Re: [Numpy-discussion] [Python-ideas] Should our default random number generator be secure?

2015-09-20 Thread Sturla Molden
On 20/09/15 21:48, Sturla Molden wrote: This is where a small subset of C++ would be handy. Making an uint128_t class with overloaded operators is a nobrainer. :-) Meh... The C++ version of PCG already has this. ___ NumPy-Discussion mailing list

Re: [Numpy-discussion] [Python-ideas] Should our default random number generator be secure?

2015-09-20 Thread Sturla Molden
On 19/09/15 18:06, Robert Kern wrote: That said, we'd probably end up doing a significant amount of rewriting so that we will have a C implementation of software-uint128 arithmetic. This is where a small subset of C++ would be handy. Making an uint128_t class with overloaded operators is a