On Sep 19, 5:37 pm, "Joel B. Mohler" <[EMAIL PROTECTED]> wrote:
> On Wednesday 19 September 2007 16:22, William Stein wrote:
>
> > I think those timings are way out of date, since Singular 3 seems
> > to be *very* fast at mod p multivariate GCD computation, even
> > though it sucks over QQ. Ch
On Sep 19, 4:22 pm, "William Stein" <[EMAIL PROTECTED]> wrote:
> On 9/19/07, mabshoff
> <[EMAIL PROTECTED]> > Well, we had
> some more discussion in #sage-devel and rpw posted an
>
> > interesting link:
>
> >http://magma.maths.usyd.edu.au/users/allan/gcdcomp.html
>
> > In summary: Singular's mult
On Aug 10, 4:28 pm, David Harvey <[EMAIL PROTECTED]> wrote:
> I'm unclear what is meant by "relative times" mentioned above. Does
> that mean (a) profile of function A relative to function B, or (b)
> profile of function A in version X vs in version Y?
A to B at a given version on a given machi
a friendly progress meter
to those not using supercomputers.
On Aug 10, 4:10 pm, "William Stein" <[EMAIL PROTECTED]> wrote:
> On 8/10/07, Jack Schmidt <[EMAIL PROTECTED]> wrote:
>
>
>
> > You might look at how GAP does this. Its tst directory contains
To make this effective, one needs to make it easier to have a trac
account. The development model here is heavily centralized making it
fairly hard to join in.
On Aug 10, 9:25 am, Martin Albrecht <[EMAIL PROTECTED]>
wrote:
> Hi there,
>
> there have been some complaints about the quality of SAG
You might look at how GAP does this. Its tst directory contains
expected timings. One only compares relative times. GAP tests do not
fail on a pentium 75mhz, since GAP users employ a wide range of
hardware. Surely other software has similar features.
On Aug 10, 3:07 pm, Martin Albrecht <[EMAI
GAP takes under a second to compute Bell(1000), compared to over a
minute (and going) for maple on the same computer.
On Jul 24, 3:32 pm, "Alec Mihailovs" <[EMAIL PROTECTED]> wrote:
> May I suggest to add timing to the examples in the documentation - that
> would be very useful.
>
> For example,
On the amd64, debian "4.0", build went smoothly. No extra tests
failed. Scipy.optimize loaded without complaint.
The following tests failed:
sage -t devel/sage-main/sage/schemes/elliptic_curves/
padic_lseries.py
sage -t devel/sage-main/sage/schemes/elliptic_curves/
ell_rational
use these fancy distributions
on a regular basis.
On Jul 22, 12:22 am, Jack Schmidt <[EMAIL PROTECTED]>
wrote:
> Yup, that works perfectly. Sorry, I thought I had already checked
> this since I ran ~/sage/sage-2.6/local/bin/hg, but that just runs the
> debian supplied copy of mercuri
expect any
more (non-fortran) issues.
On Jul 21, 11:54 pm, "William Stein" <[EMAIL PROTECTED]> wrote:
> On 7/21/07, Jack Schmidt <[EMAIL PROTECTED]> wrote:> This appears to be an
> amd64 related bug.
>
> > The 64bit version:
>
> > $ wget -qht
misidentifying the problem earlier!
$ cd ~/sage/sage-2.7/sage-2.7
$ ~/sage/sage-2.6/sage -hg verify
checking changesets
checking manifests
crosschecking files in changesets and manifests
checking files
1556 files, 5407 changesets, 15786 total revisions
$
On Jul 21, 11:47 pm, Jack Schmidt <[EMAIL
This appears to be an amd64 related bug.
The 64bit version:
$ wget -q http://www.sagemath.org/dist/src/sage-2.7.tar
$ md5sum sage-2.7.tar
31209ee51f2aace7e9df1a33e46fa89d sage-2.7.tar
$ tar -xf sage-2.7.tar
$ cd sage-2.7
$ tar -xf spkg/standard/sage-2.7.spkg
$ md5sum spkg/standard/sage-2.7.spkg
hines to try).
I put the md5sum of the whole directory at:
http://www.ms.uky.edu/~jack/sage/sage-2.7-md5.txt
On Jul 21, 12:58 pm, "William Stein" <[EMAIL PROTECTED]> wrote:
> On 7/21/07, Jack Schmidt <[EMAIL PROTECTED]> wrote:
>
>
>
> > The corruption only s
The corruption only shows up on a few critical hg commands. Here is a
log, with ~/sage/sage-2.7/ a fresh install from sage-2.7.tar
$ cd ~/sage/sage-2.7/devel/
$ tar -xf ../spkg/standard/sage-2.7.spkg
$ cd sage-2.7
$ hg verify
checking changesets
checking manifests
crosschecking files in changese
The mercurial repository contained in this tar file is corrupted
making it impossible (for me at least) to resubmit my patches. They
continue to fix the following bugs:
sage: G = PermutationGroup(['(1,2,3)', '(2,3)'])
sage: G.cayley_table()
versus:
sage: G = SymmetricGroup(3)
sage: G.cayley_t
Workaround for those who want to get a little further:
tar -xf sage-2.7.tar
cd sage-2.7
mkdir -p spkg/installed
touch spkg/installed/f2c-1
touch spkg/installed/cvxopt-0.8.2
touch spkg/installed/gfortran-20070719
Now ensure that you have a symlink to g77 in your path called
"gfortran"
make
On Ju
-u http://sagemath.org/sage/hg/doc-main
hg pull -u http://www.ms.uky.edu/~jack/sage/hg/doc-includefiles
make
hg status
ls paper-letter
ls html
On Jul 3, 11:17 am, Jack Schmidt <[EMAIL PROTECTED]>
wrote:
> I noticed doc-main is missing quite a few files found in doc-2.6.
> Some rather cr
I noticed doc-main is missing quite a few files found in doc-2.6.
Some rather critical files are not version controlled, but on the
other hand a ton of garbage files are included.
I am working on version controlling the files that should be
controlled, writing some scripts to generate necessary e
It looks nice. Here are some minor things:
Typo: This document was published using SAGE. Browser other published
documents.
Probably "Browser" should be "browse".
There might be a sizing problem for the header bar that appears when
you edit as plain text. It is mostly obscured underneath the p
For comparison, GAP stores all primes found during the current session
in Primes2, and one of the factoring methods is to trial divide by
elements of this list. Factoring rsa200=p*q takes less than a second
total if one first factors 3*p. Since GAP is not a number theory
package, Primes2 grows a
proof=True)
> CPU times: user 30.66 s, sys: 0.04 s, total: 30.70 s
> Wall time: 38.98
> 179769313486231590772930519078902473361797697894230657273430081157732675805500963132708477322407536021120113879871393357658789768814416622492847430639474124377767893424865485276302219601246094119453082952085005768838150682342462881473913110540827237163350510684586298239947245938479716304835356329624224137859
>
> Michel
> On Jun 8, 3:48
Pari uses the Baillie-Pomerance-Selfridge-Wagstaff primality test,
which at its heart is the observation that very few numbers are both
(Fermat) strong pseudoprimes base 2 and Lucas pseudoprimes for x^2+P*x
+1 where P is the smallest positive integer such that P^2 - 4 is not a
quadratic residue (f
One trick to get a few local temporary variables in GAP is to use
functions. For instance:
sage: gap.new("CallFuncList(function() local F; F := FreeGroup(2);
return F/[F.1*F.2*F.1^-1*F.2^-1]; end,[])")
I believe David Joyner has already suggested a better method for this
particular example, s
Feel free to bug me if you want help to export the data from GAP in
any particular format. The data there is a little old, Aug 2006, but
still pretty extensive. I'm not sure if the point if to double-check
them from the raw text. I'd be interested in checking for agreement
and coverage if the d
I tried the new VMWare download for sage 2.4 on Windows XP. I
downloaded the VMWare player and the two zip files from
http://modular.math.washington.edu/sage/SAGEbin/vmware/sage-2.4/
extracted both, copied SAGE0-1.vmdk into sage-vmware-appliance\sage-
vmware-appliance and double clicked on sage
25 matches
Mail list logo