I tried
[EMAIL PROTECTED]:~$ tar -zxvf sage-3.1.3-sage.math-only-x86_64-
Linux.tar.gz
(copied from
http://sage.math.washington.edu/home/mabshoff/release-cycles-3.1.3/)
and it gives me the error:
sage-3.1.3-sage.math-only-x86_64-Linux/local/lib/clisp-2.46/base/
width.o
sage-3.1.3-sage.math-only
It is indeed weird! I'm not really sure what's going on. I think the
simplest thing to do right now is just to run the notebook on a
different machine, since I want to reserve this machine for my
research anyway. (For the record, I was running 64 bit Ubuntu.)
Thanks all, JV
--~--~-~--~
ay to limit the total memory that the notebook is allowed
to use? I see there is a ulimit command, but I would guess this
limits each individual process, not the total memory used?
Thanks,
John Voight
Assistant Professor of Mathematics
University of Vermont
[EMAIL PROTECTED]
[EMAIL PROTECTED]
http://w
fed to the
sage.math notebook. (This is a real life example from lunch with a
colleague a month ago!)
Yours,
John Voight
Assistant Professor of Mathematics
University of Vermont
[EMAIL PROTECTED]
[EMAIL PROTECTED]
http://www.cems.uvm.edu/~voight/
--~--~-~--~~~---~-
Is there a canonical way to sort elements of an algebraic number
field? I can think of one or two, but this is a needlessly costly
thing to do, IMHO.
JV
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this
Yes, the ordering of the elements does not at all affect the
correctness of the output--the most mathematically correct thing would
be to output a set. This change can be due to any number of things,
but it's probably not worth ascertaining the exact cause.
JV
--~--~-~--~~-
Hello!
I've run some Sage labs using the notebook here at UVM and two things
have come up.
(1) At the end of class, I asked my students to print out their work
and turn it in. I stopped this almost immediately, since the
printouts are hugely wasteful: blank pages, things overrun the
margins, et
I got the same error message. I installed 2.10.2 fresh on a Ubuntu
x64, and after applying a patch and attempting to compile, it gave me
the error.
JV
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this g
Oh, the "instance" that I was referring to is just the language I
picked up from reading sage/libs/pari/gen.pyx: it appeared as though
pari('') was shorthand for a globally defined PariInstance. The
"old instance" is the one you can obtain externally from pure Python
code. Is this not what is ha
at makes the memory issues even
worse!)
Yours,
John Voight
Assistant Professor of Mathematics
University of Vermont
[EMAIL PROTECTED]
[EMAIL PROTECTED]
http://www.cems.uvm.edu/~voight/
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroup
er.
Yours,
John Voight
Assistant Professor of Mathematics
University of Vermont
[EMAIL PROTECTED]
[EMAIL PROTECTED]
http://www.cems.uvm.edu/~voight/
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this group, sen
Hi Will,
> > (I also tried the 64-bit.)
>
> I'm curious about how that failed.
I downloaded
http://www.sagemath.org/SAGEbin/linux/64bit/sage-2.9.2-ubuntu64-opteron-x86_64-Linux.tar.gz
and untarred and got a different error message:
[EMAIL PROTECTED]:~/sage-2.9.2$ ./sage
--
e.bin)
sage.bin: /lib32/libc.so.6: version `GLIBC_2.4' not found (required by
sage.bin)
python: /lib32/libc.so.6: version `GLIBC_2.4' not found (required by
python)
(I also tried the 64-bit.) Forgive the naive question, but what does
this mean?!
Thanks for your help.
John Voight
Assista
Sure William, done. Like oh so many things, once you know what to do,
it's trivial! JV
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit th
Jason: The VMware appliance is only terminal-based.
But I found what I needed. An appropriate modification of:
http://ubuntu-utah.ubuntuforums.org/showthread.php?t=303319
works just fine.
Thanks all, JV
--~--~-~--~~~---~--~~
To post to this group, send email to
Thanks Yi and Nils,
Yi: I wasn't sure this really applied, as Ubuntu seems to lack an /etc/
inittab file. But anyway I downloaded and installed mingetty, created
such a file according to the website, and there is still no automatic
login.
Nils: I also created a /etc/init.d/sage file like yours,
the
first place (!) and its interference with the DSage network
connection. I'd like to be able to just reboot every 12 or 24 hours
or so, but in order for that to resolve these issues, I apparently
need to really reboot both the Windows machine and the VMware machine
(not just pause and rest
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
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?
JV
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this
How do I use matrix (or Matrix?) inside python files which are
compiled? Suppose I have a file:
def my_matrix(d):
return Matrix(ZZ,d,d,[ [i+j for i in range(d)] for j in range(d)])
I include it in my favorite directory, and compile SAGE, and run:
sage: my_matrix(3)
I just downloaded a new tarball from sage.math. JV
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.co
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-
binop -I/home/kostadm/sage/devel/sage-main -o sage/matrix/misc.c sage/
matrix/
Thanks, somehow I knew this was going to become a trac ticket. It is
also my suspicion that it is an optimization issue with number
fields. It seems really bizarre that it should be calling a
polynomial ring constructor!
(The cost right now is absolutely killing me right now. I've started
enum
x}
50.0830.0000.0830.000 {method 'base_ring' of
'sage.structure.parent_base.ParentWithBase' objects}
Woah! Can someone explain to me the various calls above? I'd think
this should take epsilon time to coerce the elements of the sequence.
Or perhaps
sage: ZZ['x']
Univariate Polynomial Ring in x over Integer Ring
sage: F = NumberField(x^2+1)
---
Traceback (most recent call
last)
/home/jvoight/ in ()
/home/jvoight/sage/local/lib/python2.5/site-packages/sage/r
I tried that.
sage login: root
Password: sage
No dice.
Did this change and I need to acquire a new VMware appliance?
JV
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this group, send email to [EMAIL
Hi,
What is the root password for the VMware SAGE installation? I can't
make any changes to the necessary directories (patches, etc.) when I
am logged in as "manage" or even when I abort from sage when logged in
as "sage".
Thanks, JV
--~--~-~--~~~---~--~~
To po
Wow, cool! Thanks! JV
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/sage-devel
URLs: htt
/totallyreal_mit.pdf
(Sorry about the orange squares, they're a vestige of foiltex...)
Yours,
John Voight
Assistant Professor of Mathematics
University of Vermont
[EMAIL PROTECTED]
[EMAIL PROTECTED]
http://www.cems.uvm.edu/~voight/
--~--~-~--~~~---~--~~
To post to this
I think I figured out a brutal way: Just delete the $HOME/.dsage/dsage
directory!
There must be a better way...
JV
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECT
I start a DSage server, then add several jobs to it, then kill SAGE.
Then I start DSage up again, and start workers. These workers go
after the dead jobs! Maybe this is a feature?
How do I get a "clean" DSage server?
Thanks, JV
--~--~-~--~~~---~--~~
To post t
Boo. Only part of gcc gets installed by Ubuntu. I had to
sudo apt-get install build-essential.
Now we're good.
JV
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROT
Hi all,
I did a fresh install of Ubuntu, downloaded 2.8.7, then did a sage -
upgrade, and got the following error:
[EMAIL PROTECTED]:/home/kostadm/sage# ./sage -upgrade
[...]
GCC Version
gcc -v
Using built-in specs.
Target: i486-linux-gnu
Configured with: ../src/configure -v --enable-languages=
Hello all,
We did a fresh install of RHEL 5 and tried to install sage-2.8.6 (and .
7), and we got the following error message:
The SAGE install tree may have moved.
Regenerating Python.pyo and .pyc files that hardcode the install PATH
(please wait less than a minute)...
Please do not interrupt t
Hi Robert,
I can't seem to get primessq to be defined as a cdef long*. I've
tried
cdef long primessq[46] = [...]
cdef long *primessq = [...]
etc. and they always give errors. Cython doesn't allow you to use
macros (#define) I guess?
JV
--~--~-~--~~~---~--~
This must be a different cython, no?
http://campbell.nu/oscar/cython/cython-doc.html
Weird!
JV
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more optio
Thanks Yi,
It's definitely a start. I absolutely need Cython compatibility--the
whole reason I'm using SAGE is the ease at which I can write optimized
code.
Should we make this a trac ticket? Why can't the dsage worker just
execute a load command?
JV
--~--~-~--~~~---
Thanks Yi,
I was able to install your patch. What exactly did this fix?
Do I still have to follow the long instructions about modifying the
job in case I want to include functions from a file--or is that still
under development?
JV
--~--~-~--~~~---~--~~
To pos
Cool, count me in! JV
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/sage-devel
URLs: http
rom is all Windows machines.
I've gotten it to work with sage.math running as the client/server--
does that especially bother you, Will?
Yours,
John Voight
Assistant Professor of Mathematics
University of Vermont
[EMAIL PROTECTED]
[EMAIL PROTECTED]
http://www.cems.
Anyone get DSage to work under Windows/VMware?
I'm able to get workers (under Windows) to connect to sage.math when I
run the client/server there, so that works. But repeating the same
client/server steps on a Windows machine has yielded nothing. Just
wondered if anyone has tried this--or maybe
What is "screen"? Unfortunately, it is not an easy thing to Google!
JV
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at ht
Beautiful, thanks! No my unbelievably trivial problem can be solved
extremely fast. There appears to be something else which is
inexplicably eating up time now--maybe coercion between PARI and SAGE
integers in other places...
JV
--~--~-~--~~~---~--~~
To post to
I decided on something like this:
-
cimport sage.rings.integer
primessq = [4, 9, 25, 49, 121, 169, 289, 361, 529, 841, 961, 1369,
1681, 1849,
2209, 2809, 3481, 3721, 4489, 5041, 5329, 6241, 6889,
7921, 9409]
len_primes = 25
def int_has_small_square_divisor(sage.rings.integer.In
d
working in PARI, SAGE, and some bits of Cython, but it's always
conversion that is killing me.
Ideas welcome!
John Voight
Assistant Professor of Mathematics
University of Vermont
[EMAIL PROTECTED]
[EMAIL PROTECTED]
http://www.cems.uvm.edu/~voight/
--~--~-~--~~~-
Indeed! Next time this comes up, I will take care of it myself and
send you a patch. :)
JV
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, v
Thanks Will very much!
So wait, is that all? You only need to modify the sage/libs/pari/
gen.pyx file with the right C-named pari function? That seems a
little too easy!
JV
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
OK, done. I'll see if I can make any progress on it myself.
JV
--~--~-~--~~~---~--~~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://gro
Hello all,
I've asked for a few pari functions in SAGE, and now I'm about to ask
for another: I need nfrootsof1.
For my own edumacation, I'd slightly prefer if someone were to show me
how to do it. I can't seem to follow Martin's write-up in the
Programming Guide.
Thanks, JV
--~--~-~
Of course, I'm local! So let me know what I can do, I'm happy to help
in any way.
John Voight
Assistant Professor of Mathematics
University of Vermont
[EMAIL PROTECTED]
[EMAIL PROTECTED]
http://www.cems.uvm.edu/~voight/
--~--~-~--~~~---~--~~
To po
code is that you
> try to free memory in the __del__ function, which is the wrong place
> (don't ask my whey they named it as such). This should be done in a
> __dealloc__ function instead (which is perhaps leading to one memory
> leak, but it looks like it only happens once.
Than
right?
I can save on creating anything outside of Pari if I create a public
method in my data type which stores the one existing polynomial I'm
considering. Is there any better way of porting an int[] into Python/
SAGE without doing the naive thing that I did above?
Yours,
John Voight
Assista
it's through with it? Garbage collection won't deal?
Thoughts?
Thanks again,
John Voight
Assistant Professor of Mathematics
University of Vermont
[EMAIL PROTECTED]
[EMAIL PROTECTED]://www.cems.uvm.edu/~voight/
--~--~-~--~~~---~--~~
To pos
27;re promising to eventually have a cluster of about 20 computers
with around 3.0 GHz processors. Eventually. :)
John Voight
Assistant Professor of Mathematics
University of Vermont
[EMAIL PROTECTED]
[EMAIL PROTECTED]
http://www.cems.uvm.edu/~voight/
--~--~-~--~~~--
Hi Michael,
> John's code doesn't leak memory, Sage doesn't outright leak any memory
> (well, more than usual, the is still some "possibly lost" and "still
> reachable". After about an hour on sage.math we are approaching about
> 1GB of memory consumption. I am not sure how much longer the
> comp
Hi Will,
> Hey, that code is really pretty. Mind if I include it in Sage soon? That
> would make it easier for other people to try it out and contribute back.
Thanks! I'd be thrilled. Still working hard on optimization, so
since it's only a "secondary" algorithm so to speak, I'd like to wai
Hi Will,
> Hey, that code is really pretty. Mind if I include it in Sage soon? That
> would make it easier for other people to try it out and contribute back.
Thanks! I'd be thrilled. Still working hard on optimization, so
since it's only a "secondary" algorithm so to speak, I'd like to wai
Thanks Michael,
The bug only pops up after about an hour of computation. The code is
http://www.cems.uvm.edu/~voight/tr_data.spyx
http://www.cems.uvm.edu/~voight/totallyreal.py
and what I ran was
sage: load tr_data.spyx
sage: load totallyreal.py
sage: time enumerate_totallyreal_fields(
emory leak on my hands? I would be a little
surprised if it is the latter, since it only shows up after a
significant length of time in the algorithm, but anything is
possible...
Wish I could be part of the bug squash on Thursday, I'll be up in
Montreal that day!
Yours,
John Voight
Assista
y adjoined--but when
you adjoin a new element it compares it to the existing one and
inductively builds from there...
John Voight
Assistant Professor of Mathematics
University of Vermont
[EMAIL PROTECTED]
[EMAIL PROTECTED]
http://www.cems.uvm.e
do
procedure|for> f := Polynomial([d,0,1]);
procedure|for> K := NumberField(f);1]);
procedure|for> _ := Discriminant(K);
procedure|for> end for;
procedure> end procedure;
> time DumberListFields(10^4);
Time: 0.550
Any ideas here? Presumably, one can calculate a maximal order and
h
and have certain advantages.
I'm not sure I've added much to your discussion, but anyway, thanks
for looking into this.
Yours,
John Voight
Assistant Professor of Mathematics
University of Vermont
[EMAIL PROTECTED]
[EMAIL PROTECTED]
http://www.cems.uv
sage.structure.sage_object.SageObject' objects}
9710.1010.0000.9220.001 number_field.py:
157(NumberField)
[...]
It'd better not be the case that invariants of the field are
automatically computed...!
(8) When printing a list of integers, why does it print vertically
from f to coeffs?
I tried to get around this myself, but due to my status as a cherub
SAGE programmer, I couldn't ascertain the right data types to use...
Yours,
John Voight
Assistant Professor of Mathematics
University of Vermont
[EMAIL PROTECTED]
[EMAIL PROTECTED]
http:/
r so), and have small degree (<= 11). The problem is
that there are zillions of them--so I need this data very quickly!
Any advice would be most appreciated.
Yours,
John Voight
Assistant Professor of Mathematics
University of Vermont
[EMAIL PROTECTED]
[EMAIL PROT
Newton method which also in many cases
beat the root finding in numpy--but only because of overhead costs.
Note that these trial runs use very little of the number field
machinery: the bottleneck is still real arithmetic and whatever other
overhead is sneaking in... Very frustrating!
Yours,
J
we need to find the root in an
interval given by the adjacent roots of the derivatives.]
Any suggestions or guidance that any of you have would be most
appreciated.
Thanks,
John Voight
Assistant Professor of Mathematics
University of Vermont
[EMAIL PROTECTED]
[EMAIL PROTECTED]
h
67 matches
Mail list logo
