Yes, Sage 3.1.2 fixes the problem.
It looks like Marshall's method of multiplying a list of numbers with
a constant is much faster then a for loop.
I wrote two list tests:
def test1():
for k in range(10^3):
v=[2*random() for j in range(10)]
else: pass
def test2():
for k in range(10^3):
v=list(2*vector([random() for j in range(10)]))
else: pass
It turns out that
time test1() gives around 8s CUP time while time test2() shows only
0.35s CUP time is used. Wow!
On Oct 20, 5:42 pm, Jason Grout <[EMAIL PROTECTED]> wrote:
> William Stein wrote:
> > On Mon, Oct 20, 2008 at 2:24 PM, pong <[EMAIL PROTECTED]> wrote:
> >> Yes, that's what I got. Maybe because I'm only using SAGE 3.1.1 or
> >> there is something wrong with the installation.
>
> > I bet that's the case. You should maybe upgrade. We'll be posting
> > binaries soon.
>
> Yep, this was taken care of in 3.1.2:
>
> http://trac.sagemath.org/sage_trac/ticket/3847
>
> Sorry for my other delayed reply. Apparently gmane has a big delay in
> mirroring responses.
>
> Jason
--~--~---------~--~----~------------~-------~--~----~
To post to this group, send email to [email protected]
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at
http://groups.google.com/group/sage-support
URLs: http://www.sagemath.org
-~----------~----~----~----~------~----~------~--~---
