On Oct 30, 11:03 am, "William Stein" <[EMAIL PROTECTED]> wrote:
> On 10/30/07, Paul Zimmermann <[EMAIL PROTECTED]> wrote:
> > 27510639 1080 -rw-rw-r-- 1 zimmerma spaces1098688 Oct 30 11:23
> > /local/spaces/logiciels/sage-2.8.10/p4/sage/devel/sage-main/build/temp.linux-i686-2.5/sage/schemes
On Oct 28, 1:48 pm, cwitty <[EMAIL PROTECTED]> wrote:
> You can download SAGE 2.8.10.rc1
> fromhttp://sage.math.washington.edu/home/cwitty/2.8.10/sage-2.8.10.rc1.tar
> .
>
> Hopefully there will be no more changes before the release of 2.8.10,
> which is expected to ha
You can download SAGE 2.8.10.rc1 from
http://sage.math.washington.edu/home/cwitty/2.8.10/sage-2.8.10.rc1.tar
.
Hopefully there will be no more changes before the release of 2.8.10,
which is expected to happen this evening.
Carl Witty
--~--~-~--~~~---~--~~
To
On Oct 27, 4:54 pm, cwitty <[EMAIL PROTECTED]> wrote:
> You can download SAGE 2.8.10.alpha1
> fromhttp://sage.math.washington.edu/home/cwitty/2.8.10/sage-2.8.10.alpha1...
> .
>
> This contains even more patches from TRAC, plus a slightly patched
> version of Robert&
On Oct 27, 9:52 pm, "Justin C. Walker" <[EMAIL PROTECTED]> wrote:
> On Oct 27, 2007, at 16:54 , cwitty wrote:
>
>
>
> > You can download SAGE 2.8.10.alpha1 from
> >http://sage.math.washington.edu/home/cwitty/2.8.10/
> > sage-2.8.10.alpha1.tar
> &g
You can download SAGE 2.8.10.alpha1 from
http://sage.math.washington.edu/home/cwitty/2.8.10/sage-2.8.10.alpha1.tar
.
This contains even more patches from TRAC, plus a slightly patched
version of Robert's Cython.
You have a little more time to get changes into 2.8.10; I plan to
build 2.8.1
You can download SAGE 2.8.10.alpha0 from:
http://sage.math.washington.edu/home/cwitty/2.8.10/sage-2.8.10.alpha0.tar
This contains the following patches over 2.8.9:
http://sagetrac.org/sage_trac/query?status=closed&summary=%7E%5Bwith&milestone=sage-2.8.10&order=priority
It also conta
On Oct 25, 9:14 am, "David Joyner" <[EMAIL PROTECTED]> wrote:
> On 10/25/07, William Stein <[EMAIL PROTECTED]> wrote:
> > On 10/25/07, Bill Hart <[EMAIL PROTECTED]> wrote:
> > > For example, does the Lisp entry in
> > > mercurial-0.9.5 python=27386,sh=8300,tcl=3484,lisp=1411,ansic=1364
> > >make s
On Oct 23, 9:52 pm, "William Stein" <[EMAIL PROTECTED]> wrote:
> Hi,
>
> Our opinion piece "Open Source Mathematical Software"
> appeared in the Notices of the AMS this month:
>
> http://www.ams.org/notices/200710/
>
> The link to the article is on the upper-right corner of the page.
>
>
On Oct 23, 6:24 pm, Robert Bradshaw <[EMAIL PROTECTED]>
wrote:
> Is there a way to get the size of an integer (really fast, like a
> macro getting the number of words)? One could perhaps override
> _strassen_default_cutoff (though I don't know how much overhead this
> would be for matrices with sm
On Oct 21, 10:36 am, "Justin C. Walker" <[EMAIL PROTECTED]> wrote:
> I see the same problem as others have reported, but I have no
> optional packages installed. If I run 'gap_console()', and then
> 'LoadPackage("hap");', I get 'failed' as output.
Yes, that's as expected. For 2.8.8, William (ac
On Oct 21, 9:34 am, "William Stein" <[EMAIL PROTECTED]> wrote:
> On 10/21/07, Jaap Spies <[EMAIL PROTECTED]> wrote:
> > There seems to be some typos in the test of gap.py
>
> These are not typos. The behavior of gap-4.4.10 changed from that
> of gap-4.4.9, and the doctests reflect that change. E
On Oct 21, 5:30 am, "William Stein" <[EMAIL PROTECTED]> wrote:
> Carl: Paul has some suggestions for changing how real numbers
> print below. What do you think?
I have no particular opinion. I've never dealt with floating-point
numbers in any computer algebra system other than Sage, so I don't
On Oct 18, 2:00 pm, "alex clemesha" <[EMAIL PROTECTED]> wrote:
> I'm considering doing a semi-major clean up of the
> plotting functionality so please jot down improvements
> that you (or anyone) think could be made.
See TRAC #924 for a bug-fix I would like. (I reported this in person
at SD4, bu
> > > > > I understand. It would indeed be god to have some sort of "preparse
> > > > > then import" command. Any suggestions for how it would work (i.e.,
> > > > > from the user's point of view)? Making
> > > > > import foo
> > > > > work if foo.sage is there isn't really an option, sinc
On Oct 16, 8:32 pm, "didier deshommes" <[EMAIL PROTECTED]> wrote:
> 2007/10/16, Steffen <[EMAIL PROTECTED]>:
>
> > Hi didier,
>
> > the implementation does not return a polynomial of a total degree of
> > at most 4, but a polynomial of total degree of at most 4/2 = 2 in x
> > and in y. If I change
On Oct 13, 6:51 am, "Joel B. Mohler" <[EMAIL PROTECTED]> wrote:
> I'm wondering if we could have a vote on preferred syntax. I'm not going to
> describe the parameters because if they are not clear enough from context, it
> probably isn't a good parameter choice :) :
>
> sage: P.=ZZ[]
> sage: f=(
On Oct 13, 1:56 pm, Jaap Spies <[EMAIL PROTECTED]> wrote:
> cwitty wrote:
> > On Oct 13, 10:30 am, Jaap Spies <[EMAIL PROTECTED]> wrote:
> >> In sloane_functions.py sequence can now be indexed by reals!?
> >> a(1.0) returns a value. Formerly an error was r
On Oct 13, 10:30 am, Jaap Spies <[EMAIL PROTECTED]> wrote:
> In sloane_functions.py sequence can now be indexed by reals!?
> a(1.0) returns a value. Formerly an error was raised.
In SloaneSequence.__call__() (which is shared among all sequences) the
first thing it does is "m = ZZ(n)", to coerce i
On Oct 12, 12:27 pm, [EMAIL PROTECTED] wrote:
> On Fri, 12 Oct 2007, Joel B. Mohler wrote:
> > Hmm, possibly. kwargs feels scary to me with variables since the 'x' in the
> > kwargs parameter list is a totally different 'x' than the one in P.gen(0).
> > They just happened to be named the same in
On Oct 12, 8:47 am, "Joel B. Mohler" <[EMAIL PROTECTED]> wrote:
> Sorry for the continued barrage of silly questions. It's my day to go through
> sage gotcha's I'd accumulated.
>
> Why doesn't this next substitution result in 5/y?
>
> sage: P.=ZZ[]
> sage: (x/y).subs({x:5}) # this should be 5/y
On Oct 12, 7:36 am, "Joel B. Mohler" <[EMAIL PROTECTED]> wrote:
> This e-mail is too long. Here's the bottom line: I suggest that the
> coefficient method on a multivariate polynomial ring take a dictionary
> indicating the variables and degrees that you want to restrict your attention
> to.
So
On Oct 9, 10:22 pm, John Voight <[EMAIL PROTECTED]> wrote:
> Hello all:
>
> I was hoping you could help me with this unbelievably trivial problem.
>
> Fix an integer B of size about 10 decimal digits, so too big to be an
> unsigned long int but not much bigger.
>
> PROBLEM: Given an integer d of s
On Oct 8, 5:47 pm, David Harvey <[EMAIL PROTECTED]> wrote:
> Hi Carl,
>
> I haven't yet thought hard about the details of what you propose, but
> I'm just curious why you are suggesting to use gmp_randstate_t as the
> "most basic type".
Well, it's not a very good reason. It's because I said "Cyt
On Oct 8, 10:10 am, "William Stein" <[EMAIL PROTECTED]> wrote:
> I agree. However, I strongly encourage people to discuss
> this a bit longer in sage-devel before implementing something.
> Whatever we do it will likely be easy to implement but hard
> to design.
OK, here's my preliminary proposal
On Oct 8, 7:36 am, "William Stein" <[EMAIL PROTECTED]> wrote:
> I do encourage David to open a trac ticket about this. He's right that
> seeding the random number generator should be possible via a command
> line argument at startup.
But which random number generator? libc, Python, libpari, NTL
On Sep 28, 9:04 am, Bill Hart <[EMAIL PROTECTED]> wrote:
> It would truly be interesting to do a profile of a complex interval
> approach against a purely algebraic approach. It sounds like a
> question begging to be answered.
Yes. (Along with a purely interval approach, with the root separation
On Sep 26, 7:31 am, Jason Grout <[EMAIL PROTECTED]> wrote:
> Can we define custom infix operators? Suppose I'd like "boxproduct" to
> be an infix operator. Could I make that work?
>
> Thanks,
>
> Jason
If you're willing to put a lot of effort into the project, you might
be able to do something
On Sep 25, 6:40 pm, Bill Hart <[EMAIL PROTECTED]> wrote:
> I still have a question about how one computes an approximate
> polynomial for a + b for algebraic a and b, given approximate
> polynomials for a and b, using interval arithmetic.
I don't. :-)
There are several possible representations f
On Sep 25, 4:37 pm, Bill Hart <[EMAIL PROTECTED]> wrote:
> Here is my second question (one looks doubly smart if one has two
> difficult questions and still no clue): is it true that one can easily
> tell if two algebraic numbers are *not* equal in this system, but to
> check if they are equal, on
On Sep 25, 12:31 pm, Robert Bradshaw <[EMAIL PROTECTED]>
wrote:
> GMP 4.2.2 is LGPLv3, not GPLv3, so I think it would still work
> (though as I did mention, this is still an issue if we use anything
> with the (non-library) GPL). My proposal was that SAGE would be our
> GPL derivative but without
On Sep 25, 12:18 pm, [EMAIL PROTECTED] wrote:
> Hence, if Sage cannot function without GPL3 software, it *must* be licensed
> under GPL3, and no other license. Therefore, "GPL2 or later" truly means
> "GPL3" the instant that we include gmp4.2.2, no matter what we might tell
> ourselves. Similarl
On Sep 25, 11:24 am, Bill Hart <[EMAIL PROTECTED]> wrote:
> Actually, to make it work, it might have to switch between polar
> coordinates and rectangular coordinates, always ensuring the point you
> are talking about is inside the region, regardless of whether it is a
> polar rectangle or a right
On Sep 25, 10:10 am, Bill Hart <[EMAIL PROTECTED]> wrote:
> Actually, someone sent me some very good code for doing complex root
> approximation in FLINT. But I've been too damned lazy to properly
> incorporate it in FLINT. I will get around to it soon.
>
> Carl if you can give me a specific inter
On Sep 25, 9:28 am, "John Cremona" <[EMAIL PROTECTED]> wrote:
> I thought this had been solved some time ago, and was implemented in
> pari. Or is that only for real roots of real polynomials?
>
> John
>
> On 9/25/07, cwitty <[EMAIL PROTECTED]> wrote:
&
On Sep 25, 8:02 am, Bill Hart <[EMAIL PROTECTED]> wrote:
> Well that answered my next question, which is whether this method
> could be used for Qbar.
The biggest obstacle to handling Qbar directly is that I haven't found
a good way of isolating the roots of a complex polynomial (that is,
finding
On Sep 20, 11:46 am, Jason Grout <[EMAIL PROTECTED]> wrote:
> 1. When I make changes to, say, devel/sage-branch/sage/graphs/graph.py,
> I don't see those changes available in SAGE. For example, I added a
> function to the Graph class, but I couldn't access that function when I
> started up SAGE.
On Sep 20, 6:35 am, Bill Hart <[EMAIL PROTECTED]> wrote:
> On 20 Sep, 06:39, Robert Bradshaw <[EMAIL PROTECTED]>
> wrote:
>
> > Carl Witty did an implementation of the Algebraic Reals by letting
> > every element be specified by a polynomial and an interval containing
> > a single root. I've been
On Sep 12, 1:30 pm, Robert Bradshaw <[EMAIL PROTECTED]>
wrote:
> On Sep 12, 2007, at 1:06 PM, William Stein wrote:
> >>> I have a few design questions that I would like to discuss and they
> >>> are relevant to both SymPy and SAGE, so I am posting to both
> >>> mailinglists.
>
> > Thanks. I wa
On Sep 4, 1:09 pm, "David Joyner" <[EMAIL PROTECTED]> wrote:
> Hi:
> I'm giving an "Intro to SAGE" next week in Germany at the GAP conference.
> The slides are posted
> athttp://www.opensourcemath.org/wdj/writing/gap2007/sage-9-2007.pdf
> and I was wondering if anyone had any suggestions or comme
On Sep 4, 12:31 pm, Robert Miller <[EMAIL PROTECTED]> wrote:
> Using numpy, reasonably accurate means up to only a few places, not
> the full double precision. This leads to badness when you try to
> factor anything. If it finds that 1.112451357 is a root of
> (x-1)^3, you will likely get a qu
On Sep 4, 9:35 am, "John Voight" <[EMAIL PROTECTED]> wrote:
> In my situation, I have the following absurdly easy case: I have a
> real interval in which I know there is exactly one real root which I
> need to know to maybe 6 or 10 digits of precision. The polynomials
> are monic, have small inte
On Sep 3, 10:43 am, John Voight <[EMAIL PROTECTED]> wrote:
> (2) Real root finding predominates the computation. I was hoping that
> numpy would do this the fastest--but now it seems to be giving erratic
> results (see http://trac.sagemath.org/sage_trac/ticket/583). It may
> turn out that most o
On Aug 14, 12:59 am, Jonathan Bober <[EMAIL PROTECTED]> wrote:
> This is exactly what NTL does in its quad float class. Just about every
> function starts and ends with a macro to adjust the fpu, resulting in
> around 7 extra assembly instructions. In the following code, the
> overhead is quite si
On Aug 11, 6:03 pm, Jonathan Bober <[EMAIL PROTECTED]> wrote:
> I have just noticed that using the C type long double from within sage
> doesn't work the way that I've expected it to.
>
> The issue is a little complicated, and other people on this list
> probably know more about it than I do, but,
On May 23, 12:18 pm, "Kate Minola" <[EMAIL PROTECTED]> wrote:
> Using the lastest stable release of the gcc compiler suite (gcc-4.2.0),
> linbox fails to build. The first few errors are
...
> /home/kate/sage/sage-2.5.3-x86_64-Linux-pompey/local/include/linbox/algorithms/blas-domain.h:443:
> error
On May 14, 6:40 am, Martin Albrecht <[EMAIL PROTECTED]>
wrote:
> Please excuse my ignorance, but is this definition well known or should it be
> given in the docstring? Also, how did the idea came up that SAGE needs this
> method? I am just curious and trying to learn what people use MPolynomials
most recent call last):
File "setup.py", line 268, in
build_image(ext_modules, packages, NUMERIX)
File "/home/cwitty/rc2-sage/spkg/build/matplotlib-0.90.0.p1/
setupext.py", line 752, in build_image
add_agg_flags(module)
File "/home/cwitty/rc2-sa
On May 6, 9:24 am, "William Stein" <[EMAIL PROTECTED]> wrote:
> Hello,
>
> I've posted sage-2.5.alpha3 here:
>
>http://sage.math.washington.edu/home/was/sage2.5/
>
> Feedback is welcome.
On my machine running Debian testing, plotting-related tests fail with
messages like:
libpng error: Incom
On Mar 28, 12:39 pm, Robert Bradshaw <[EMAIL PROTECTED]>
wrote:
> On Mar 28, 2007, at 10:27 AM, cwitty wrote:
> > In the following carefully chosen example, we see a case where a
> > native double result (or a result using RDF) has only 4 correct digits
> > (about 12 bi
On Mar 28, 12:53 am, Robert Bradshaw <[EMAIL PROTECTED]>
wrote:
> Thank you. This is exactly the kind of information I was looking for.
> I knew about the range of values limitation, but was only vaguely
> aware of the rest. The situation I'm thinking of is the default
> implicit ring (e.g. when o
On Mar 27, 12:12 pm, Robert Bradshaw <[EMAIL PROTECTED]>
wrote:
> Yes, I am aware that lots of doctests would break, but if its just a
> change in the last decimal or two(?) I'm OK with fixing that. I'm
> wondering if anyone knows of any algorithms/etc. that rely on MPFR 53-
> bit rather than nati
52 matches
Mail list logo
