On Tuesday 19 July 2011, William Stein wrote:
> Dear Sage-devel,
>
> The 2011 recipient of the Spies Sage Development Prize
> (http://www.sagemath.org/development-prize.html) goes to Robert
> Bradshaw.
>
> "Robert Bradshaw has been an extremely active and productive Sage
> developer for over five
+1!
--
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from this group, send an email to
sage-devel+unsubscr...@googlegroups.com
For more options, visit this group at http://groups.google.com/group/sage-devel
URL: http://www.sagemath.org
Sorry for the monologue, but here are some more observations:
The parenting situation is much improved if Hom sets depend on the
domain/codomain on the nose and not just on their isomorphism class. This is
probably more natural, too:
Hom(A,B) is Hom(A',B')<=>A is A' and B is B'
Now the
On Jul 18, 2:48 pm, Simon King wrote:
> Congratulations, Robert! A well-deserved award!
+1!
--
To post to this group, send an email to sage-devel@googlegroups.com
To unsubscribe from this group, send an email to
sage-devel+unsubscr...@googlegroups.com
For more options, visit this group at http
On Mon, Jul 18, 2011 at 2:48 PM, Simon King wrote:
> On 18 Jul., 22:52, William Stein wrote:
>> The 2011 recipient of the Spies Sage Development Prize
>> (http://www.sagemath.org/development-prize.html) goes to Robert
>> Bradshaw.
>
> Congratulations, Robert! A well-deserved award!
Congratulatio
On 18 Jul., 22:52, William Stein wrote:
> The 2011 recipient of the Spies Sage Development Prize
> (http://www.sagemath.org/development-prize.html) goes to Robert
> Bradshaw.
Congratulations, Robert! A well-deserved award!
--
To post to this group, send an email to sage-devel@googlegroups.com
T
Hi Ivo and all others,
On 18 Jul., 18:27, Ivo Hedtke wrote:
> If the cutoff-parameter is determined by the benchmark: Yes, submit it!
The cutoff-parameter is not hard-wired. So, everyone can find his/her
own.
> I look forward to review your patch.
The patch is at trac ticket #11610, together w
Reviewers,
The .spkg to include the new Jmol and new controls for Jmol in the Flask
notebook has been updated to include the command line launch script. This
ticket needs to be reviewed.
http://trac.sagemath.org/sage_trac/ticket/11503
Thanks,
Jonathan
Dr. Jonathan H.
Dear Sage-devel,
The 2011 recipient of the Spies Sage Development Prize
(http://www.sagemath.org/development-prize.html) goes to Robert
Bradshaw.
"Robert Bradshaw has been an extremely active and productive Sage
developer for over five years. Additionally, he has been a leader,
both in maintainin
On Mon, Jul 18, 2011 at 10:22 AM, john_perry_usm wrote:
> Robert,
>
> I did use a .pyx file.(The output from the profiler
> has ..._calc_pi_pyx not _calc_pi_spyx).
>
> If I decorate the function, I get the following error message (after
> importing cython):
>
>>> ...calc_pi_pyx_0.pyx:7:0: Cdef fun
Hi all. I think there's a problem with the following:
sage: K. = NumberField(x^2 - x - 1)
sage: I = K.ideal(2 * a - 1)
sage: I2 = I.factor()[0][0]
# I is a prime ideal, so its only factor is itself:
sage: print I, I2, I == I2
Fractional ideal (2*a - 1) Fractional ideal (2*a - 1) True
# also, the
Robert,
I did use a .pyx file.(The output from the profiler
has ..._calc_pi_pyx not _calc_pi_spyx).
If I decorate the function, I get the following error message (after
importing cython):
>> ...calc_pi_pyx_0.pyx:7:0: Cdef functions/classes cannot take arbitrary
>> decorators.
So neither works.
Hi Simon,
Am 18.07.2011 um 18:36 schrieb Simon King:
> Anyway, I think Strassen multiplication should become the default for
> Matrix_modn_dense.
>
> What do people think?
I am no fan of Strassen as standard method.
I usually work with very large matrices. For this size the memory issue is ver
PS:
On 18 Jul., 18:22, Simon King wrote:
> ...
> 3rd test: Multiplication of two 2000x2000 matrices over GF(125).
> Default multiplication takes ages.
> New Strassen implementation, cutoff=20: 427 seconds using 6.9% of my
> computer's memory.
> Old Strassen implementation, cutoff=20: 431 seconds
Hi Simon,
wow, I am impressed.
If the cutoff-parameter is determined by the benchmark: Yes, submit it!
In the other case I see the problem of how to define the cutoff in a good way.
In this case the method could be significantly slower.
I look forward to review your patch.
Best wishes from H
Hi Ivo,
On 18 Jul., 16:44, Ivo Hedtke wrote:
> what would be a nice piece of work. Good luck and have fun ;-)
Thank you! I had fun...
> Please test the following if your implementation is ready: Try to use your
> Strassen implementation only with 1 step of recursion (in the next step only
> t
Hi Simon,
what would be a nice piece of work. Good luck and have fun ;-)
Please test the following if your implementation is ready: Try to use your
Strassen implementation only with 1 step of recursion (in the next step only
the naive algorithm). And a second version with only 3 steps of recurs
On Wed, Jul 13, 2011 at 7:16 PM, john_perry_usm wrote:
> Hi
>
> In a previous thread, Martin Rubey had problems running the profiler
> in Cython. See
>
> http://groups.google.com/group/sage-devel/browse_thread/thread/81d1cc666e1ffbe6/
>
> His question seemed to have gone unresolved.
>
> I'm having
I've got the following issue while trying to make scheme Hom sets unique,
though nothing is specific to schemes in the following. Really, consider the
following structure:
1. Some Python class of objects
2. Morphisms of objects
3. Parents of morphisms
4. Such that objects contain a morphism as P
Hi Ivo,
On 18 Jul., 13:32, hedtke wrote:
> With the in-memory variant I mean: "Boyer, Dumans, Pernet and Zhou: Memory
> efficient scheduling of Strassen-Winograd's matrix multiplication algorithm.
> International Symposium on Symbolic and Algebraic Computation 2009."
Of course, I can not speak
Great!!
I have to be in Grenoble during that period for teaching but I'll try
to arrange some free time to hang around on IRC and work remotely with
you guys during that period.
Clément
On Jul 18, 12:05 pm, Martin Albrecht
wrote:
> > When I get a chance I will take a look at redoing the template
Hi Ivo,
On Jul 18, 1:32 pm, hedtke wrote:
> With the in-memory variant I mean: "Boyer, Dumans, Pernet and Zhou: Memory
> efficient scheduling of Strassen-Winograd's matrix multiplication algorithm.
> International Symposium on Symbolic and Algebraic Computation 2009."
>
> This needs only a cons
Hi Ivo,
On 18 Jul., 13:32, hedtke wrote:
> I know Strassen-Winograd. Strassen uses 18 additions, Strassen-Winograd only
> 15, which is optimal for 7 multiplications ;-)
Looking at sage.matrix.strassen.strassen_multiply_window, I find 15
additions/subtractions. So, it seems that Strassen==Strass
Hi Simon and Martin,
I know Strassen-Winograd. Strassen uses 18 additions, Strassen-Winograd only
15, which is optimal for 7 multiplications ;-)
With the in-memory variant I mean: "Boyer, Dumans, Pernet and Zhou: Memory efficient
scheduling of Strassen-Winograd's matrix multiplication algorith
PS:
On 18 Jul., 12:44, Simon King wrote:
> > Usually, when people talk about Strassen they mean Strassen-Winograd, is
> > that
> > what you mean? It just reduces the number of additions.
>
> My guess is that Ivo refers to Coppersmith-Winograd, which, according
> to Wikipedia, *is* faster than St
Hi Martin,
On 18 Jul., 12:32, Martin Albrecht
wrote:
> > Why not Winograd's method.
>
> Usually, when people talk about Strassen they mean Strassen-Winograd, is that
> what you mean? It just reduces the number of additions.
My guess is that Ivo refers to Coppersmith-Winograd, which, according
to
Hi Ivo,
On 18 Jul., 12:15, Ivo Hedtke wrote:
>
> Why do you wan't to use Strassen for Matrix Multiplication? This algorithms is
> not as stable as naive algorithm (if one uses floating point numbers, if you
> use
> it for symbol computations that is no problem).
I work over finite fields.
> It
On Monday 18 July 2011, Ivo Hedtke wrote:
> Hi,
Hi Ivo,
> I am new to sage-devel. Sorry if I asked questions that you perhaps
> discussed in the the past.
>
> Why do you wan't to use Strassen for Matrix Multiplication? This algorithms
> is not as stable as naive algorithm (if one uses floating p
Hi,
I am new to sage-devel. Sorry if I asked questions that you perhaps discussed in
the the past.
Why do you wan't to use Strassen for Matrix Multiplication? This algorithms is
not as stable as naive algorithm (if one uses floating point numbers, if you use
it for symbol computations that i
Hi Burcin,
On 18 Jul., 11:37, Burcin Erocal wrote:
> AFAIK, there are 3 tickets on trac: 4260, 4968, 4258
Thank you!
> Perhaps you can help with the pickling, coercion, etc. problems once I
> get the linbox wrapper working. ;)
I can at least try.
In the meantime, I work on improving MeatAxe.
> When I get a chance I will take a look at redoing the template
> structure in the dense_ctypes.patch. I am back to normal schedule
> only today, so this will probably happen sometime tomorrow.
>
> Perhaps you can help with the pickling, coercion, etc. problems once I
> get the linbox wrapper wor
Hi Simon,
On Thu, 14 Jul 2011 07:40:24 -0700 (PDT)
Simon King wrote:
> On 14 Jul., 16:37, Simon King wrote:
> > Perhaps it would be best to study
> > http://sage.math.washington.edu/home/burcin/dense_ctypes.patch
>
> Is there a ticket where that patch is dealt with?
AFAIK, there are 3 tickets
32 matches
Mail list logo
