On Feb 22, 4:08 pm, Vincent Delecroix <20100.delecr...@gmail.com>
wrote:
> Hi,
hi Vincent,
> Even with gcc-3.4.6 the compilation fails exactly at the same point
> (with exactly the same errors). I will ask help tomorrow from the
> network engineer.
Ok, it appears to me that the overly aggress
On Feb 22, 11:16 pm, Jan Groenewald wrote:
> Hi
Hi Jan,
> On Sat, Feb 21, 2009 at 10:39:52PM -0800, mabshoff wrote:
> > the final 3.3 sources are out and now available at
> > http://www.sagemath.org/src/
>
> On a P4 with Ubuntu 8.04.2 with gcc 4.2.3-1ubuntu6 and
> texlive-common 2007-13. I
Actually, from my perspective overloading malloc is a constant source
of pain.
This makes developers fighting malloc implementation, instead of
writing algorithms.
I would prefer Singular not doing so and I hope, that Sage doesn't
follow our bad example.
I think, the problem omalloc solves would
Hi
On Sat, Feb 21, 2009 at 10:39:52PM -0800, mabshoff wrote:
> the final 3.3 sources are out and now available at
>http://www.sagemath.org/src/
On a P4 with Ubuntu 8.04.2 with gcc 4.2.3-1ubuntu6 and
texlive-common 2007-13. I installed the biopython
and database* and sagetex and jsmath-fonts
On Feb 22, 10:01 pm, "Georg S. Weber"
wrote:
> C'mon,
Hi Georg,
> this does need a very thorough doctesting on as many architectures as
> possible! My own overnight run with Sage 3.3 with additionally #5344
> and #4181 applied has finished:
> {{{
>
Hi,
My American Mathematical Society GSM 79 book "Modular Forms: A
Computational Approach" (2007), with an appendix by Paul Gunnels, is
now 100% free, due to a generous contract with Springer-Verlag. You
can download it at the following website:
http://wstein.org/books/modform/
It has Sage
C'mon,
this does need a very thorough doctesting on as many architectures as
possible! My own overnight run with Sage 3.3 with additionally #5344
and #4181 applied has finished:
{{{
--
All tests passed!
Total time for all tests:
Hi Sage Devels, etc.
I am getting very impatient about how slowly work on the Microsoft
Windows Sage Project has been moving. Thus I've started a new project
to really move this forward and actually get something done. I just
put a day's work into it:
http://windows.sagemath.org/
The goal i
Thanks, William. That's just what I needed. -Rob
On Feb 22, 6:18 pm, William Stein wrote:
> On Sun, Feb 22, 2009 at 6:13 PM, Rob Beezer wrote:
>
> > Does Sage use some sort of cache or swap space in your home directory
> > when working at the Sage command line?
>
> > I keep my home directory
On Sun, Feb 22, 2009 at 6:13 PM, Rob Beezer wrote:
>
> Does Sage use some sort of cache or swap space in your home directory
> when working at the Sage command line?
>
> I keep my home directory on a small USB portable notebook hard drive
> and when doing timing experiments with large matrices (2
Does Sage use some sort of cache or swap space in your home directory
when working at the Sage command line?
I keep my home directory on a small USB portable notebook hard drive
and when doing timing experiments with large matrices (25 million
rational entries on a machine with 8 GB) I get notice
On Sun, Feb 22, 2009 at 9:52 PM, Paul Zimmermann
wrote:
>
> I'm not sure I can post to sage-devel. Anyway, if computing Stirling numbers
> reduces to compute factorial-like expressions, the best algorithm I know is
> due to Schönhage; Cf for example for double factorials:
> http://gmplib.org/list
Hi,
Even with gcc-3.4.6 the compilation fails exactly at the same point
(with exactly the same errors). I will ask help tomorrow from the
network engineer.
I will post if I find a solution still using Mandriva 10.2.
Cheers,
Vincent
>
> Hi Vincent,
>
> > > Hmm, something strange is going on he
On Feb 22, 2:34 pm, mabshoff wrote:
> On Feb 22, 2:19 pm, "Georg S. Weber"
> wrote:
>
> > Hi sage-devel,
>
> Hi,
>
>
>
> > currently Sage uses, if possible, the system's malloc.
> > This has a big advantage --- that strategy certainly is the one
> > supporting portability of Sage best.
>
> > I
On Feb 22, 2:19 pm, "Georg S. Weber"
wrote:
> Hi sage-devel,
Hi,
> currently Sage uses, if possible, the system's malloc.
> This has a big advantage --- that strategy certainly is the one
> supporting portability of Sage best.
>
> I don't know if there is a timeline already for the use of cus
Hi sage-devel,
currently Sage uses, if possible, the system's malloc.
This has a big advantage --- that strategy certainly is the one
supporting portability of Sage best.
I don't know if there is a timeline already for the use of customized
"Sage malloc" versions for some (or all) systems Sage r
> > I'm curious if anyone here knows of faster algorithms for harmonic
> > numbers / Stirling numbers? This list seems like the right place to
> > ask :-)
>
> I don't know, but hopefully someone will see the bump and respond.
> Paul Zimmermann might be the right guy, but he doesn't read sage-deve
On Feb 22, 12:18 pm, Bernie wrote:
Hi Bernie,
> Hi! If not so much problem can anybody tell me how to fix this
> problems? I'm trying to add some structures as Vincent did, but all my
> problems are still here after some hours of work :-(
> I did something similar to Vincent, adding my ne
Hi! If not so much problem can anybody tell me how to fix this
problems? I'm trying to add some structures as Vincent did, but all my
problems are still here after some hours of work :-(
I did something similar to Vincent, adding my new package to
$SAGE_ROOT/devel/sage/sage, and modify the all
On Feb 21, 7:58 am, Fredrik Johansson
wrote:
> Hi,
Hi Fredrik,
> Looking around, it seems Sage does not yet implement harmonic numbers
> (except via SymPy)? If anyone is interested, I benchmarked a few
> different algorithms and blogged about it
> here:http://fredrik-j.blogspot.com/2009/02/h
On Feb 22, 10:07 am, Vincent Delecroix <20100.delecr...@gmail.com>
wrote:
Hi Vincent,
> > Hmm, something strange is going on here. I am surprised boehmgc runs
> > make check, but it isn't a good sign.
>
> I launch myself the make check. That's not a part of the compilation
> (If it's what your
> Hmm, something strange is going on here. I am surprised boehmgc runs
> make check, but it isn't a good sign.
I launch myself the make check. That's not a part of the compilation
(If it's what your questioning about).
--~--~-~--~~~---~--~~
To post to this group,
On Feb 22, 9:37 am, Vincent Delecroix <20100.delecr...@gmail.com>
wrote:
> Hi Michael,
Hi Vincent,
> It will be hard to have a sane gcc on my Mandriva. I built gcc 3.4.6
> without any error but I get an error during tests.
>
> make -k check
> [...]
> make[3]: Entering directory `/usr/local/gcc
Hi Michael,
It will be hard to have a sane gcc on my Mandriva. I built gcc 3.4.6
without any error but I get an error during tests.
make -k check
[...]
make[3]: Entering directory `/usr/local/gcc-3.4.6/obj/i686-pc-linux-
gnu/boehm-gc'
Switched to incremental mode
Emulating dirty bits with mprote
should work now, the remaining problem is that they are outdated, but
this will be fixed soon i hope ;)
h
On Feb 21, 11:26 pm, ahmet alper parker wrote:
> This link is not working:http://sagemath.org/paper-letter/
> It is under doc page/pdf versions link...
--~--~-~--~~~
On Feb 22, 5:57 am, mabshoff wrote:
> On Feb 22, 5:49 am, Vincent Delecroix <20100.delecr...@gmail.com>
> wrote:
> > libm4ri testsuite failed, please report upstream!
> > sage: An error occurred while installing libm4ri-20090128
>
> We need more context, i.e gzip install.log and please post
On Feb 22, 5:49 am, Vincent Delecroix <20100.delecr...@gmail.com>
wrote:
> Hi,
Hi Vincent,
> I try to compile the sage-3.3 sources on my :
> Linux iml88 2.6.11-6mdk #1 Tue Mar 22 16:04:32 CET 2005 i686 Intel(R)
> Pentium(R) 4 CPU 2.80GHz unknown GNU/Linux
>
> The m4ri tests fails due to Segmen
Hi,
I try to compile the sage-3.3 sources on my :
Linux iml88 2.6.11-6mdk #1 Tue Mar 22 16:04:32 CET 2005 i686 Intel(R)
Pentium(R) 4 CPU 2.80GHz unknown GNU/Linux
The m4ri tests fails due to Segmentation fault. Here is the
corresponding part of the install.log :
creating test_solve
make[3]: Lea
On Sun, Feb 22, 2009 at 1:30 AM, Rob Beezer wrote:
>
> I have been walking through some of the matrix code before adding some
> enhancements.
>
...
>
> Proposal: Place the guts of kernel computations for each
> (specialized) class into a right_kernel() method, where it would seem
> to naturall
On Sun, Feb 22, 2009 at 1:25 AM, Ondrej Certik wrote:
>
>
> It's because sympy, sympycore and pynac were all written by different
> people and as of now they are not compatible. I don't like the
> situation either, and if I manage to find funding for the summer, I'd
> like to speedup sympy using
On Tue, 17 Feb 2009 19:47:50 -0800
William Stein wrote:
>
> On Tue, Feb 17, 2009 at 7:16 PM, Jason Grout
> wrote:
> >
> > I was tinkering around trying to get the following to work:
> >
> > f(x,y,z) = vector([x^2,y+z,x*y*z])
> >
> > which defines a 3d vector field, or in general, some function
31 matches
Mail list logo
