[sage-devel] Re: number field arithmetic

2007-03-27 Thread William Stein
On 3/27/07, Joel B. Mohler <[EMAIL PROTECTED]> wrote: > [EMAIL PROTECTED]:~$ magma > Magma V2.13-5 Tue Mar 27 2007 07:12:02 on sage [Seed = 1950028839] > Type ? for help. Type -D to quit. > > C:=QuadraticField(-1); > > time for x in [1..10] do a:=I*I; end for; > Time: 0.260 > > time f

[sage-devel] Re: number field arithmetic

2007-03-27 Thread William Stein
On 3/27/07, David Harvey <[EMAIL PROTECTED]> wrote: > > Is there a much better way to find an inverse than > > the extended euclidean algorithm? > > In general, I don't think so, but it's quite possible (in fact I > think very likely) that magma has special code to deal with quadratic > extensio

[sage-devel] Re: number field arithmetic

2007-03-27 Thread Joel B. Mohler
On Tue, Mar 27, 2007 at 07:36:18AM -0700, William Stein wrote: > > > On 3/27/07, Joel B. Mohler <[EMAIL PROTECTED]> wrote: > > P.S.: Speed comparisons (all on sage.math). I've included the basic integer > > In all your timings below that involve a constant (e.g., 1 or 2), you > should factor >

[sage-devel] Re: number field arithmetic

2007-03-27 Thread David Harvey
On Mar 27, 2007, at 10:26 AM, Joel B. Mohler wrote: > First question, magma blows us way on division. Obviously, > division by an > integer (as in the timing below) could be made much faster by > utilizing the fact > that we have a scalar. However, this doesn't seem to be the issue > sin

[sage-devel] Re: number field arithmetic

2007-03-27 Thread William Stein
> On 3/27/07, Joel B. Mohler <[EMAIL PROTECTED]> wrote: > P.S.: Speed comparisons (all on sage.math). I've included the basic integer In all your timings below that involve a constant (e.g., 1 or 2), you should factor out the constant from the test. E.g., do a = 1; b = 2; then do the test with