Thank you very much.
I moved to 10.5 and it worked very well.
Now, I follow the tutorial!
Best regards,
Le 6 oct. 08, à 18:33, William Stein a écrit :
On Mon, Oct 6, 2008 at 7:15 AM, Guilhem_Bourrie [EMAIL PROTECTED]
wrote:
hello,
I am a new member of this group,
I downloaded the source
William Stein a écrit :
If your hardware is pretty good (which the OP's hardware is), the
problem is definitely the webserver and notebook interface.
Running many sage sessions at once gets around this.
ok, if I understand correctly, running many servers (listening on
different ports)
Alex Clemesha wrote:
We have spend a majority of our effort on Knoboo trying to make
it a robust and scalable web application (like, for example, the
'frontend' is totally decoupled from the backend 'kernel').
What's missing from Knoboo, and what is so great about the Sage Notebook,
is
On Oct 7, 8:45 am, Mike Hansen [EMAIL PROTECTED] wrote:
Hello,
On Mon, Oct 6, 2008 at 6:50 PM, SK [EMAIL PROTECTED] wrote:
Now, I try and compute X * (X^(-1)). Instead of getting an identity
matrix, I get a complicated matrix in x, y and z. Thinking that the
^ may be the issue, I tried
This does not format things like a_2 very well. What about this one?
def ashow(v):
show(sage.calculus.calculus.var(v)==eval(v))
Show seems to format the equations nicely without explicitly using
latex.
If latex is desired explicitly, the following works, too:
def ashow(v):
On Tue, Oct 7, 2008 at 7:10 AM, Jason Grout [EMAIL PROTECTED] wrote:
Alex Clemesha wrote:
We have spend a majority of our effort on Knoboo trying to make
it a robust and scalable web application (like, for example, the
'frontend' is totally decoupled from the backend 'kernel').
What's
On Tue, Oct 7, 2008 at 2:50 AM, Stan Schymanski [EMAIL PROTECTED] wrote:
This does not format things like a_2 very well. What about this one?
def ashow(v):
show(sage.calculus.calculus.var(v)==eval(v))
Show seems to format the equations nicely without explicitly using
latex.
If latex
Hi all,
I'm using a Fedora Core2 based system, which I can't upgrade.
Compilation fails for the latest Sage (3.1.2). I'm not sure how to fix
this error. Any help is appreciated. I'm pasting the relevant lines
below.
Thanks,
Venkat.
Making all in cxx
make[4]: Entering directory
William Stein wrote:
On Mon, Sep 22, 2008 at 11:05 AM, D. Monarres [EMAIL PROTECTED] wrote:
I want to produce a worksheet tutorial for SAGE usage on our campus
and was wondering how I could add static text around the notebook
cells like is done in the live tutorial . Do I just edit as plain
On Oct 7, 2008, at 3:58 AM, Thierry Dumont wrote:
William Stein a écrit :
If your hardware is pretty good (which the OP's hardware is), the
problem is definitely the webserver and notebook interface.
Running many sage sessions at once gets around this.
ok, if I understand correctly,
On Oct 7, 10:01 am, Venkat [EMAIL PROTECTED] wrote:
Hi all,
Hi,
I'm using a Fedora Core2 based system, which I can't upgrade.
Compilation fails for the latest Sage (3.1.2). I'm not sure how to fix
this error. Any help is appreciated. I'm pasting the relevant lines
below.
It looks like
Just found an example
html(h1Double Precision Root Finding Using Bisection/h1)
here:
http://wiki.sagemath.org/interact/calculus
Sorry to trouble about it.
There is also another question:
can I group the cells like in Mathematica ? Hide them, expand them ?
thanks
Serge
Serge Salamanka пишет:
So am i wrong? or it is a bug
--~--~-~--~~~---~--~~
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at
On Oct 7, 2008, at 10:59 AM, Bob Wonderly wrote:
You support people fixed my long arithmetic problem. The patch applied
and worked!
Great.
Now here is another puzzlement:
alist =
[divmod(0,6),divmod(1,6),divmod(2,6),divmod(3,6),divmod(4,6),divmod
(5,6)]
#of course that's one line
Hi,
a question of a colleague from my lab:
can Sage solve linear systems A*x=b, where A is a matrix with positive
integer coefficients, b is a vector with positive integer coefficients,
and the unknown vector x is searched over the positive integers?
I guess this is more or less
Dear Sage developers,
In the Firefox interface to SAGE, the command
show(integrate(x))
results in
2
x
2
rather than
2
x
2
in fact , a number of quotients and fractions are displayed
incorrectly.
I am using SAGE 3.1.2 VMWare appliance on Windows XP.
Regards,
Hazem
Actually, I just noticed that jsMath gave me an error (jsMath failed
to set up properly, error code -7).
Could this be related? is this common? why does it happen and how do I
fix it?
thanks,
Hazem
On Oct 7, 2:57 pm, Hazem [EMAIL PROTECTED] wrote:
Dear Sage developers,
In the Firefox
I believe that the answer is currently: no, Sage cannot do integer
linear programming. But I could be wrong, if that capability is
hiding in something added since the last time this question came up.
I am not sure what open source code is out there to do that - ?
M. Hampton
On Oct 7, 12:38 pm,
Thanks for the response. I'll try to use Sage on a more recent system.
Thanks,
Venkat.
On Oct 7, 1:21 pm, mabshoff [EMAIL PROTECTED]
dortmund.de wrote:
On Oct 7, 10:01 am, Venkat [EMAIL PROTECTED] wrote:
Hi all,
Hi,
I'm using a Fedora Core2 based system, which I can't upgrade.
On Oct 7, 8:38 pm, Paul Zimmermann [EMAIL PROTECTED] wrote:
a question of a colleague from my lab:
... integer linear programming (ILP)
I'm not sure either, but he could try his luck with openopt:
http://scipy.org/scipy/scikits/wiki/MILP interfacing with lpsolve or
glpk.
h
Serge Salamanka wrote:
Just found an example
html(h1Double Precision Root Finding Using Bisection/h1)
here:
http://wiki.sagemath.org/interact/calculus
Sorry to trouble about it.
There is also another question:
can I group the cells like in Mathematica ? Hide them, expand them ?
You
Hazem wrote:
Actually, I just noticed that jsMath gave me an error (jsMath failed
to set up properly, error code -7).
Could this be related? is this common? why does it happen and how do I
fix it?
This might be a fonts issue. When you click on the jsMath button in
the bottom right, does
William Stein wrote:
On Mon, Oct 6, 2008 at 10:11 AM, kcrisman [EMAIL PROTECTED] wrote:
To emphasize again, I doubt it scales to more than 30 users all hammering
the server at once.
I can confirm this from our experience as well; on a more moderate
size server even 15-20 at once becomes
Hello,
On Tue, Oct 7, 2008 at 1:15 PM, Jason Grout [EMAIL PROTECTED] wrote:
To sum up the discussion about what makes things slow, is it a
file-locking bottleneck with the sage server?
I don't think anyone has done any serious profiling of the notebook so
I think that conclusion is quite a
On Tuesday 07 October 2008, Paul Zimmermann wrote:
Hi,
a question of a colleague from my lab:
can Sage solve linear systems A*x=b, where A is a matrix with positive
integer coefficients, b is a vector with positive integer coefficients,
and the unknown vector x is searched over the
On Oct 7, 1:27 pm, Mike Hansen [EMAIL PROTECTED] wrote:
Hello,
On Tue, Oct 7, 2008 at 1:15 PM, Jason Grout [EMAIL PROTECTED] wrote:
To sum up the discussion about what makes things slow, is it a
file-locking bottleneck with the sage server?
I don't think anyone has done any serious
I have created a spkg to install lp_solve into Sage; it can be obtained at:
http://www.math.unl.edu/~shartke2/files/lp_solve-5.5.0.13.spkg
I have posted to sage-devel suggesting this spkg for inclusion into Sage.
lp_solve includes a linear programming solver (simplex based) and an integer
On Oct 7, 2008, at 13:27 , Mike Hansen wrote:
Hello,
On Tue, Oct 7, 2008 at 1:15 PM, Jason Grout [EMAIL PROTECTED]
wrote:
To sum up the discussion about what makes things slow, is it a
file-locking bottleneck with the sage server?
I don't think anyone has done any serious profiling
Thank you Mike and John. It seemed unlikely to me that there was a bug
anyway, but I had to ask. I used the 'simplify_rational' and it worked
perfectly. Also, I noticed that Mike used 'apply_map'. That and lambda
make it look rather close to Lisp; it looks like the more I look at
sagemath, the
A slight variation on John's answer: you could also do:
sage: R.x,y,z=QQ[]
sage: X = matrix( [ [x, y, z], [y, z, x], [z, x, y] ])
sage: Y = X*X^-1
sage: Y = matrix(R,Y)
sage: Y
[1 0 0]
[0 1 0]
[0 0 1]
M. Hampton
On Oct 7, 8:16 pm, SK [EMAIL PROTECTED] wrote:
Thank you Mike and John. It
Martin - is that already accessible in sage or would some sort of
wrapper have to be written?
Is this what you are looking for:
http://www.singular.uni-kl.de/Manual/3-0-4/sing_610.htm
?
Cheers,
Martin
--
name: Martin Albrecht
On Tue, Oct 7, 2008 at 1:27 PM, Mike Hansen [EMAIL PROTECTED] wrote:
Hello,
On Tue, Oct 7, 2008 at 1:15 PM, Jason Grout [EMAIL PROTECTED] wrote:
To sum up the discussion about what makes things slow, is it a
file-locking bottleneck with the sage server?
I don't think anyone has done any
32 matches
Mail list logo
