On Nov 10, 2007 7:55 PM, John Voight <[EMAIL PROTECTED]> wrote:
>
> When I add
>
> from sage.matrix.constructor import matrix
>
> then I get the error:
>
> /home/jvoight/sage/local/lib/python2.5/site-packages/sage/matrix/
> constructor.py in ()
> 19
> #
Greeting from Sage Days 6 in Bristol,
after a short discussion we would like to make the following release
plans:
- 2.8.13 on Nov. 18th, 2007 which should be another small bugfix and
feature release.
- 2.9 on Nov. 25th, 2007 with hopefully ATLAS support and potential 64
bit OSX support as well
I hope we can do this at Dage Days 6 in the next few days.
John
On 10/11/2007, Alex Ghitza <[EMAIL PROTECTED]> wrote:
>
> -BEGIN PGP SIGNED MESSAGE-
> Hash: SHA1
>
> Hi Martin,
>
> The link to which John pointed us gives a very easy way of computing the
> trace over F_q algebraically, wi
When I add
from sage.matrix.constructor import matrix
then I get the error:
/home/jvoight/sage/local/lib/python2.5/site-packages/sage/matrix/
constructor.py in ()
19
#*
20
---> 21 import sage.rings.all as ring
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Hi Martin,
The link to which John pointed us gives a very easy way of computing the
trace over F_q algebraically, without floating point arithmetic. All we
need to do is put John's one-liner PARI code in. I would love to do
this, but I don't know h
Hi Bill:
Does it make sense to build an axiom4sage package which uses the
pre-installed clisp (since maxima comes with clisp) to make the
axiom graphics engine? If so, do you know how long such a package
would take to compile, on average?
- David
On 11/10/07, Waldek Hebisch <[EMAIL PROTECTED]> wr
On Nov 10, 12:48 am, John Voight <[EMAIL PROTECTED]> wrote:
> I tried to sage -upgrade my 2.8.9 this evening on an Ubuntu x686, and
> I got:
>
> Building sage/matrix/misc.c because it depends on sage/matrix/
> misc.pyx.
> touch sage/matrix/misc.pyx; cython --embed-positions --incref-local-
> bin
On Nov 10, 2007 11:53 AM, Steffen <[EMAIL PROTECTED]> wrote:
> Original:
> Time: CPU 9.94 s, Wall: 10.09 s
> Number of roots found:
> 0
> Tonelli:
> Time: CPU 0.00 s, Wall: 0.00 s
> Number of roots found:
> 0
Wow, that's an improvement!
I've made this trac #1138
http://trac.sagemath.org/sage
On Sat, 10 Nov 2007 00:27:45 -, John Voight <[EMAIL PROTECTED]> wrote:
> Oh, I didn't know I was going to get quoted! (That's fine, of
> course.)
>
> Are we suppose to write "SAGE" since it's an acronym or "Sage" like
> you do?
Write "Sage". There used to be an acronym, but the acronym no l
Hi,
> Could you post some cool impressive benchmarks? :-)
>
> william
ok :-)
Here the result for finding one root in GF(p) where p is 128, 256 and
512 bit prime:
Results for 128 bit prime:
Original:
Time: CPU 0.04 s, Wall: 0.04 s
Number of roots found:
1
Tonelli:
Time: CPU 0.00 s, Wall: 0.00
10 matches
Mail list logo
