On Dec 10, 2007 11:04 PM, David Cournapeau <[EMAIL PROTECTED]> wrote:
> On Dec 11, 2007 12:46 PM, Andrew Straw <[EMAIL PROTECTED]> wrote:
> > According to the QEMU website, QEMU does not (yet) emulate SSE on x86
> > target, so a Windows installation on a QEMU virtual machine may be a
> > good way t
On Dec 11, 2007 12:46 PM, Andrew Straw <[EMAIL PROTECTED]> wrote:
> According to the QEMU website, QEMU does not (yet) emulate SSE on x86
> target, so a Windows installation on a QEMU virtual machine may be a
> good way to build binaries free of these issues.
> http://fabrice.bellard.free.fr/qemu/q
On Dec 11, 2007 11:59 AM, Andrew Straw <[EMAIL PROTECTED]> wrote:
> An idea that occurred to me after reading Fernando's email. A function
> could be called at numpy import time that specifically checks for the
> instruction set on the CPU running and makes sure that is completely
> covers the inst
On Dec 11, 2007 11:03 AM, Fernando Perez <[EMAIL PROTECTED]> wrote:
> On Dec 10, 2007 4:41 PM, Robert Kern <[EMAIL PROTECTED]> wrote:
>
> > The current situation is untenable. I will gladly accept a slow BLAS for an
> > official binary that won't segfault anywhere. We can look for a faster BLAS
>
Andrew Straw wrote:
> A function
> could be called at numpy import time that specifically checks for the
> instruction set on the CPU running
Even better would be a run-time selection of the "best" version. I've
often fantasized about an ATLAS that could do this.
I think the Intel MKL has this
This may be a naive question, but just to be sure...
If troubles building without SSE2 support on an SSE2
processor are the problem, withould the problem be addressed
by purchasing an old PIII like
http://cgi.ebay.com/Dell-OptiPlex-GX110-Pentium-III-1GHz-40GB-256MB-DVD-XP_W0QQitemZ130180707038QQih
According to the QEMU website, QEMU does not (yet) emulate SSE on x86
target, so a Windows installation on a QEMU virtual machine may be a
good way to build binaries free of these issues.
http://fabrice.bellard.free.fr/qemu/qemu-tech.html
-Andrew
Travis E. Oliphant wrote:
> Fernando Perez wrote:
Fernando Perez wrote:
> On Dec 10, 2007 4:41 PM, Robert Kern <[EMAIL PROTECTED]> wrote:
>
>
>> The current situation is untenable. I will gladly accept a slow BLAS for an
>> official binary that won't segfault anywhere. We can look for a faster BLAS
>> later.
>>
>
> Just to add a note to t
An idea that occurred to me after reading Fernando's email. A function
could be called at numpy import time that specifically checks for the
instruction set on the CPU running and makes sure that is completely
covers the instruction set available through all the various calls,
including to BLAS. If
On Dec 10, 2007 4:41 PM, Robert Kern <[EMAIL PROTECTED]> wrote:
> The current situation is untenable. I will gladly accept a slow BLAS for an
> official binary that won't segfault anywhere. We can look for a faster BLAS
> later.
Just to add a note to this: John Hunter and I just finished teachin
David M. Cooke wrote:
> On Dec 10, 2007, at 10:30 , Matthieu Brucher wrote:
>> 2007/12/10, Alexander Michael <[EMAIL PROTECTED]>: On Dec 10, 2007
>> 6:48 AM, David Cournapeau <[EMAIL PROTECTED]> wrote:
>>> Hi,
>>>
>>> Several people reported problems with numpy 1.0.4 (See #627 and
>>> #628, b
On Dec 10, 2007 10:59 PM, Alexander Michael <[EMAIL PROTECTED]> wrote:
> On Dec 10, 2007 6:48 AM, David Cournapeau <[EMAIL PROTECTED]> wrote:
> > Hi,
> >
> > Several people reported problems with numpy 1.0.4 (See #627 and
> > #628, but also other problems mentionned on the ML, which I cannot
>
On Dec 10, 2007 7:21 AM, Hans Meine <[EMAIL PROTECTED]> wrote:
> Hi again,
>
> I noticed that clip() needs two parameters, but wouldn't it be nice and
> straightforward to just pass min= or max= as keyword arg?
>
> In [2]: a = arange(10)
>
> In [3]: a.clip(min = 2, max = 5)
> Out[3]: array([2, 2,
On Dec 10, 2007, at 10:30 , Matthieu Brucher wrote:
> 2007/12/10, Alexander Michael <[EMAIL PROTECTED]>: On Dec 10, 2007
> 6:48 AM, David Cournapeau <[EMAIL PROTECTED]> wrote:
> > Hi,
> >
> > Several people reported problems with numpy 1.0.4 (See #627 and
> > #628, but also other problems men
Hans Meine wrote:
> Hi!
>
> Is there a way to query the minimum and maximum values of the numpy datatypes?
>
numpy.iinfo (notice the two i's) (integer information)
numpy.finfo (floating point information)
Example:
numpy.iinfo(numpy.uint8).max
numpy.iinfo(numpy.int16).min
You pass the dataty
I had the same problem sooner today, someone told me the answer : use
numpy.info object ;)
Matthieu
2007/12/10, Hans Meine <[EMAIL PROTECTED]>:
>
> Hi!
>
> Is there a way to query the minimum and maximum values of the numpy
> datatypes?
>
> E.g. numpy.uint8.max == 255, numpy.uint8.min == 0 (these
2007/12/10, Alexander Michael <[EMAIL PROTECTED]>:
>
> On Dec 10, 2007 6:48 AM, David Cournapeau <[EMAIL PROTECTED]>
> wrote:
> > Hi,
> >
> > Several people reported problems with numpy 1.0.4 (See #627 and
> > #628, but also other problems mentionned on the ML, which I cannot
> > find). They we
Hello there,
indeed, the tasks you described correspond to what I'm seeking to
implement. The thing is, for the sake of encapsulation (and laziness
in the programming sense), I'm keeping responsibilities well defined
in several objects. I guess this type of coding is pretty much
ordinary for an OO
many thanks for answering Matthieu
Actually my problem concerned the old command "matrixmultiply" vs "dot".
I solved it now.
However I have a question regarding Tkinter.
I am doing a small 3D engine using Tkinter, Pmw and, numpy.
I am basically plotting the result from the matrix calcula
Hi!
Is there a way to query the minimum and maximum values of the numpy datatypes?
E.g. numpy.uint8.max == 255, numpy.uint8.min == 0 (these attributes exist, but
they are functions, obviously for technical reasons).
Ciao, / /
/--/
/ / ANS
_
Hi again,
I noticed that clip() needs two parameters, but wouldn't it be nice and
straightforward to just pass min= or max= as keyword arg?
In [2]: a = arange(10)
In [3]: a.clip(min = 2, max = 5)
Out[3]: array([2, 2, 2, 3, 4, 5, 5, 5, 5, 5])
In [4]: a.clip(min = 2)
On Dec 10, 2007 6:48 AM, David Cournapeau <[EMAIL PROTECTED]> wrote:
> Hi,
>
> Several people reported problems with numpy 1.0.4 (See #627 and
> #628, but also other problems mentionned on the ML, which I cannot
> find). They were all solved, as far as I know, by a binary I produced
> (simply u
Hi,
Several people reported problems with numpy 1.0.4 (See #627 and
#628, but also other problems mentionned on the ML, which I cannot
find). They were all solved, as far as I know, by a binary I produced
(simply using mingw + netlib BLAS/LAPACK, no ATLAS). Maybe it would be
good to use t
Excellent, that was what I was looking for, thank you.
Matthieu
2007/12/10, Fabrice Silva <[EMAIL PROTECTED]>:
>
> Le lundi 10 décembre 2007 à 11:38 +0100, Matthieu Brucher a écrit :
> > Hi,
> > Is there somewhere a equivalent to std::numerical_limits<>::epsilon,
> > that is, the greatest value s
Le lundi 10 décembre 2007 à 11:38 +0100, Matthieu Brucher a écrit :
> Hi,
> Is there somewhere a equivalent to std::numerical_limits<>::epsilon,
> that is, the greatest value such that 1. + epsilon is numerically
> equal to 1. ?
> I saw something that could be related in oldnumeric, but nothing in
Hi,
Is there somewhere a equivalent to std::numerical_limits<>::epsilon, that
is, the greatest value such that 1. + epsilon is numerically equal to 1. ?
I saw something that could be related in oldnumeric, but nothing in numpy
itself.
Matthieu
--
French PhD student
Website : http://matthieu-bruc
It's "Not A Number". It can occur when you have a division by zero, a
difference between two infinite numbers, ...
Matthieu
2007/12/10, Jean-Luc Régnier <[EMAIL PROTECTED]>:
>
> Hello,
> I switched from numarray to numpy and I have now some "NaN"
> in my matrix. What that means ?
> None a numeric
Hello,
I switched from numarray to numpy and I have now some "NaN"
in my matrix. What that means ?
None a numeric ?
regards
Jean-Luc REGNIER
ACR Mimarlik Ltd. Sti
Savas Cad. 26/B Sirinyali
ANTALYA, TURKEY
Tel. & Fax: 0090-(0).242.316.08.09
GSM: 0090-0.532.303.36.21
http://
28 matches
Mail list logo
