On Sep 24, 9:48 am, Robert Bradshaw <[EMAIL PROTECTED]>
wrote:
> On Sep 24, 2008, at 3:42 AM, mabshoff wrote:
Hi Robert,
> > What is new in alpha1:
>
> > * Robert Bradshaw: more new coercion merges (causes speed regression
> > in sr.py by about 40%, but since that sucks anyway we can bear with it
> > a little longer until Robert fixes it)
>
> To my defense, that slowdown was all in a single #long doctest that
> created a huge number of examples of varying sizes--the rest of the
> file experienced a speedup. The new coercion model pays a slightly
> higher price for discovery for a lower price doing arithmetic
> thereafter.
I am not blaming you here (well, a little I guess :), I just wanted to
point out that there is a problem), but I thought that the new
coercion model allows us to fix the above problem when coercion mv
polynomial rings with loads (thousands!) of indeterminates. IIRC the
problem is that when doing the coercion we end up creating a couple
thousand mv polynomial rings until we finally get to the one we want
and need. The fix discussed at SD6 was to first check some special
cases, but I am sure malb has a much better recollection of the issue
and the suggested fix here.
Cheers,
Michael
--~--~---------~--~----~------------~-------~--~----~
To post to this group, send email to sage-devel@googlegroups.com
To unsubscribe from this group, send email to [EMAIL PROTECTED]
For more options, visit this group at http://groups.google.com/group/sage-devel
URLs: http://www.sagemath.org
-~----------~----~----~----~------~----~------~--~---
