#9884: slow coercion of polynomial to list over integer mod ring
-------------------------------+--------------------------
Reporter: dmharvey | Owner: tbd
Type: defect | Status: needs_info
Priority: major | Milestone:
Component: performance | Resolution:
Keywords: | Merged in:
Authors: | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
Dependencies: | Stopgaps:
-------------------------------+--------------------------
Old description:
> Sage 4.5.3, 2.6GHz Opteron, Linux
>
> {{{
> sage: R = Integers(3^20)
> sage: S.<x> = PolynomialRing(R)
> sage: f = S([R.random_element() for i in range(100)])
> sage: timeit("L = f.list()")
> 125 loops, best of 3: 1.13 ms per loop
> }}}
>
> That's about 29000 cycles per coefficient conversion. See also #9883.
New description:
Sage 4.5.3, 2.6GHz Opteron, Linux
{{{
sage: R = Integers(3^20)
sage: S.<x> = PolynomialRing(R)
sage: f = S([R.random_element() for i in range(100)])
sage: timeit("L = f.list()")
125 loops, best of 3: 1.13 ms per loop
}}}
That's about 29000 cycles per coefficient conversion. See also #9883.
--
Comment (by edgarcosta):
Version 7.1.beta3 - Intel(R) Core(TM) i5-4278U CPU @ 2.60GHz
{{{
sage: R = Integers(3^20)
sage: S.<x> = PolynomialRing(R)
sage: f = S([R.random_element() for i in range(100)])
sage: timeit("L = f.list()")
625 loops, best of 3: 85.8 µs per loop
}}}
a bit faster on my slightly faster cpu.
Fast enough?
--
Ticket URL: <http://trac.sagemath.org/ticket/9884#comment:4>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at https://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
