On Wed, Jan 19, 2011 at 10:16 AM, kcrisman kcris...@gmail.com wrote:
On Jan 19, 8:24 am, ancienthart joalheag...@gmail.com wrote:
Attempting to use this on my matrix, I end up with the following results (D
is my matrix):
I personally wish that sage simplify functions worked as follows:
On Tue, Jan 18, 2011 at 2:35 PM, Daniel Harris
mail.dhar...@googlemail.com wrote:
Hello everybody
I am just looking at sketching graphs and I came across a problem that
has me stumped. The graph I am trying to sketch is
(x-3) / ( (x+1) * (x-2) )
now I have plotted the graph in sage on my
On Tuesday, January 18, 2011 10:19:58 AM UTC-7, einek wrote:
Hi tvn,
Am Montag, den 17.01.2011, 14:22 -0800 schrieb tvn:
I try to solve for 3 variables x y z with 3 equations as below ,
I am expecting something like z = r1, x = -r1, y = -2*r1 but instead
get x = y = z = 0 (which
In fact, many sage developers use OS X as their primary system.
On Dec 29, 2010 9:58 PM, Michael Welsh yom...@yomcat.geek.nz wrote:
Sage runs just fine in OS X.
On 30/12/2010, at 5:36 PM, DigDug_the_2nd wrote:
I am trying to choose whether to use Sage a Ubuntu machine or a Mac
running Leopard
On Tue, Dec 21, 2010 at 4:16 AM, Volker Braun vbraun.n...@gmail.com wrote:
No, it's because your loop is over 1 rather than 1000.
Sharp eyes! :)
So, to summarize, with the improved Cython one should always use isinstance
as it will be optimized to be at least as fast.
Yes, as long as the
On Tue, Dec 21, 2010 at 10:29 AM, Jason Grout
jason-s...@creativetrax.com wrote:
On 12/21/10 11:36 AM, Robert Bradshaw wrote:
On Tue, Dec 21, 2010 at 4:16 AM, Volker Braunvbraun.n...@gmail.com
wrote:
No, it's because your loop is over 1 rather than 1000.
Sharp eyes! :)
So
On Sun, Dec 19, 2010 at 9:39 PM, John H Palmieri jhpalmier...@gmail.com wrote:
On Dec 19, 7:01 pm, Alex Raichev tortoise.s...@gmail.com wrote:
Hi all:
I get differently formatted answers using factor() multiple times on
the same polynomial. I wouldn't call it a bug, but it sure is
annoying
The PY_TYPE_CHECK macro exists primarily because Cython didn't used to
optimize isinstance.
On Mon, Dec 20, 2010 at 12:34 PM, Volker Braun vbraun.n...@gmail.com wrote:
PY_TYPE_CHECK is just a wrapper macro around PyObject_TypeCheck which
dereferences and compares the object type fields. So that
On Mon, Dec 20, 2010 at 12:27 PM, Jason Grout
jason-s...@creativetrax.com wrote:
On 12/20/10 1:42 PM, Simon King wrote:
Dear sage-support,
at #10496, David Roe gave me the advice to use PY_TYPE_CHECK rather
than isinstance in Cython files. I did so.
But actually I didn't know PY_TYPE_CHECK
On Fri, Nov 12, 2010 at 3:44 PM, Derrick we.sana...@gmail.com wrote:
Any clue why bool(arcsin(x) == 2*arctan(x/(1+sqrt(1-x^2 returns
false where the expressions are mathematically equivalent.
Because an expression being equal to zero is, in general, and
undecideable question. If it can't
Sounds like you have a tab in there somewhere, it typically shouldn't
be doing this.
On Mon, Nov 8, 2010 at 7:27 AM, JJBWebb johnjackw...@gmail.com wrote:
I'm trying to build a power series, and when I call the function to
build it, sage responds Display all possiblities? (y or n).
I hit
On Fri, Oct 22, 2010 at 9:34 PM, Cary Cherng cche...@gmail.com wrote:
I have a sage script that ultimately creates a python list called MMv
of length 35354. Each element is a list of length 55. This is in
effect a 35354 by 55 matrix. Print statements show that when I run my
script with load
On Sat, Oct 23, 2010 at 8:07 PM, Jason Grout
jason-s...@creativetrax.com wrote:
A correction to my corrections inline below!
On 10/23/10 9:56 PM, Jason Grout wrote:
A few little corrections or explanations inline below...
On 10/23/10 8:34 AM, Francois Maltey wrote:
Rolandb wrote :
On Sat, Oct 9, 2010 at 7:53 AM, Chris Seberino cseber...@gmail.com wrote:
What's easiest way to get Sage running on Windows for non-techie
students?
They'll be lost if the instructions are complicated.
Possible to wrap a VMWare + Ubuntu + Sage blob into one big Windows
exe file that
On Mon, Oct 11, 2010 at 5:30 AM, A. Jorge Garcia calcp...@aol.com wrote:
Depending on how technical you are, the easiest way by far is to set
up a Sage server for them yourself, and then all they need on their
windows boxes is a web browser and a password.
I tried this, and I'm pretty techie,
On Tue, Oct 5, 2010 at 7:57 AM, Francisco Botana fbot...@uvigo.es wrote:
My question was (and is): is it possible to simultaneously send multiple
commands to the simple server? That is, instead of setting, for instance, a
to 2 and b to 3 with two distinct http requests, is it possible to send
On Thu, Sep 30, 2010 at 3:07 AM, Walker ebwal...@gmail.com wrote:
sage: x = this is x
sage: y = this is y
sage: z = this is z
sage: def f():
: print x
: y = new value
: print y
: global z
: z = new value
: print z
:
sage: f()
this
On Wed, Sep 29, 2010 at 8:18 AM, Simon King simon.k...@nuigalway.ie wrote:
Hi Walker!
On 29 Sep., 16:42, Walker ebwal...@gmail.com wrote:
... My question is: is there a way to make Sage not
creating a global variable but assigning directly the global one?
This is actually a Python question.
On Fri, Sep 24, 2010 at 6:56 PM, kcrisman kcris...@gmail.com wrote:
If I make a polynomial ring using
sage: b = PolynomialRing(ZZ, 'x')
I get some odd behavior. Namely,
sage: bool(b(x)==x)
True
sage: b(x)
x
sage: type(b(x))
something about element of the ring
sage: type(x)
symbolic
On Sat, Sep 25, 2010 at 10:51 AM, kcrisman kcris...@gmail.com wrote:
This is the only possibility, because the var('x') command executed
by default at startup did the assignment
x = SR('x')
and you haven't bound x to any other object. Once you execute
x = b.0
[ or one of its implicit
On Thu, Sep 23, 2010 at 6:57 AM, Bruce brucewestb...@gmail.com wrote:
I have a C++ function I want to call from sage. I have attempted to
follow the example in
http://docs.cython.org/src/userguide/wrapping_CPlusPlus.html
This was unsuccessful. The C++ class is not recognised. The problem
http://trac.sagemath.org/sage_trac/ticket/9945 needs review.
On Fri, Sep 17, 2010 at 8:28 PM, Robert Bradshaw
rober...@math.washington.edu wrote:
Oops. I'll post a fix.
On Fri, Sep 17, 2010 at 12:42 PM, kcrisman kcris...@gmail.com wrote:
On Sep 17, 2:30 pm, Alex Lara lrodr...@gmail.com
'sage.rings.fraction_field_FpT.FpTElement'
Sounds like a small API change to me, though probably unintentional.
Looks like ticket #9051, which added this file, was due to Robert
Bradshaw. I'm sure he or someone else will have additional info for
you. I would log this as a new Trac ticket, but I'm
On Wed, Sep 15, 2010 at 3:47 AM, Håkan Granath
hakan.gran...@googlemail.com wrote:
On Sep 15, 3:44 am, Robert Bradshaw rober...@math.washington.edu
wrote:
On Tue, Sep 14, 2010 at 10:44 AM, Håkan Granath
hakan.gran...@googlemail.com wrote:
On Sep 14, 12:16 am, Robert Bradshaw rober
On Tue, Sep 14, 2010 at 10:44 AM, Håkan Granath
hakan.gran...@googlemail.com wrote:
On Sep 14, 12:16 am, Robert Bradshaw rober...@math.washington.edu
wrote:
Alastair correctly deduced the issue that it can't tell if the number
is less than or greater than 2, what should it do here?
I do
On Tue, Sep 14, 2010 at 6:44 PM, Robert Bradshaw
rober...@math.washington.edu wrote:
On Tue, Sep 14, 2010 at 10:44 AM, Håkan Granath
hakan.gran...@googlemail.com wrote:
On Sep 14, 12:16 am, Robert Bradshaw rober...@math.washington.edu
wrote:
Alastair correctly deduced the issue that it can't
On Mon, Sep 13, 2010 at 1:30 PM, Marshall Hampton hampto...@gmail.com wrote:
I am guessing this is an indirect effect from this patch:
http://trac.sagemath.org/sage_trac/ticket/8017
but I am not sure. If you do continued_fraction(N(a)) you get the
same answer as before, but I would say this
On Wed, Sep 8, 2010 at 6:39 PM, KvS keesvansch...@gmail.com wrote:
Thanks all, however I am not very successful so far :(.
I tried both options mentioned before:
- only optimize the loops in Cython and keep using symbolic
expressions/infinite precision, but this is unfortunately rather
On Thu, Sep 9, 2010 at 9:46 AM, Jason Grout jason-s...@creativetrax.com wrote:
On 9/9/10 11:27 AM, Robert Bradshaw wrote:
This should be much faster than symbolic (if I
understand you right, calling find_root and integrate) but have higher
precision than using raw doubles.
I believe
On Thu, Sep 9, 2010 at 11:44 AM, KvS keesvansch...@gmail.com wrote:
On Sep 9, 5:27 pm, Robert Bradshaw rober...@math.washington.edu
wrote:
On Wed, Sep 8, 2010 at 6:39 PM, KvS keesvansch...@gmail.com wrote:
Thanks all, however I am not very successful so far :(.
I tried both options
On Wed, Sep 8, 2010 at 3:03 PM, Greg Marks gtma...@gmail.com wrote:
It sounds like a C program using MPFR (http://www.mpfr.org)
would do what you want. As MPFR is built into SAGE, you might
perhaps find it more convenient to invoke MPFR within SAGE.
This is what I would recommend. You can do
On Sat, Sep 4, 2010 at 8:15 AM, andrew ewart aewartma...@googlemail.com wrote:
How do u stick a matrix on the bottom of antoher martix, in particular
the identity matrix
so if had M (l,k) how do I stick Id(k) on the bottom to produce a new
matrix
N=M and N is dimension (l+k,k)
Id
Look
On Sat, Sep 4, 2010 at 3:25 AM, ma...@mendelu.cz ma...@mendelu.cz wrote:
What about to use polynomial division to get polynomial q=Q/p and then
return P/q ?
I do not remember the command for polynomial division, but should be
in the manual or help.
If Q and p are polynomials, polynomial
On Sat, Sep 4, 2010 at 7:00 PM, Cary Cherng cche...@gmail.com wrote:
Ok i think I've resolved my problems by avoiding var for declaring
variables and instead using
R.g17,g19,g27,g29,g37,g38,g47,g48,g58,g59,g68,g69 =
PolynomialRing(QQ)
Yes, that should be orders of magnitude faster than doing
On Fri, Sep 3, 2010 at 10:47 AM, Simon King simon.k...@nuigalway.ie wrote:
Hi!
I have a list of computations (in fact, a test suite), and I'd like to
do them in parallel. Of course, I could use @parallel, but:
1) each computation uses 3 processes (Sage, GAP, Singular)
2) it is probably not
On Tue, Aug 24, 2010 at 1:27 PM, William Stein wst...@gmail.com wrote:
Did you do this once for something...
Yes, see http://trac.sagemath.org/sage_trac/ticket/9180
-- Forwarded message --
From: Mike Hansen mhan...@gmail.com
Date: Tue, Aug 24, 2010 at 12:21 PM
Subject: Re:
On Mon, Aug 23, 2010 at 6:54 AM, Simon King simon.k...@nuigalway.ie wrote:
Hi Robin,
On 23 Aug., 13:43, robin hankin hankin.ro...@gmail.com wrote:
Re automatic_names(): why isn't this the default?
Now I know it exists, I think I'll probably use it all the time.
Who uses sage without this
On Mon, Aug 23, 2010 at 9:08 AM, Robert Bradshaw
rober...@math.washington.edu wrote:
On Mon, Aug 23, 2010 at 6:54 AM, Simon King simon.k...@nuigalway.ie wrote:
Hi Robin,
On 23 Aug., 13:43, robin hankin hankin.ro...@gmail.com wrote:
Re automatic_names(): why isn't this the default?
Now I
On Mon, Aug 9, 2010 at 9:40 PM, Nathann Cohen nathann.co...@gmail.com wrote:
This can of course be written (not g.is_forest() and g.has_even_cycle())
Ok, ok, I know... Let's make it g.is_forest() or g.has_even_cycle()
Yes, one could create an infix operator, but I think the above is much
more
On Mon, Aug 9, 2010 at 1:59 AM, Rajeev rajs2...@gmail.com wrote:
Hi,
I was trying to work out the first example given in
http://wiki.cython.org/WrappingNumpy
in sage notebook, but got an error saying
arrayobject.h not found. How do I get this example working?
I've fixed that page so it
On Sat, Jul 31, 2010 at 1:21 AM, Simon King simon.k...@nuigalway.ie wrote:
Hi Jeroen!
On 31 Jul., 02:30, Robert Bradshaw rober...@math.washington.edu
wrote:
...
In file A.pyx, I have
cdef MyClass myobj
cdef class MyClass:
[...]
In file A.pxd, I have
cdef class MyClass
On Fri, Jul 30, 2010 at 2:39 PM, Jeroen Demeyer jdeme...@cage.ugent.be wrote:
Hello sage-support,
I have been breaking my head all evening around the file organisation
and import model with Cython. If there is any tutorial explaining
this, I will gladly read it.
Anyway, here is a concrete
On Tue, Jul 27, 2010 at 12:50 AM, Simon King simon.k...@nuigalway.ie wrote:
Hi Drenwal,
On 25 Jul., 10:52, drenwal dren...@free.fr wrote:
But, I would prefer to use a more mathematical notation, like Y[k] or
y...@k or whatever non already used symbol instead of Ac(y,k).
As Johannes has
On Tue, Jul 27, 2010 at 9:24 AM, Simon King simon.k...@nuigalway.ie wrote:
Hi!
I have a Cython class COCH that inherits from RingElement. I define a
method __pow__ for it, and it gets some doc string (which means
tests).
I thought that such method would be a class_method or whatever.
On Tue, Jul 27, 2010 at 1:25 PM, Simon King simon.k...@nuigalway.ie wrote:
On 27 Jul., 21:30, Simon King simon.k...@nuigalway.ie wrote:
Is there no workaround? Say, defining the method (or slot method
wrapper envelop whatever) and explicitly assign an attribute __doc__
to it?
For the record:
On Tue, Jul 27, 2010 at 1:58 PM, Luis Finotti luis.fino...@gmail.com wrote:
Hi,
I have an algorithm that has pieces that perform computations on Z/
p^i*Z for different values of i. I can count the operations for each
piece, but to have an overall complexity, I need to know how the
On Mon, Jul 5, 2010 at 4:39 AM, Dr. David Kirkby
david.kir...@onetel.net wrote:
On 07/ 5/10 06:18 AM, William Stein wrote:
Great idea - you could add an algorithm=axiom option to sage's
integrate command.
Personally, and I am going to dare risk argue with a mathematician, I would
not have
On Sun, Jul 4, 2010 at 9:47 AM, Greg Kuperberg greg.kuperb...@gmail.com wrote:
On Jul 3, 8:33 am, William Stein wst...@gmail.com wrote:
Sage can't switch to Python 3 until every single Python package in
Sage is ported to Python 3.
This is far from done. It's possible that for some packages,
This is a known bug. http://trac.sagemath.org/sage_trac/ticket/9314
On Jun 26, 2010, at 10:29 AM, Mike Witt wrote:
More info:
--
| Sage Version 4.3.1, Release Date: 2010-01-20 |
| Type notebook() for the
On Jun 26, 2010, at 7:24 PM, S. Robert James wrote:
I didn't receive a response on this. If the question isn't clear,
please let me know what needs to be clarified.
I'm sure my request isn't unique: one of the major goals of Sage is to
provide a platform that allows people to _verify_ it,
On Jun 21, 2010, at 10:53 PM, Matthias Meulien wrote:
I guess that the problem comes from the type of p1, not
being an Expression. So is it possible to cast this p1 to the
Expression class?
A direct conversion like the following works:
sage: p3 = 0
sage: for c in p1.coeffs():
: p3 =
On Jun 23, 2010, at 9:04 AM, William Stein wrote:
On Wed, Jun 23, 2010 at 8:43 AM, Harald Schilly
harald.schi...@gmail.com wrote:
On Jun 23, 3:57 pm, kcrisman kcris...@gmail.com wrote:
maybe because frames
didn't work well or we wanted to avoid them...?
I don't know the conversation but no
On Jun 22, 2010, at 1:02 PM, Nils Bruin wrote:
On Jun 22, 11:13 am, cjung cjun...@gmx.de wrote:
My question is now, if this is a bug or just a mistake in my code?
I suspect that you create your roots of unity using exponents that
are floats.
If m and n are integers, m/n shouldn't be a
On Jun 22, 2:13 pm, cjung cjun...@gmx.de wrote:
Dear all,
Here's my problem: I've written a function (the scource code below),
which should compute the scalarproduct of two classfunction of a group
G. But there is a little problem with that, the values of the
classfunction are just given as a
On Jun 18, 2010, at 1:58 PM, arthur wrote:
On Jun 18, 3:25 pm, kcrisman kcris...@gmail.com wrote:
But sounds like, as with a big buffet, too much of a good thing is
just too much.
It's worth pointing out, though, that most of the optional packages
are databases, packages for some very
On Jun 20, 2010, at 7:21 AM, Thierry Dumont wrote:
Le 20/06/2010 16:14, Patrick ABOU BAKAR a écrit :
I know that SAGE contains its own installation of pretty much of all
the modules it depends on..
My assumption is that there is a table that holds the username and
password of the users as
On Jun 20, 2010, at 7:50 AM, Rolandb wrote:
Hi,
I found a more simplified example:
print get_memory_usage()
for i in xrange(1): A(1,8,9)
print get_memory_usage()
Why is type(A)
'sage
.rings.polynomial.multi_polynomial_libsingular.MPolynomial_libsingu
\lar' using memory?
No idea, maybe
On Jun 12, 2010, at 17:27 , Byungchul Cha wrote:
Please tell me if this is a bug, or, I'm missing something obvious...
sage: a = 3 # Assign a value to a variable a
sage: b = a # Create a copy of a
You're not really copying a, you're just making 'b' refer to the same
thing that 'a' does,
On Jun 11, 2010, at 11:23 PM, Rolandb wrote:
Hi,
I have a small (nonsense) example of a program I would like to be able
to convert to cython. But I don't know how to convert:
R.A,B,C=QQ[], .factor(), .unit() and
.factor(proof=False,limit=10^5). I could not find anything in the
documentation
On Jun 10, 2010, at 12:22 PM, Christian Stump wrote:
m=[0.6158, 0.5893, 0.5682, 0.51510, 0.4980, 0.4750, 0.5791,
0.5570,0.5461, 0.4970, 0.4920, 0.4358, 0.422, 0.420]
m.count
len(m) does the job, you should probably look into the tutorial at
http://www.sagemath.org/doc/tutorial/ for this kind
On Jun 11, 2010, at 2:51 PM, orca wrote:
Hi there,
I am a newbie to Sage, though I have some experience with Linux and
Python in general.
I have tried to build the latest 4.4.3 version of Sage from source,
but, after having checked that I apparently have all necessary program
dependencies
On Jun 11, 2010, at 4:48 PM, Dr. David Kirkby wrote:
On 06/11/10 10:51 PM, orca wrote:
Hi there,
I am a newbie to Sage, though I have some experience with Linux and
Python in general.
I have tried to build the latest 4.4.3 version of Sage from source,
but, after having checked that I
On Jun 7, 2010, at 7:46 AM, Mike Witt wrote:
On 06/06/2010 10:43:38 PM, Rob Beezer wrote:
On Jun 6, 9:05 am, Mike Witt msg...@gmail.com wrote:
This does kind of reinforce the concept, which I guess I've
heard expressed before here, that you have to be prepared
to update your sage build very
On Jun 7, 2010, at 8:04 AM, Rolandb wrote:
Hi,
Using cython, I want to make optimal use of static data. The reason is
that lookup is (often) much faster than recalulating. I now use:
cdef list nice_list_name=[3 , 3 , 3 , 3 , 3 , 3 , 4 , 4 , 4 , 4 , 4 ,
4 , 4 , 4 , 4 , 5 , 5 , 5 , et cetera]
On Jun 3, 2010, at 9:46 AM, William Stein wrote:
On Thu, Jun 3, 2010 at 9:44 AM, Bruce brucewestb...@googlemail.com
wrote:
I am just starting with sage. I type a url into firefox to start the
notebook on a local machine.
I typed: install_package('lie-2.2.2.p3')
and got along error message.
On Jun 1, 2010, at 8:13 AM, Anne Driver wrote:
Hello,
I am new to this list, and relatively new to Sage. I'm puzzled by
the logic of one part of Sage though.
Although I don't have access to Mathematica at the minute on this
computer, I know if I compute the first zero, I get something
On Jun 1, 2010, at 11:05 AM, William Stein wrote:
On Tue, Jun 1, 2010 at 10:58 AM, Robert Bradshaw
rober...@math.washington.edu wrote:
On Jun 1, 2010, at 8:13 AM, Anne Driver wrote:
Hello,
I am new to this list, and relatively new to Sage. I'm puzzled by
the
logic of one part of Sage
, 20:41, Robert Bradshaw rober...@math.washington.edu
wrote:
On May 27, 2010, at 11:31 AM, Rolandb wrote:
Hi,
I'm running a routine which uses a large data set (13 million
elements). After a while the output is:
MemoryError
no mem for new parser
What to do? Thanks in advance for the swift
On May 28, 2010, at 6:13 AM, Nicolas wrote:
Hi all,
I am trying to get, from within the notebook, a PDF from the show
method acting on an expression, just like sage does when used on the
command line. It works very nicely for graphics objects but I have not
figured out either how to get a
On May 27, 2010, at 9:07 AM, rickhg12hs wrote:
I noticed that doing sqrt() for large integers seems to continually
chew up memory.
For example:
sage: m = get_memory_usage()
sage: while True:
a = ZZ(randint(2^400,2^800)).sqrt()
print get_memory_usage(m)
This prints ever increasing
On May 27, 2010, at 11:31 AM, Rolandb wrote:
Hi,
I'm running a routine which uses a large data set (13 million
elements). After a while the output is:
MemoryError
no mem for new parser
What to do? Thanks in advance for the swift reply!
Roland
What are you doing with this data? Do you have
On May 27, 2010, at 3:22 PM, Alex Goater wrote:
Hello,
I'm trying to use sage version 4.4.2 within Linux Mint 7 Gloria.
I've downloaded the sage-4.4.2-linux-32bit-ubuntu_10.04_lts-i686-
Linux.tar.gz from the webiste, unpacked it and tried to run sage and
this came up:
On May 26, 2010, at 3:06 PM, William Stein wrote:
On Wednesday, May 26, 2010, Micha Hofri ho...@wpi.edu wrote:
Dear Mr. Stein:
I heard about Sage when looking for an alternative to Maple. I
find it is a good idea to know Python. I take a text, and it tells
me it is mostly about python
On May 22, 2010, at 8:05 AM, Mike Witt wrote:
I just thought I'd try this question one more time:
On May 20, 10:59 am, Mike Witt wrote:
Is there any way to make the square root of -1 display lower case
i rather than I (at least for latex output)?
Sage complex numbers already print out that
On May 22, 2010, at 8:28 AM, Robert Bradshaw wrote:
On May 22, 2010, at 8:05 AM, Mike Witt wrote:
I just thought I'd try this question one more time:
On May 20, 10:59 am, Mike Witt wrote:
Is there any way to make the square root of -1 display lower case
i rather than I (at least for latex
On May 21, 2010, at 11:35 PM, Simon King wrote:
On 22 Mai, 00:12, Robert Bradshaw rober...@math.washington.edu
wrote:
Try working a multivariate ring rather than a tower of univariate
rings, e.g. ...
... which suggests the question why Sage does not automatically
transform a tower
On May 22, 2010, at 8:49 AM, Burcin Erocal wrote:
Hi Mike,
On May 20, 10:59 am, Mike Witt wrote:
Is there any way to make the square root of -1 display lower case
i rather than I (at least for latex output)?
Not in a user friendly way. The complex I is just a number field
element and
On May 21, 2010, at 2:53 PM, Alex P wrote:
Hi all,
I tried the following code in SAGE and it seems that it is taking way
too long
--
| Sage Version 4.3.4, Release Date: 2010-03-19 |
| Type notebook() for
On May 20, 2010, at 3:15 PM, VictorMiller wrote:
Does the Matrix class have methods for vertical and horizontal joins
of matrices (as in Magma)? That is
if A is an m by n matrix and B is an r by n matrix then
VerticalJoin(A,B) would by the (m+r) by n matrix with A on top and B
on the bottom.
On May 15, 2010, at 5:31 PM, kcrisman wrote:
Thanks for your email. Unfortunately, Piecewise functions were
implemented very early in the history of Sage, and so do not support
tons of newer Sage functionality. Although there are a number of us
interested in improving this situation, thus
On May 14, 2010, at 9:32 AM, David Grudoski wrote:
Can anyone tell me how to use os.chdir to go to my C: drive when
running sage in virtual box? I can't get out of the '/home/'
directory.
executing the following in sage notebook
import os
os.chdir('C:')
gives an error No such file or
Try doing
x in RR
- Robert
On May 7, 2010, at 2:38 PM, Nathann Cohen wrote:
Hello everybody !!!
I am trying to find out how to check whether some Sage variable is
numerical (let's say real, as opposed to None, False, {}, Set([]),
etc..), but was not lucky on Google... ^^;
Do you know the
On Apr 30, 2010, at 9:34 AM, Thierry Dumont wrote:
I have questions about RDF (and CDF) sparse matrices. How are they
implemented?
-for dense matrices, sage uses Scipy matrices and this is transparent.
-but, how are sparse matrices (RDF,CDF) implemented?
1) Are they Scipy matrices ?
On Apr 23, 2010, at 1:37 AM, bb wrote:
Mike Hansen schrieb:
On Mon, Apr 19, 2010 at 11:52 AM, bb bblo...@arcor.de wrote:
I get a runtime error, but just would expect infinity! Is there
something
wrong or any explanation?
This is because when you do 2^3^4^5 you are computing that number
On Apr 21, 2010, at 4:52 PM, Michael Rybalkin wrote:
I have installed local Sage server.
I need some kind of workspace with multiple worksheets and common data
storage while working via web interface. What can you recommend in
this case?
There aren't currently any good solutions to this
On Apr 24, 2010, at 11:32 PM, Alex P wrote:
Actually it does not seem to work, I get
--
| Sage Version 4.3.4, Release Date: 2010-03-19 |
| Type notebook() for the GUI, and license() for information.
On Apr 24, 2010, at 5:36 PM, Michael Rybalkin wrote:
How to get monomial with large exponent in the polynomial rings?
For example I hsave polynomial ring over large finite field:
p = next_prime(10^20)
R.x = PolynomialRing(GF(p), sparse=True)
Monomial x^(10^7) construction takes 2 seconds:
On Apr 19, 2010, at 4:05 PM, wb wrote:
On Apr 20, 12:25 am, Robert Bradshaw rober...@math.washington.edu
wrote:
On Apr 19, 2010, at 2:50 PM, wb wrote:
coming from C I'm confused about this behavior in assignment:
Since you know C, it may make sense to think of lists as being
similar
On Apr 19, 2010, at 2:50 PM, wb wrote:
coming from C I'm confused about this behavior in assignment:
Since you know C, it may make sense to think of lists as being similar
to pointers.
1) using only integers --
sage: a=2
sage: b=2
sage: b=b+a
sage: b
4
On Apr 13, 2010, at 11:20 PM, Adam Getchell wrote:
Hi all,
I realize this maybe a bit of an insane question, but I'm looking
for a way to use ecl within sage besides:
./sage -ecl
I have googled for relevant results, but documentation on
sage.interfaces.lisp seems broken right now:
On Apr 9, 2010, at 10:53 AM, Leo Maloney wrote:
I'm trying to compute the inverse of a 5000 x 5000 sparse matrix.
What is the basering?
I'm getting an EOF error after it runs for about 5 hours, and then it
states that sage is trying to access unallocated memory. Is there a
way I can
On Apr 6, 2010, at 11:22 PM, Rolandb wrote:
Hi, some experiences.
I moved from Vista 32 to Windows 7 64 during Easter. I have a Q6700
PC.
Three issues are maybe of general interest.
1) Virtualbox 4.3.4: A clumsy environment so I switched back to (the
new) VMware player 3.01 and (the old)
On Apr 7, 2010, at 2:10 AM, Uri wrote:
I'm having some problems trying to use a program called Brian
Simulator (www.briansimulator.org) through Sage. This program is
written in Python an can be used as a python package (I've tried it
and I had no problem). However, when I try to use it in Sage
On Apr 7, 2010, at 9:29 AM, Kenneth A. Ribet wrote:
Hello All,
I asked myself how I could use sage to compute the standard
deviation of a grade distribution for one of my courses. Rooting
around, I found that I can compute for example
sage: vector(RDF,[1,2,2,1]).standard_deviation()
On Apr 5, 2010, at 9:44 PM, William Stein wrote:
On Mon, Apr 5, 2010 at 9:12 PM, Michael Welsh
yom...@yomcat.geek.nz wrote:
On 6/04/2010, at 3:56 PM, Eugene Goldberg wrote:
Hello!
Here is my pyhtons results:
python
Python 2.6.5 (r265:79063, Mar 23 2010, 04:49:54)
[GCC 4.4.3] on linux2
On Apr 6, 2010, at 12:17 AM, Paul Zimmermann wrote:
If one wants to have the same answer as Python does (always
nonnegative),
then function math.fmod can be used. For example,
sage: from math import fmod
sage: fmod(6e-6,10e-6)
6.0002e-06
first Python does not always give a
On Apr 2, 2010, at 9:41 PM, G B wrote:
Thanks for the detailed response, Simon. Please understand that I'm
not being critical of Sage-- quite the contrary, I'm excited about
what it might offer me once I master it.
I think you touch on one key to the problem-- I'm not a
mathematician,
On Apr 1, 2010, at 6:04 PM, TianWei wrote:
The sh option in the sage notebook allows anyone to access the
command-line shell on the sage server. This grants users access to any
directory on the server, including configuration settings, etc. Even
on the Try Sage Online link on the main page
On Apr 1, 2010, at 9:11 PM, TianWei wrote:
I for one would find hiding input cells useful because when I use sage
for my math homework, I like the pretty printing feature of the text
cells (using $...$), and often times I will use the output of the
calculation cells (e.g. graphs) to accompany
On Apr 1, 2010, at 9:21 PM, scott.h wrote:
That did exactly what I wanted to do! Thank you very much for taking
the time to reply. The command C = [var(C_%s % i) for i in
range(n)] in particular is what I was looking for. I think I can
glean how %s works from how you've used it and will
101 - 200 of 724 matches
Mail list logo
