[sage-devel] sage-4.4.1

2010-05-02 Thread William Stein
Hi, I've released sage-4.4.1: http://sage.math.washington.edu/home/wstein/build/release/4.4.1/sage-4.4.1.tar -- William Stein Professor of Mathematics University of Washington http://wstein.org -- To post to this group, send an email to sage-devel@googlegroups.com To unsubscribe from this g

[sage-devel] Re: erf + solve

2010-05-02 Thread Ross Kyprianou
> You should add a new integrator function and register it in the > dictionary sage.symbolic.integration.integral.available_integrators. > > At some point we also need to come up with a protocol to allow these > functions to transform the input and pass it on to be processed by the > next one in th

[sage-devel] Re: numerically stable fast univariate polynomial multiplication over RR[x]

2010-05-02 Thread Bill Hart
That should say arbitrary exponents, not arbitrary precision. On May 3, 2:36 am, Bill Hart wrote: > This thread is about multiple precision floating point arithmetic. > What have machine floats got to do with it? > > I'm using mpfr, which is what Sage uses. It has guaranteed rounding > for *arbit

[sage-devel] Re: numerically stable fast univariate polynomial multiplication over RR[x]

2010-05-02 Thread Bill Hart
This thread is about multiple precision floating point arithmetic. What have machine floats got to do with it? I'm using mpfr, which is what Sage uses. It has guaranteed rounding for *arbitrary precision* floats with essentially arbitrary precision exponents (there is a limit of course). There's

[sage-devel] Re: numerically stable fast univariate polynomial multiplication over RR[x]

2010-05-02 Thread rjf
On May 2, 9:02 am, Bill Hart wrote: > On May 2, 4:14 pm, rjf wrote: > > > I repeat, > > > The interesting cases are obvious those which are not covered. > > Sorry, I don't know what you mean. Are you saying that by definition > they are interesting because they are not covered by Joris' algorit

[sage-devel] Pushout of quotient rings

2010-05-02 Thread Simon King
Hi! Am I right that one should have: sage: from sage.categories.pushout import pushout sage: pushout(ZZ.quo(15*ZZ),ZZ.quo(35*ZZ)) Ring of integers modulo 5 ? Currently it raises an error ("ambiguous base extension"), which I think is a bug. If people agree, I will fix it in #8800 (doctest c

Re: [sage-devel] Re: ubuntu 10.4

2010-05-02 Thread William Stein
On Sat, May 1, 2010 at 11:34 PM, William Stein wrote: > On Sat, May 1, 2010 at 5:10 PM, Ross Kyprianou wrote: >>> (You may ask someone else to build a binary for your machine. >>> Otherwise you could report how long the build took on your system, >>> though this depends on the amount of RAM and d

[sage-devel] Re: numerically stable fast univariate polynomial multiplication over RR[x]

2010-05-02 Thread Bill Hart
On May 2, 4:14 pm, rjf wrote: > I repeat, > > The interesting cases are obvious those which are not covered. Sorry, I don't know what you mean. Are you saying that by definition they are interesting because they are not covered by Joris' algorithm, whatever they may be? > > I don't know what y

[sage-devel] Re: numerically stable fast univariate polynomial multiplication over RR[x]

2010-05-02 Thread rjf
I repeat, The interesting cases are obvious those which are not covered. I don't know what your fix is, nor do I especially care, but I gather that, now, at least your "stable" word is meant to indicate something like a small bound in the maximum over all coefficients of the difference in relativ

[sage-devel] Re: numerically stable fast univariate polynomial multiplication over RR[x]

2010-05-02 Thread Bill Hart
Yes, in fact, this method is definitely able to handle these cases. There is a subtlety in the implementation which I had not paid attention to. So yes, it precisely retrieves the answer to this problem. Next challenge? Bill. On May 2, 2:45 pm, Bill Hart wrote: > Hmm, very interestingly, the n

[sage-devel] Re: numerically stable fast univariate polynomial multiplication over RR[x]

2010-05-02 Thread Bill Hart
Hmm, very interestingly, the new method *can* be made to output the correct answer for this problem. I'll have to think about whether doing this will screw anything else up. I think, in the class of problems it is designed to solve, the answer is no, it won't screw others up. Bill. On May 2, 2:1

[sage-devel] Re: numerically stable fast univariate polynomial multiplication over RR[x]

2010-05-02 Thread Bill Hart
It doesn't quite handle this case. But as I'm sure you are aware, neither does the classical algorithm: sage: def rel_prec(approx, actual): return [oo if a==b else -log(abs(a-b)/abs(b), 2) for (a,b) in zip(approx, actual)] sage: R. = QQ[] sage: f = R((x^100-10^100)/(x-10)) sage: g = x-10 sag

[sage-devel] Re: Sage-4.4 cdrom

2010-05-02 Thread emil
On 30 Apr., 20:26, bb wrote: > cch schrieb: > > > > > To bb; > > >> 1. Is there anywhere a md5 available? > >> 2. The downlaod has a speed of about 13 KB/s, not a breakneck speed, one > >> might get it in about 20 hours. Is it possible to copy the iso to > >> another place with large pipes? > >

[sage-devel] Re: abstract matrices

2010-05-02 Thread Ross Kyprianou
This turned out as good as it looked Nicolas A lot of the planned functionality is already in place with this initial code - Thanks! Now it should be possible (for me) to implement some more code (which is indicated in the second section (below) i.e. under the section with title "I need to impleme