On Aug 28, 2:34 am, Nils Bruin <[EMAIL PROTECTED]> wrote:
> Probably something for upstream. Serious error in determinant of an
> integer matrix. Sometimes, 0 is returned for a full rank matrix. This
> is accompanied by some printed error warning, but no exception is
> raised. A bug has been fil
Come to think of it, it is not sufficient to compute the binomial
coefficients separately. One wants to compute each of them from the
previous one.
Bill.
On 28 Aug, 04:00, Bill Hart <[EMAIL PROTECTED]> wrote:
> Yep. After some timing experiments, I think Magma uses only two
> tricks:
>
> 1) For
Yep. After some timing experiments, I think Magma uses only two
tricks:
1) For length 2 polynomials it just writes the answer down without
polynomial multiplication (actually GMP has fast computation of
binomial coefficients, so this wouldn't be hard to implement in sage).
2) Polynomials are shi
OK I committed the FLINT code to the repository. If you aren't using
an Opteron you need to remove the -march and -mtune parts from the
makefile or replace them with ones suitable for your system.
Also you need to put in the directories where GMP can be found. You'll
want GMP with Pierrick Gaudry
Yeah, Magma and singular probably just do it using binomial
coefficients.
>time f:=(1+2*x+x^2)^(2^12);
Time: 2.040
This is equivalent to (1+x)^(2^13) but as you see, the time is much
greater in Magma for the former.
Still:
> time f:=(x+x^2)^(2^13-1);
Time: 0.450
which means Magma will do the
Probably something for upstream. Serious error in determinant of an
integer matrix. Sometimes, 0 is returned for a full rank matrix. This
is accompanied by some printed error warning, but no exception is
raised. A bug has been filed:
http://sagetrac.org/sage_trac/ticket/498
but given that this act
You can get access to the development version of FLINT at its svn
repository:
https://flint.svn.sourceforge.net/svnroot/flint/trunk
But to be honest, I had to hack FLINT a little due to some bugs this
question exposed. I hadn't yet implemented aliasing in all the FLINT
multiplication functions s
Hi,
...and Singular (via Martin Albrecht's wrapping) is quite good
for this calculation:
sage: R. = QQ[]
sage: time f = (1+x)^(2^13-1)
CPU times: user 0.01 s, sys: 0.06 s, total: 0.07 s
Wall time: 0.07
sage: R. = GF(389)[]
sage: time f = (1+x)^(2^13-1)
CPU times: user 0.00 s, sys: 0.00 s, total:
Wow, that's fast! Where can I download this?
On Mon, 27 Aug 2007, Bill Hart wrote:
>
> I wrote up a ridiculously naive polynomial powering function in FLINT.
> Here is a basic FLINT program for computing the above powers:
>
>fmpz_poly_t poly, power;
>fmpz_poly_init(power);
>fmpz_po
William and I met earlier today, and we've resolved this particular issue (and
perhaps as an almost immediate consequence, the P+P vs. P*2 issue). It turns
out that the binary exponentiation algorithm has an extra multiply at the end,
which isn't used.
On Mon, 27 Aug 2007, Bill Hart wrote:
I wrote up a ridiculously naive polynomial powering function in FLINT.
Here is a basic FLINT program for computing the above powers:
fmpz_poly_t poly, power;
fmpz_poly_init(power);
fmpz_poly_init(poly);
fmpz_poly_set_coeff_ui(poly, 0, 1);
fmpz_poly_set_coeff_ui(poly, 1, 1);
It's very simple, and I like their approach a lot. I've always been
frustrated with GUI equation editors, and if/before I knew LaTeX I
would have loved to have a tool like this.
Of course, I've always been a programmer who likes to edit raw
source, so I may be the exception.
- Robert
On A
Jurgis wrote:
> may be it can (optionaly) be integrated into sage notebook - looks nice..
> http://digg.com/software/New_google_gadget_Equation_Editor
When I see web-based math 'gadgets' like this, what comes to mind is
giving them the ability to actually do calculations by plugging them
into a
I was recently contacted by Niell Clift, who is arguably the foremost expert on
addition chains. Though he's most concerned with computing minimal addition
chains, which aren't always optimal and can take a ridiculous amount of time to
compute, I believe that some of the work that he's done ca
On 8/26/07, mabshoff <[EMAIL PROTECTED]> wrote:
> > > Does anyone in the SAGE development group have a version of Microsoft
> > > Windows that supports Microsoft Virtual PC 2007? I have Vista Home
> > > Premium on my laptop but it does not support Microsoft Virtual PC
> > > 2007.
> >
> > Very inte
there are good discussions about creating a two dimensional math input
system in the old w3c mailing list archives for (what became) mathml
http://lists.w3.org/Archives/Public/w3c-math-erb/
On Aug 27, 12:48 am, "William Stein" <[EMAIL PROTECTED]> wrote:
> On 8/25/07, Jurgis Pralgauskis <[EMAIL P
16 matches
Mail list logo
