On 9/4/07, John Voight <[EMAIL PROTECTED]> wrote:
> For some reason, only "prun" and not "%prun" worked for me. Aside
> from some obvious things, the lionshare of the time is spent on root
> finding. I'll have a look at GSL, which looks very promising, and get
> back to you.
>
> (My polynomials
On 9/3/07, John Voight <[EMAIL PROTECTED]> wrote:
> Hi Will,
>
> Thanks, that was fast! If I may ask, what was the problem? Must've
> been something not particularly exciting...
Robert Miller implemented root finding for RDF polynomials right
before SAGE-2.8.3, and he messed up. Basically SAGE
On Mon, 3 Sep 2007, John Voight wrote:
> Unfortunately, even after the week's optimizations, my number field
> enumeration algorithm runs (on meccah) almost 20 times slower on SAGE
> than on Magma (181s vs. 9s)--and with identical verbose output. I
> just don't see how there can be that much of
On Sep 4, 4:31 am, "John Voight" <[EMAIL PROTECTED]> wrote:
> Hi Will,
>
> Thanks, that was fast! If I may ask, what was the problem? Must've
> been something not particularly exciting...
>
> Double precision is more than sufficient for my purposes--even floats
> (!) are fine, I just need fast
Hi Will,
Thanks, that was fast! If I may ask, what was the problem? Must've
been something not particularly exciting...
Double precision is more than sufficient for my purposes--even floats
(!) are fine, I just need fast and reasonably accurate.
Craig also whipped up a patch to include those
John,
I've fixed
http://trac.sagemath.org/sage_trac/ticket/583
I've attached a patch there, or you can do "hg_sage.pull()" (pretty
serious at this point --
also do hg_scripts.pull() if you do that); or you can wait for
SAGE-2.8.3, which is slated
for probably <= a week from now.
Is double
I looked at the LiDIA list. Christoff continues to promise the new
version is coming, this time before he goes on vacation.
Apparently the compile problems are to do with the new gcc. Some kind
person has posted the changes they made to get it working at length on
the LiDIA list.
I'll see if I c
an idea (based on http://sagemath.org/art/.html/sage-bg1-thumb.jpg)
http://moodle.projektas.lt/failai/sage/
I'd like to show some kind of convergation.., and as usulay in OS
communities - some kind of circle :)
On 9/4/07, mabshoff <[EMAIL PROTECTED]> wrote:
>
>
>
> On Sep 3, 11:02 pm, "William S
Hey John,
I'm happy to hear that you're using some number field stuff in SAGE.
As Robert mentioned in his post (and I think it was on sage-devel),
there are a few of us looking at getting this in much better shape in
the near future. In light of that, please keep telling us things you
wish
I know Carl Witty spent a lot of time doing work on real root
isolation--perhaps you could take a look at his Algebraic Reals code
(sage/rings/algebraic_real.py)
Algebraic number theory is something that a lot of us want to focus
on improving in the very near term.
- Robert
On Sep 3, 2007
On Sep 3, 11:02 pm, "William Stein" <[EMAIL PROTECTED]> wrote:
> David Joyner has a really good idea below. Any volunteers?
>
> -- Forwarded message --
> From: David Joyner <[EMAIL PROTECTED]>
> Date: Sep 3, 2007 12:56 PM
> Subject: sage logo page?
> To: William Stein <[EMAIL PR
David Joyner has a really good idea below. Any volunteers?
-- Forwarded message --
From: David Joyner <[EMAIL PROTECTED]>
Date: Sep 3, 2007 12:56 PM
Subject: sage logo page?
To: William Stein <[EMAIL PROTECTED]>
Cc: David Joyner <[EMAIL PROTECTED]>
Hi William:
I wonder if at so
On 9/3/07, Bill Hart <[EMAIL PROTECTED]> wrote:
>
> I tried to build LiDIA so I could do some timings. But it just doesn't
> build. It's a standard Opteron machine with G++ and GMP on it. I'm
> just doing a standard build, but it complains in ring_matrix.h that
> some function is missing.
The las
I believe Pari uses Buchmann's algorithm, which is apparently not
asymptotically slower as I stated. The paper I refer to is basically a
version of this algorithm based on the quadratic sieve and should be
much faster than Pari if implemented very well (in C).
Pari apparently implements algorithm
I tried to build LiDIA so I could do some timings. But it just doesn't
build. It's a standard Opteron machine with G++ and GMP on it. I'm
just doing a standard build, but it complains in ring_matrix.h that
some function is missing.
This is a shame because I understand LiDIA has an implementation
Hello all,
I've spent the last week starting on my project of computing all
totally real fields of bounded root discriminant. I've got code now
in Magma, Pari, and SAGE, and most unfortunately, the Magma code is
fastest!
The things that are slowing down SAGE right now is:
(1) The interface to P
On 9/3/07, Eric Marzolf <> wrote:
> Dear Prof. Stein,
> I am trying to build Sage on a win64 machine under cygwin with the last
> tarball of sage-2.8.3.
> There is an error about compiling the libgcrypt package : I send you the
> install.log file for more information.
> There are also previous mak
17 matches
Mail list logo
