> On Fri, 13 Feb 2009 17:04:48 +0100 Sturla Molden wrote:
> Yes, running a lot of monte carlo simulations back-to-back. if the
> PRNG were twice as fast, my code would be twice as fast. It isn't that
> unbelievable...
Profile before you make such bold statements. You are implying that your
sim
On Fri, Feb 13, 2009 at 10:17, Michael S. Gilbert
wrote:
> On Fri, 13 Feb 2009 17:04:48 +0100 Sturla Molden wrote:
>> So you have a simulation written in *Python*, and the major bottleneck
>> is the MT prng? Forgive me for not believing it.
>
> Yes, running a lot of monte carlo simulations back-to
Fri, 13 Feb 2009 12:04:12 -0800, David Henderson wrote:
> I'd like accumulate the summation in extended precision, "double" sum
> for float inputs, "long double" sum for "double" inputs.
>
> A way of doing this is to add an optional third argument to dot - to
> specify the summation type.
`dot`
Hello all,
I'd like accumulate the summation in extended precision, "double"
sum for float inputs, "long double" sum for "double" inputs.
A way of doing this is to add an optional third argument to dot - to
specify the summation type.
I've looked into the code, and the source file multiarr
Hi Stefan,
I tried the installer and it did not copy bilateral.py. I tried to improve it
and the result is in the attached file. I hope it would pass the mail filter,
if not contact me directly to the email address below.
Nadav.
-הודעה מקורית-
מאת: numpy-discussion-boun...@scipy.
Thanks alot people, my problem is gone now.
Keith Goodman skrev:
> On Thu, Feb 12, 2009 at 9:21 AM, Ralph Kube wrote:
>> The same happens on the ipython prompt:
>>
>> 0.145 * 0.005 = 28.996
>> N.int32(0.145 * 0.005) = 28
>>
>> Any ideas how to deal with this?
>
> Do you want the answ
On Fri, 13 Feb 2009 17:04:48 +0100 Sturla Molden wrote:
> So you have a simulation written in *Python*, and the major bottleneck
> is the MT prng? Forgive me for not believing it.
Yes, running a lot of monte carlo simulations back-to-back. if the
PRNG were twice as fast, my code would be twice a
On 2/13/2009 4:51 PM, Michael S. Gilbert wrote:
> It's not about saving milliseconds, it's about taking half the time to
> run the same simulation. So if my runs currently take 2 hours, they
> will take 1 hour instead; and if they take 2 days, they will take 1
> day instead. It may not impact you
On Fri, 13 Feb 2009 16:25:37 +0100 Sturla Molden wrote:
> Honestly, I don't care about 2x differences here. How many milliseconds
> do you save?
It's not about saving milliseconds, it's about taking half the time to
run the same simulation. So if my runs currently take 2 hours, they
will take 1
On 2/13/2009 4:07 PM, Michael S. Gilbert wrote:
> I'm not "obsessed" with speed, but a 2x improvement is quite
> significant.
Honestly, I don't care about 2x differences here. How many milliseconds
do you save?
The PRNG in SciPy is fast enough for 99% of any use I can conceive. I
have yet to s
On Fri, 13 Feb 2009 12:54:10 +0100 Sturla Molden wrote:
> If you are that obsessed with speed, consider to use the new SIMD
> version of the Mersenne Twister instead of Jean-Sebastien Roy's
> randomkit.c (used by NumPy). But I think randomkit.c is fast enough for
> most purposes.
>
> http://www
On 2/12/2009 9:46 PM, Michael S. Gilbert wrote:
> I'll put together a proof of concept when I have the time.
If you are that obsessed with speed, consider to use the new SIMD
version of the Mersenne Twister instead of Jean-Sebastien Roy's
randomkit.c (used by NumPy). But I think randomkit.c is
I'm using rpy2 to access the R statistical programming runtime from
Python, and one of rpy2's nice features is that wrappers for R arrays
support the Python array interface (via __array_struct__), so that one
can conveniently cast them to numpy arrays and edit them in place.
But this seems to expo
Hi Nadav
2009/2/13 Nadav Horesh :
>
> Attached here a code for bilateral filter:
>
> 1. The code is composed of a cython back end (bilateral_base.pyx) and a
> python front end (bilateral.py)
> 2. I do not have the tools to make windows binaries (I run it on gentoo
> linux) .
> 3. It is not hard
14 matches
Mail list logo
