Patch up at http://trac.sagemath.org/sage_trac/ticket/9887
It speeds up the issues pointed out in #9882, #9883, #9884, #9885 and
#9887. It should fix #9886 as well; I'm not sure why it doesn't. #9888 is
still unresolved.
It depends on #7883, #8333, #8334 and #9814 (this last is positively
review
On Friday, September 10, 2010, Tom Boothby wrote:
>> The examples of slow things I gave are things that should be fast,
>> even in the Sage interpreter. All of these things are fast in Magma
>> for example, which is also an interpreted language, and this is the
>> main reason that Magma is so popu
There are some implemented coercion maps already (see
sage.rings.finite_rings.integer_mod.Integer_to_IntegerMod). Many of these
tickets can be solved by writing optimized coercion and conversion morphisms
and including appropriate section() functions on some of them. See the
patch at #9814, thoug
On Thu, Sep 9, 2010 at 9:24 AM, David Harvey wrote:
> Dear sage-devel,
>
> Sage is very slow. I discovered this (again) while trying to write a
> prototype of an algorithm for computing zeta functions of projective
> varieties. I need to multiply lots of polynomials and matrices over finite
> ring
Dear sage-devel,
Sage is very slow. I discovered this (again) while trying to write a
prototype of an algorithm for computing zeta functions of projective
varieties. I need to multiply lots of polynomials and matrices over
finite rings, and frequently move coefficients between polynomials
