Hi folks,
I'm trying to build sage-3.2.3 under SLES 10 with the following system
information:
$ uname -a:
Linux burnet-usr 2.6.16.27-0.9-bigsmp #1 SMP Tue Feb 13 09:35:18 UTC
2007 i686 i686 i386 GNU/Linux
The GCC version is 4.1.0. But when it comes to building the numpy
version that's packaged
calcp...@aol.com wrote:
> In a message dated 1/21/2009 6:44:38 P.M. Eastern Standard Time,
> jason-s...@creativetrax.com writes:
>
> diff(y,t,t) is just a shortcut for diff(diff(y,t),t). If you do diff?,
> you can see some of the different syntax possibilities.
>
> I get that, my point
On Jan 21, 5:06 pm, William Stein wrote:
> On Wed, Jan 21, 2009 at 1:39 PM, Brett Nakashima wrote:
>
> > On Jan 21, 12:50 pm, William Stein wrote:
> >> On Wed, Jan 21, 2009 at 12:36 PM, Brett Nakashima
> >> wrote:
>
> >> > Is it possible to install the X11 dev headers and recompile R?
>
> >
In a message dated 1/21/2009 6:44:38 P.M. Eastern Standard Time,
jason-s...@creativetrax.com writes:
diff(y,t,t) is just a shortcut for diff(diff(y,t),t). If you do diff?,
you can see some of the different syntax possibilities.
I get that, my point is that it would be more natural to
On Wed, Jan 21, 2009 at 1:39 PM, Brett Nakashima wrote:
>
>
>
> On Jan 21, 12:50 pm, William Stein wrote:
>> On Wed, Jan 21, 2009 at 12:36 PM, Brett Nakashima wrote:
>>
>> > Is it possible to install the X11 dev headers and recompile R?
>>
>> OK, I just did this. Can you test that it worked?
>
Robert Bradshaw wrote:
> On Dec 29, 2008, at 4:47 PM, William Stein wrote:
>
>> On Mon, Dec 29, 2008 at 4:34 PM, Robert Bradshaw
>> wrote:
>>> +1 to (deprecating then removing) removing X.list(), and replacing it
>>> with X.entries().
>> Very good point. We *must* remember to make X.list() use
On Wed, Jan 21, 2009 at 1:25 PM, Paul Zimmermann
wrote:
>
> Hi,
>
> on http://www.loria.fr/~zimmerma/exemple40.sage you can find a 500x360
> integer matrix for which computing the Hermite Normal Form takes about
> 10 times longer in Sage than in Magma:
>
> sage: C
> 500 x 360 dense matrix o
Hi all:
I have a geometry question. Given an ALGEBRAIC variety V in CC^n
defined by a single polynomial and given a point p in V, how do you
compute the number of (distinct) irreducible ANALYTIC components of V
passing through p?
For example, let f = y^2 -x^2*(1 +x). Then the variety V(f) has
calcp...@aol.com wrote:
> In a message dated 1/20/2009 9:37:38 P.M. Eastern Standard Time,
> wdjoy...@gmail.com writes:
>
> (The notation diff(y,t,t) comes from the notation for partial
> derivatives,
> I think.)
diff(y,t,t) is just a shortcut for diff(diff(y,t),t). If you do diff?
In a message dated 1/20/2009 9:37:38 P.M. Eastern Standard Time,
wdjoy...@gmail.com writes:
(The notation diff(y,t,t) comes from the notation for partial derivatives,
I think.)
That's odd since the given DiffEqu to solve was and ODE, not a PDE, right?
TIA,
A. Jorge Garcia
calcp...@a
On Jan 21, 12:27 pm, David Joyner wrote:
> If you are willing to work in maxima, I think the thing to do is to first
> load the topoly module but I can't get it to work for me as described
> here:http://www.math.utexas.edu/pipermail/maxima/2006/002666.html
> Maybe you will have better luck.
It
On Jan 21, 12:50 pm, William Stein wrote:
> On Wed, Jan 21, 2009 at 12:36 PM, Brett Nakashima wrote:
>
> > Is it possible to install the X11 dev headers and recompile R?
>
> OK, I just did this. Can you test that it worked?
It doesn't seem to. I'm still getting an X11 error
"""
rpy.RPy_REx
Hi Paul,
Are you using the most recent version of Sage? There was a performance
regression I accidentally introduced at some point to fix a bug, which
was corrected in Sage 3.2.2.
If that's not it, hopefully William will pipe in ...
-cc
On Wed, Jan 21, 2009 at 1:25 PM, Paul Zimmermann
wrote:
Hi,
on http://www.loria.fr/~zimmerma/exemple40.sage you can find a 500x360
integer matrix for which computing the Hermite Normal Form takes about
10 times longer in Sage than in Magma:
sage: C
500 x 360 dense matrix over Integer Ring
sage: time A=C.hermite_form()
CPU times: user 22.91 s,
On Wed, Jan 21, 2009 at 12:36 PM, Brett Nakashima wrote:
>
> Is it possible to install the X11 dev headers and recompile R?
>
OK, I just did this. Can you test that it worked?
-- William
--~--~-~--~~~---~--~~
To post to this group, send email to sage-support@g
Is it possible to install the X11 dev headers and recompile R or
install GDD in R for sagenb?
Thanks,
Brett
--~--~-~--~~~---~--~~
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
sage-support-unsubscr
If you are willing to work in maxima, I think the thing to do is to first
load the topoly module but I can't get it to work for me as described here:
http://www.math.utexas.edu/pipermail/maxima/2006/002666.html
Maybe you will have better luck.
On Wed, Jan 21, 2009 at 1:14 AM, Skylar wrote:
>
>
x=2 is not a solution of your original system. When you solved by
hand, presumably you squared things to eliminate the square root, but
that introduced the spurious solution x=2.
The solve command uses maxima currently, and I don't know exactly how
it does things. Perhaps someone else can comme
Hi,
does anybody have a suggestion on how one goes about doing a primary
decomposition of an ideal over C (or Qbar)? As a concrete example, the
ideal generated by
p_1 q_1 - q_4 p_4 = 0,
p_2 q_2 - q_1 p_1 = 0,
p_3 q_3 - q_2 p_2 = 0.
is prime over Q[p_i,q_i]. How can I prove if it is (or is not) p
On Wed, Jan 21, 2009 at 1:41 AM, Harald Schilly
wrote:
>
> I don't know what's the fastes way or if i'm using ntl, but here is
> what i did:
> http://sagenb.org:8000/home/pub/167/
Those polynomials have degree 300 and 310. The original poster
wants to work with polynomials of degree 2^300 and 2
I don't know what's the fastes way or if i'm using ntl, but here is
what i did:
http://sagenb.org:8000/home/pub/167/
h
On Jan 21, 6:59 am, "sea2...@gmail.com" wrote:
> Hi,
> I want compute gcd(f,g), where f and g are polynomials and their
> degree are huge, e.g. deg(f) is about 2^300.
>I
On Tue, Jan 20, 2009 at 9:59 PM, sea2...@gmail.com wrote:
>
> Hi,
> I want compute gcd(f,g), where f and g are polynomials and their
> degree are huge, e.g. deg(f) is about 2^300.
> I looked through the Sage reference manual, and learned that NTL
> is a library of fast arithmetic with polyno
Hi,
I want compute gcd(f,g), where f and g are polynomials and their
degree are huge, e.g. deg(f) is about 2^300.
I looked through the Sage reference manual, and learned that NTL
is a library of fast arithmetic with polynomials. But is seems that
the degree of my polynomial is too large, ca
23 matches
Mail list logo
